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.r297-tall-167873950900733.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 ltsminxred
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 r297-tall-167873950900733
=====================================================================

--------------------
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 1679627519375

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J40
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 03:12:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-24 03:12:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 03:12:01] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2023-03-24 03:12:01] [INFO ] Transformed 629 places.
[2023-03-24 03:12:01] [INFO ] Transformed 1590 transitions.
[2023-03-24 03:12:01] [INFO ] Parsed PT model containing 629 places and 1590 transitions and 10704 arcs in 230 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 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-24 03:12:01] [INFO ] Computed 102 place invariants in 88 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 707 resets, run finished after 131 ms. (steps per millisecond=76 ) 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 138 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 10000 steps, including 248 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 10001 steps, including 184 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 10001 steps, including 249 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10000 steps, including 133 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10001 steps, including 149 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 10000 steps, including 168 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10001 steps, including 303 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 149 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :11
[2023-03-24 03:12:02] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2023-03-24 03:12:02] [INFO ] Computed 102 place invariants in 32 ms
[2023-03-24 03:12:02] [INFO ] [Real]Absence check using 76 positive place invariants in 42 ms returned sat
[2023-03-24 03:12:02] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 25 ms returned unsat
[2023-03-24 03:12:02] [INFO ] [Real]Absence check using 76 positive place invariants in 25 ms returned sat
[2023-03-24 03:12:02] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 20 ms returned unsat
[2023-03-24 03:12:02] [INFO ] [Real]Absence check using 76 positive place invariants in 17 ms returned sat
[2023-03-24 03:12:02] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 21 ms returned sat
[2023-03-24 03:12:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 03:12:03] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2023-03-24 03:12:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 03:12:03] [INFO ] [Nat]Absence check using 76 positive place invariants in 17 ms returned sat
[2023-03-24 03:12:03] [INFO ] [Nat]Absence check using 76 positive and 26 generalized place invariants in 20 ms returned unsat
[2023-03-24 03:12:03] [INFO ] [Real]Absence check using 76 positive place invariants in 17 ms returned sat
[2023-03-24 03:12:03] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 22 ms returned sat
[2023-03-24 03:12:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 03:12:04] [INFO ] [Real]Absence check using state equation in 598 ms returned sat
[2023-03-24 03:12:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 03:12:04] [INFO ] [Nat]Absence check using 76 positive place invariants in 21 ms returned sat
[2023-03-24 03:12:04] [INFO ] [Nat]Absence check using 76 positive and 26 generalized place invariants in 23 ms returned sat
[2023-03-24 03:12:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 03:12:06] [INFO ] [Nat]Absence check using state equation in 1769 ms returned sat
[2023-03-24 03:12:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:12:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-24 03:12:06] [INFO ] Computed and/alt/rep : 549/1329/549 causal constraints (skipped 376 transitions) in 93 ms.
[2023-03-24 03:12:07] [INFO ] Deduced a trap composed of 343 places in 297 ms of which 5 ms to minimize.
[2023-03-24 03:12:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 489 ms
[2023-03-24 03:12:07] [INFO ] Added : 13 causal constraints over 3 iterations in 1580 ms. Result :sat
Minimization took 209 ms.
[2023-03-24 03:12:08] [INFO ] [Real]Absence check using 76 positive place invariants in 20 ms returned sat
[2023-03-24 03:12:08] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 29 ms returned unsat
[2023-03-24 03:12:08] [INFO ] [Real]Absence check using 76 positive place invariants in 18 ms returned sat
[2023-03-24 03:12:08] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 19 ms returned unsat
[2023-03-24 03:12:08] [INFO ] [Real]Absence check using 76 positive place invariants in 18 ms returned sat
[2023-03-24 03:12:08] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 24 ms returned unsat
[2023-03-24 03:12:08] [INFO ] [Real]Absence check using 76 positive place invariants in 18 ms returned sat
[2023-03-24 03:12:08] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 45 ms returned sat
[2023-03-24 03:12:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 03:12:09] [INFO ] [Real]Absence check using state equation in 562 ms returned sat
[2023-03-24 03:12:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 03:12:09] [INFO ] [Nat]Absence check using 76 positive place invariants in 19 ms returned sat
[2023-03-24 03:12:09] [INFO ] [Nat]Absence check using 76 positive and 26 generalized place invariants in 22 ms returned sat
[2023-03-24 03:12:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 03:12:10] [INFO ] [Nat]Absence check using state equation in 1472 ms returned sat
[2023-03-24 03:12:13] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-24 03:12:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 3407 ms returned unknown
[2023-03-24 03:12:14] [INFO ] [Real]Absence check using 76 positive place invariants in 18 ms returned sat
[2023-03-24 03:12:14] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 22 ms returned unsat
[2023-03-24 03:12:14] [INFO ] [Real]Absence check using 76 positive place invariants in 19 ms returned sat
[2023-03-24 03:12:14] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 20 ms returned unsat
[2023-03-24 03:12:14] [INFO ] [Real]Absence check using 76 positive place invariants in 18 ms returned sat
[2023-03-24 03:12:14] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 20 ms returned sat
[2023-03-24 03:12:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 03:12:15] [INFO ] [Real]Absence check using state equation in 597 ms returned sat
[2023-03-24 03:12:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 03:12:15] [INFO ] [Nat]Absence check using 76 positive place invariants in 18 ms returned sat
[2023-03-24 03:12:15] [INFO ] [Nat]Absence check using 76 positive and 26 generalized place invariants in 22 ms returned sat
[2023-03-24 03:12:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 03:12:17] [INFO ] [Nat]Absence check using state equation in 1798 ms returned sat
[2023-03-24 03:12:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 03:12:17] [INFO ] Computed and/alt/rep : 549/1329/549 causal constraints (skipped 376 transitions) in 69 ms.
[2023-03-24 03:12:18] [INFO ] Deduced a trap composed of 343 places in 274 ms of which 1 ms to minimize.
[2023-03-24 03:12:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 451 ms
[2023-03-24 03:12:18] [INFO ] Added : 13 causal constraints over 3 iterations in 1475 ms. Result :sat
Minimization took 211 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 2 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 5 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 282 ms. Remains 530 /629 variables (removed 99) and now considering 841/935 (removed 94) transitions.
[2023-03-24 03:12:19] [INFO ] Flow matrix only has 837 transitions (discarded 4 similar events)
// Phase 1: matrix 837 rows 530 cols
[2023-03-24 03:12:19] [INFO ] Computed 97 place invariants in 12 ms
[2023-03-24 03:12:20] [INFO ] Dead Transitions using invariants and state equation in 736 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 45 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 1073 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-24 03:12:20] [INFO ] Computed 97 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 52066 resets, run finished after 6323 ms. (steps per millisecond=158 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 4603 resets, run finished after 1488 ms. (steps per millisecond=672 ) properties (out of 1) seen :3
[2023-03-24 03:12:27] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-24 03:12:27] [INFO ] Computed 97 place invariants in 27 ms
[2023-03-24 03:12:28] [INFO ] [Real]Absence check using 76 positive place invariants in 16 ms returned sat
[2023-03-24 03:12:28] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 16 ms returned sat
[2023-03-24 03:12:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 03:12:28] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2023-03-24 03:12:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 03:12:28] [INFO ] [Nat]Absence check using 76 positive place invariants in 16 ms returned sat
[2023-03-24 03:12:28] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 22 ms returned sat
[2023-03-24 03:12:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 03:12:28] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2023-03-24 03:12:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:12:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 896 ms returned sat
[2023-03-24 03:12:29] [INFO ] Deduced a trap composed of 187 places in 222 ms of which 1 ms to minimize.
[2023-03-24 03:12:30] [INFO ] Deduced a trap composed of 175 places in 202 ms of which 1 ms to minimize.
[2023-03-24 03:12:30] [INFO ] Deduced a trap composed of 181 places in 202 ms of which 1 ms to minimize.
[2023-03-24 03:12:30] [INFO ] Deduced a trap composed of 201 places in 233 ms of which 0 ms to minimize.
[2023-03-24 03:12:30] [INFO ] Deduced a trap composed of 174 places in 214 ms of which 1 ms to minimize.
[2023-03-24 03:12:31] [INFO ] Deduced a trap composed of 174 places in 185 ms of which 0 ms to minimize.
[2023-03-24 03:12:31] [INFO ] Deduced a trap composed of 182 places in 208 ms of which 1 ms to minimize.
[2023-03-24 03:12:31] [INFO ] Deduced a trap composed of 169 places in 194 ms of which 1 ms to minimize.
[2023-03-24 03:12:31] [INFO ] Deduced a trap composed of 178 places in 208 ms of which 1 ms to minimize.
[2023-03-24 03:12:32] [INFO ] Deduced a trap composed of 188 places in 178 ms of which 1 ms to minimize.
[2023-03-24 03:12:32] [INFO ] Deduced a trap composed of 164 places in 180 ms of which 1 ms to minimize.
[2023-03-24 03:12:32] [INFO ] Deduced a trap composed of 162 places in 176 ms of which 0 ms to minimize.
[2023-03-24 03:12:33] [INFO ] Deduced a trap composed of 170 places in 191 ms of which 1 ms to minimize.
[2023-03-24 03:12:33] [INFO ] Deduced a trap composed of 176 places in 189 ms of which 1 ms to minimize.
[2023-03-24 03:12:33] [INFO ] Deduced a trap composed of 170 places in 194 ms of which 1 ms to minimize.
[2023-03-24 03:12:33] [INFO ] Deduced a trap composed of 179 places in 184 ms of which 1 ms to minimize.
[2023-03-24 03:12:34] [INFO ] Deduced a trap composed of 183 places in 183 ms of which 1 ms to minimize.
[2023-03-24 03:12:34] [INFO ] Deduced a trap composed of 171 places in 186 ms of which 1 ms to minimize.
[2023-03-24 03:12:34] [INFO ] Deduced a trap composed of 173 places in 181 ms of which 1 ms to minimize.
[2023-03-24 03:12:35] [INFO ] Deduced a trap composed of 175 places in 183 ms of which 1 ms to minimize.
[2023-03-24 03:12:35] [INFO ] Deduced a trap composed of 176 places in 198 ms of which 0 ms to minimize.
[2023-03-24 03:12:35] [INFO ] Deduced a trap composed of 175 places in 192 ms of which 0 ms to minimize.
[2023-03-24 03:12:38] [INFO ] Trap strengthening (SAT) tested/added 22/22 trap constraints in 9027 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 27 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 26 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2023-03-24 03:12:38] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-24 03:12:38] [INFO ] Invariant cache hit.
[2023-03-24 03:12:39] [INFO ] Implicit Places using invariants in 711 ms returned []
[2023-03-24 03:12:39] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-24 03:12:39] [INFO ] Invariant cache hit.
[2023-03-24 03:12:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:12:45] [INFO ] Implicit Places using invariants and state equation in 6029 ms returned []
Implicit Place search using SMT with State Equation took 6749 ms to find 0 implicit places.
[2023-03-24 03:12:45] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-24 03:12:45] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-24 03:12:45] [INFO ] Invariant cache hit.
[2023-03-24 03:12:46] [INFO ] Dead Transitions using invariants and state equation in 665 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7491 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-24 03:12:46] [INFO ] Computed 97 place invariants in 12 ms
Incomplete random walk after 10000 steps, including 528 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :3
[2023-03-24 03:12:46] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-24 03:12:46] [INFO ] Computed 97 place invariants in 16 ms
[2023-03-24 03:12:46] [INFO ] [Real]Absence check using 76 positive place invariants in 19 ms returned sat
[2023-03-24 03:12:46] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 15 ms returned sat
[2023-03-24 03:12:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 03:12:46] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2023-03-24 03:12:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 03:12:46] [INFO ] [Nat]Absence check using 76 positive place invariants in 18 ms returned sat
[2023-03-24 03:12:46] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 22 ms returned sat
[2023-03-24 03:12:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 03:12:47] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2023-03-24 03:12:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:12:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 888 ms returned sat
[2023-03-24 03:12:48] [INFO ] Deduced a trap composed of 187 places in 208 ms of which 1 ms to minimize.
[2023-03-24 03:12:48] [INFO ] Deduced a trap composed of 175 places in 190 ms of which 0 ms to minimize.
[2023-03-24 03:12:48] [INFO ] Deduced a trap composed of 181 places in 200 ms of which 1 ms to minimize.
[2023-03-24 03:12:48] [INFO ] Deduced a trap composed of 201 places in 196 ms of which 1 ms to minimize.
[2023-03-24 03:12:49] [INFO ] Deduced a trap composed of 174 places in 193 ms of which 0 ms to minimize.
[2023-03-24 03:12:49] [INFO ] Deduced a trap composed of 174 places in 188 ms of which 1 ms to minimize.
[2023-03-24 03:12:49] [INFO ] Deduced a trap composed of 182 places in 200 ms of which 1 ms to minimize.
[2023-03-24 03:12:49] [INFO ] Deduced a trap composed of 169 places in 199 ms of which 1 ms to minimize.
[2023-03-24 03:12:50] [INFO ] Deduced a trap composed of 178 places in 201 ms of which 0 ms to minimize.
[2023-03-24 03:12:50] [INFO ] Deduced a trap composed of 188 places in 183 ms of which 1 ms to minimize.
[2023-03-24 03:12:50] [INFO ] Deduced a trap composed of 164 places in 182 ms of which 3 ms to minimize.
[2023-03-24 03:12:51] [INFO ] Deduced a trap composed of 162 places in 187 ms of which 0 ms to minimize.
[2023-03-24 03:12:51] [INFO ] Deduced a trap composed of 170 places in 186 ms of which 0 ms to minimize.
[2023-03-24 03:12:51] [INFO ] Deduced a trap composed of 176 places in 184 ms of which 1 ms to minimize.
[2023-03-24 03:12:51] [INFO ] Deduced a trap composed of 170 places in 183 ms of which 0 ms to minimize.
[2023-03-24 03:12:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
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 21 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2023-03-24 03:12:51] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-24 03:12:51] [INFO ] Invariant cache hit.
[2023-03-24 03:12:52] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 662 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-24 03:12:52] [INFO ] Computed 97 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 51736 resets, run finished after 6100 ms. (steps per millisecond=163 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 4630 resets, run finished after 1345 ms. (steps per millisecond=743 ) properties (out of 1) seen :3
[2023-03-24 03:12:59] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-24 03:13:00] [INFO ] Computed 97 place invariants in 17 ms
[2023-03-24 03:13:00] [INFO ] [Real]Absence check using 76 positive place invariants in 16 ms returned sat
[2023-03-24 03:13:00] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 16 ms returned sat
[2023-03-24 03:13:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 03:13:00] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2023-03-24 03:13:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 03:13:00] [INFO ] [Nat]Absence check using 76 positive place invariants in 18 ms returned sat
[2023-03-24 03:13:00] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 17 ms returned sat
[2023-03-24 03:13:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 03:13:00] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2023-03-24 03:13:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:13:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 891 ms returned sat
[2023-03-24 03:13:01] [INFO ] Deduced a trap composed of 187 places in 203 ms of which 0 ms to minimize.
[2023-03-24 03:13:02] [INFO ] Deduced a trap composed of 175 places in 198 ms of which 0 ms to minimize.
[2023-03-24 03:13:02] [INFO ] Deduced a trap composed of 181 places in 209 ms of which 1 ms to minimize.
[2023-03-24 03:13:02] [INFO ] Deduced a trap composed of 201 places in 197 ms of which 0 ms to minimize.
[2023-03-24 03:13:02] [INFO ] Deduced a trap composed of 174 places in 200 ms of which 1 ms to minimize.
[2023-03-24 03:13:03] [INFO ] Deduced a trap composed of 174 places in 190 ms of which 0 ms to minimize.
[2023-03-24 03:13:03] [INFO ] Deduced a trap composed of 182 places in 224 ms of which 1 ms to minimize.
[2023-03-24 03:13:03] [INFO ] Deduced a trap composed of 169 places in 205 ms of which 0 ms to minimize.
[2023-03-24 03:13:03] [INFO ] Deduced a trap composed of 178 places in 193 ms of which 1 ms to minimize.
[2023-03-24 03:13:04] [INFO ] Deduced a trap composed of 188 places in 188 ms of which 0 ms to minimize.
[2023-03-24 03:13:04] [INFO ] Deduced a trap composed of 164 places in 176 ms of which 1 ms to minimize.
[2023-03-24 03:13:04] [INFO ] Deduced a trap composed of 162 places in 193 ms of which 2 ms to minimize.
[2023-03-24 03:13:05] [INFO ] Deduced a trap composed of 170 places in 185 ms of which 0 ms to minimize.
[2023-03-24 03:13:05] [INFO ] Deduced a trap composed of 176 places in 188 ms of which 1 ms to minimize.
[2023-03-24 03:13:05] [INFO ] Deduced a trap composed of 170 places in 183 ms of which 1 ms to minimize.
[2023-03-24 03:13:05] [INFO ] Deduced a trap composed of 179 places in 175 ms of which 1 ms to minimize.
[2023-03-24 03:13:06] [INFO ] Deduced a trap composed of 183 places in 196 ms of which 1 ms to minimize.
[2023-03-24 03:13:06] [INFO ] Deduced a trap composed of 171 places in 181 ms of which 3 ms to minimize.
[2023-03-24 03:13:06] [INFO ] Deduced a trap composed of 173 places in 178 ms of which 0 ms to minimize.
[2023-03-24 03:13:07] [INFO ] Deduced a trap composed of 175 places in 183 ms of which 1 ms to minimize.
[2023-03-24 03:13:07] [INFO ] Deduced a trap composed of 176 places in 176 ms of which 0 ms to minimize.
[2023-03-24 03:13:07] [INFO ] Deduced a trap composed of 175 places in 185 ms of which 1 ms to minimize.
[2023-03-24 03:13:10] [INFO ] Trap strengthening (SAT) tested/added 22/22 trap constraints in 8990 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 20 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 21 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 20 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2023-03-24 03:13:10] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-24 03:13:10] [INFO ] Invariant cache hit.
[2023-03-24 03:13:11] [INFO ] Implicit Places using invariants in 759 ms returned []
[2023-03-24 03:13:11] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-24 03:13:11] [INFO ] Invariant cache hit.
[2023-03-24 03:13:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:13:18] [INFO ] Implicit Places using invariants and state equation in 6745 ms returned []
Implicit Place search using SMT with State Equation took 7517 ms to find 0 implicit places.
[2023-03-24 03:13:18] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-24 03:13:18] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-24 03:13:18] [INFO ] Invariant cache hit.
[2023-03-24 03:13:18] [INFO ] Dead Transitions using invariants and state equation in 676 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8234 ms. Remains : 530/530 places, 746/746 transitions.
Ending property specific reduction for PolyORBNT-PT-S05J40-UpperBounds-09 in 32693 ms.
[2023-03-24 03:13:19] [INFO ] Flatten gal took : 111 ms
[2023-03-24 03:13:19] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-24 03:13:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 530 places, 746 transitions and 3809 arcs took 7 ms.
Total runtime 77926 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/748/ub_0_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 15000916 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16094032 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
mcc2023

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="ltsminxred"
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 ltsminxred"
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 r297-tall-167873950900733"
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 '' 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 ;