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.r298-tall-167873952200773.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 marciexred
Input is PolyORBNT-PT-S10J40, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873952200773
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 32K Feb 26 00:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 183K Feb 26 00:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 248K Feb 25 23:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 935K Feb 25 23:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 23K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 48K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 143K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 78K Feb 26 01:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 358K Feb 26 01:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 999K Feb 26 01:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.3M Feb 26 01:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.2K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 14M Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-PT-S10J40-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S10J40-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S10J40-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S10J40-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S10J40-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S10J40-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S10J40-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S10J40-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S10J40-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S10J40-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S10J40-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S10J40-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S10J40-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S10J40-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S10J40-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S10J40-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679668238180

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J40
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 14:30:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-24 14:30:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 14:30:40] [INFO ] Load time of PNML (sax parser for PT used): 608 ms
[2023-03-24 14:30:40] [INFO ] Transformed 854 places.
[2023-03-24 14:30:40] [INFO ] Transformed 12340 transitions.
[2023-03-24 14:30:40] [INFO ] Parsed PT model containing 854 places and 12340 transitions and 113999 arcs in 791 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Normalized transition count is 2221 out of 2230 initially.
// Phase 1: matrix 2221 rows 854 cols
[2023-03-24 14:30:40] [INFO ] Computed 112 place invariants in 170 ms
FORMULA PolyORBNT-PT-S10J40-UpperBounds-08 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J40-UpperBounds-02 41 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J40-UpperBounds-01 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 560 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 13) seen :14
FORMULA PolyORBNT-PT-S10J40-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :20
FORMULA PolyORBNT-PT-S10J40-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :13
[2023-03-24 14:30:41] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
// Phase 1: matrix 2221 rows 854 cols
[2023-03-24 14:30:41] [INFO ] Computed 112 place invariants in 100 ms
[2023-03-24 14:30:42] [INFO ] [Real]Absence check using 81 positive place invariants in 55 ms returned sat
[2023-03-24 14:30:42] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 44 ms returned unsat
[2023-03-24 14:30:42] [INFO ] [Real]Absence check using 81 positive place invariants in 23 ms returned sat
[2023-03-24 14:30:42] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 49 ms returned unsat
[2023-03-24 14:30:42] [INFO ] [Real]Absence check using 81 positive place invariants in 49 ms returned sat
[2023-03-24 14:30:42] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 27 ms returned unsat
[2023-03-24 14:30:42] [INFO ] [Real]Absence check using 81 positive place invariants in 70 ms returned sat
[2023-03-24 14:30:42] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 54 ms returned sat
[2023-03-24 14:30:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 14:30:43] [INFO ] [Real]Absence check using state equation in 594 ms returned sat
[2023-03-24 14:30:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 14:30:43] [INFO ] [Nat]Absence check using 81 positive place invariants in 19 ms returned sat
[2023-03-24 14:30:43] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 23 ms returned sat
[2023-03-24 14:30:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 14:30:48] [INFO ] [Nat]Absence check using state equation in 4881 ms returned unknown
[2023-03-24 14:30:48] [INFO ] [Real]Absence check using 81 positive place invariants in 18 ms returned sat
[2023-03-24 14:30:48] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 27 ms returned unsat
[2023-03-24 14:30:48] [INFO ] [Real]Absence check using 81 positive place invariants in 19 ms returned sat
[2023-03-24 14:30:48] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 22 ms returned unsat
[2023-03-24 14:30:48] [INFO ] [Real]Absence check using 81 positive place invariants in 23 ms returned sat
[2023-03-24 14:30:48] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 27 ms returned unsat
[2023-03-24 14:30:49] [INFO ] [Real]Absence check using 81 positive place invariants in 19 ms returned sat
[2023-03-24 14:30:49] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 25 ms returned sat
[2023-03-24 14:30:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 14:30:50] [INFO ] [Real]Absence check using state equation in 1152 ms returned sat
[2023-03-24 14:30:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 14:30:50] [INFO ] [Nat]Absence check using 81 positive place invariants in 18 ms returned sat
[2023-03-24 14:30:50] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 23 ms returned sat
[2023-03-24 14:30:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 14:30:55] [INFO ] [Nat]Absence check using state equation in 4897 ms returned unknown
[2023-03-24 14:30:55] [INFO ] [Real]Absence check using 81 positive place invariants in 18 ms returned sat
[2023-03-24 14:30:55] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 7 ms returned unsat
[2023-03-24 14:30:55] [INFO ] [Real]Absence check using 81 positive place invariants in 19 ms returned sat
[2023-03-24 14:30:55] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 26 ms returned unsat
Current structural bounds on expressions (after SMT) : [10, 1, 1, 4, 1, 1, 1, 445, 1, 1] Max seen :[10, 1, 1, 0, 1, 1, 1, 1, 1, 1]
FORMULA PolyORBNT-PT-S10J40-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 854 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 854/854 places, 2230/2230 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 844 transition count 2185
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 101 place count 799 transition count 2184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 102 place count 798 transition count 2184
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 102 place count 798 transition count 2140
Deduced a syphon composed of 44 places in 5 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 190 place count 754 transition count 2140
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 191 place count 753 transition count 2139
Iterating global reduction 3 with 1 rules applied. Total rules applied 192 place count 753 transition count 2139
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 3 with 4 rules applied. Total rules applied 196 place count 751 transition count 2137
Applied a total of 196 rules in 413 ms. Remains 751 /854 variables (removed 103) and now considering 2137/2230 (removed 93) transitions.
[2023-03-24 14:30:56] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
// Phase 1: matrix 2128 rows 751 cols
[2023-03-24 14:30:56] [INFO ] Computed 102 place invariants in 68 ms
[2023-03-24 14:30:57] [INFO ] Dead Transitions using invariants and state equation in 1497 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 751/854 places, 1522/2230 transitions.
Applied a total of 0 rules in 44 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1958 ms. Remains : 751/854 places, 1522/2230 transitions.
Normalized transition count is 1513 out of 1522 initially.
// Phase 1: matrix 1513 rows 751 cols
[2023-03-24 14:30:57] [INFO ] Computed 102 place invariants in 34 ms
Incomplete random walk after 1000000 steps, including 70241 resets, run finished after 8965 ms. (steps per millisecond=111 ) properties (out of 2) seen :7
FORMULA PolyORBNT-PT-S10J40-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 8211 resets, run finished after 1747 ms. (steps per millisecond=572 ) properties (out of 1) seen :3
[2023-03-24 14:31:08] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-24 14:31:08] [INFO ] Computed 102 place invariants in 30 ms
[2023-03-24 14:31:08] [INFO ] [Real]Absence check using 81 positive place invariants in 19 ms returned sat
[2023-03-24 14:31:08] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 20 ms returned sat
[2023-03-24 14:31:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 14:31:09] [INFO ] [Real]Absence check using state equation in 698 ms returned sat
[2023-03-24 14:31:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 14:31:09] [INFO ] [Nat]Absence check using 81 positive place invariants in 19 ms returned sat
[2023-03-24 14:31:09] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 21 ms returned sat
[2023-03-24 14:31:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 14:31:09] [INFO ] [Nat]Absence check using state equation in 542 ms returned sat
[2023-03-24 14:31:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 14:31:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 1210 ms returned sat
[2023-03-24 14:31:11] [INFO ] Deduced a trap composed of 302 places in 433 ms of which 5 ms to minimize.
[2023-03-24 14:31:12] [INFO ] Deduced a trap composed of 303 places in 383 ms of which 1 ms to minimize.
[2023-03-24 14:31:12] [INFO ] Deduced a trap composed of 292 places in 361 ms of which 1 ms to minimize.
[2023-03-24 14:31:12] [INFO ] Deduced a trap composed of 305 places in 360 ms of which 2 ms to minimize.
[2023-03-24 14:31:13] [INFO ] Deduced a trap composed of 311 places in 369 ms of which 1 ms to minimize.
[2023-03-24 14:31:13] [INFO ] Deduced a trap composed of 298 places in 353 ms of which 1 ms to minimize.
[2023-03-24 14:31:14] [INFO ] Deduced a trap composed of 308 places in 361 ms of which 0 ms to minimize.
[2023-03-24 14:31:14] [INFO ] Deduced a trap composed of 306 places in 358 ms of which 1 ms to minimize.
[2023-03-24 14:31:15] [INFO ] Deduced a trap composed of 314 places in 348 ms of which 1 ms to minimize.
[2023-03-24 14:31:15] [INFO ] Deduced a trap composed of 300 places in 331 ms of which 0 ms to minimize.
[2023-03-24 14:31:15] [INFO ] Deduced a trap composed of 304 places in 360 ms of which 0 ms to minimize.
[2023-03-24 14:31:16] [INFO ] Deduced a trap composed of 317 places in 337 ms of which 1 ms to minimize.
[2023-03-24 14:31:17] [INFO ] Deduced a trap composed of 309 places in 344 ms of which 1 ms to minimize.
[2023-03-24 14:31:17] [INFO ] Deduced a trap composed of 292 places in 356 ms of which 0 ms to minimize.
[2023-03-24 14:31:18] [INFO ] Deduced a trap composed of 304 places in 349 ms of which 1 ms to minimize.
[2023-03-24 14:31:18] [INFO ] Deduced a trap composed of 294 places in 329 ms of which 0 ms to minimize.
[2023-03-24 14:31:18] [INFO ] Deduced a trap composed of 296 places in 333 ms of which 1 ms to minimize.
[2023-03-24 14:31:19] [INFO ] Deduced a trap composed of 294 places in 359 ms of which 1 ms to minimize.
[2023-03-24 14:31:19] [INFO ] Deduced a trap composed of 294 places in 349 ms of which 0 ms to minimize.
[2023-03-24 14:31:20] [INFO ] Deduced a trap composed of 304 places in 336 ms of which 0 ms to minimize.
[2023-03-24 14:31:20] [INFO ] Deduced a trap composed of 302 places in 360 ms of which 1 ms to minimize.
[2023-03-24 14:31:21] [INFO ] Deduced a trap composed of 300 places in 333 ms of which 1 ms to minimize.
[2023-03-24 14:31:21] [INFO ] Deduced a trap composed of 306 places in 333 ms of which 0 ms to minimize.
[2023-03-24 14:31:21] [INFO ] Deduced a trap composed of 309 places in 332 ms of which 0 ms to minimize.
[2023-03-24 14:31:22] [INFO ] Deduced a trap composed of 309 places in 335 ms of which 1 ms to minimize.
[2023-03-24 14:31:22] [INFO ] Deduced a trap composed of 302 places in 338 ms of which 1 ms to minimize.
[2023-03-24 14:31:23] [INFO ] Deduced a trap composed of 306 places in 348 ms of which 1 ms to minimize.
[2023-03-24 14:31:23] [INFO ] Deduced a trap composed of 309 places in 335 ms of which 1 ms to minimize.
[2023-03-24 14:31:24] [INFO ] Deduced a trap composed of 302 places in 370 ms of which 1 ms to minimize.
[2023-03-24 14:31:24] [INFO ] Deduced a trap composed of 306 places in 359 ms of which 1 ms to minimize.
[2023-03-24 14:31:25] [INFO ] Deduced a trap composed of 308 places in 341 ms of which 0 ms to minimize.
[2023-03-24 14:31:25] [INFO ] Deduced a trap composed of 298 places in 332 ms of which 0 ms to minimize.
[2023-03-24 14:31:25] [INFO ] Deduced a trap composed of 315 places in 347 ms of which 1 ms to minimize.
[2023-03-24 14:31:26] [INFO ] Deduced a trap composed of 296 places in 356 ms of which 1 ms to minimize.
[2023-03-24 14:31:27] [INFO ] Deduced a trap composed of 314 places in 365 ms of which 4 ms to minimize.
[2023-03-24 14:31:28] [INFO ] Deduced a trap composed of 300 places in 353 ms of which 0 ms to minimize.
[2023-03-24 14:31:28] [INFO ] Deduced a trap composed of 296 places in 355 ms of which 1 ms to minimize.
[2023-03-24 14:31:29] [INFO ] Deduced a trap composed of 303 places in 351 ms of which 1 ms to minimize.
[2023-03-24 14:31:29] [INFO ] Deduced a trap composed of 302 places in 357 ms of which 2 ms to minimize.
[2023-03-24 14:31:30] [INFO ] Deduced a trap composed of 292 places in 356 ms of which 1 ms to minimize.
[2023-03-24 14:31:32] [INFO ] Deduced a trap composed of 290 places in 351 ms of which 1 ms to minimize.
[2023-03-24 14:31:32] [INFO ] Deduced a trap composed of 302 places in 392 ms of which 1 ms to minimize.
[2023-03-24 14:31:33] [INFO ] Deduced a trap composed of 286 places in 353 ms of which 0 ms to minimize.
[2023-03-24 14:31:36] [INFO ] Trap strengthening (SAT) tested/added 43/43 trap constraints in 24913 ms
Current structural bounds on expressions (after SMT) : [181] Max seen :[3]
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 1522/1522 transitions.
Applied a total of 0 rules in 44 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 751/751 places, 1522/1522 transitions.
Normalized transition count is 1513 out of 1522 initially.
// Phase 1: matrix 1513 rows 751 cols
[2023-03-24 14:31:36] [INFO ] Computed 102 place invariants in 26 ms
Incomplete random walk after 1000000 steps, including 70200 resets, run finished after 8726 ms. (steps per millisecond=114 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 8082 resets, run finished after 1703 ms. (steps per millisecond=587 ) properties (out of 1) seen :3
[2023-03-24 14:31:46] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-24 14:31:46] [INFO ] Computed 102 place invariants in 26 ms
[2023-03-24 14:31:46] [INFO ] [Real]Absence check using 81 positive place invariants in 19 ms returned sat
[2023-03-24 14:31:46] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 21 ms returned sat
[2023-03-24 14:31:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 14:31:47] [INFO ] [Real]Absence check using state equation in 696 ms returned sat
[2023-03-24 14:31:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 14:31:47] [INFO ] [Nat]Absence check using 81 positive place invariants in 19 ms returned sat
[2023-03-24 14:31:47] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 21 ms returned sat
[2023-03-24 14:31:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 14:31:48] [INFO ] [Nat]Absence check using state equation in 533 ms returned sat
[2023-03-24 14:31:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 14:31:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 1185 ms returned sat
[2023-03-24 14:31:49] [INFO ] Deduced a trap composed of 302 places in 356 ms of which 1 ms to minimize.
[2023-03-24 14:31:50] [INFO ] Deduced a trap composed of 303 places in 354 ms of which 0 ms to minimize.
[2023-03-24 14:31:50] [INFO ] Deduced a trap composed of 292 places in 354 ms of which 1 ms to minimize.
[2023-03-24 14:31:51] [INFO ] Deduced a trap composed of 305 places in 355 ms of which 0 ms to minimize.
[2023-03-24 14:31:51] [INFO ] Deduced a trap composed of 311 places in 333 ms of which 1 ms to minimize.
[2023-03-24 14:31:51] [INFO ] Deduced a trap composed of 298 places in 358 ms of which 1 ms to minimize.
[2023-03-24 14:31:52] [INFO ] Deduced a trap composed of 308 places in 362 ms of which 0 ms to minimize.
[2023-03-24 14:31:52] [INFO ] Deduced a trap composed of 306 places in 359 ms of which 2 ms to minimize.
[2023-03-24 14:31:53] [INFO ] Deduced a trap composed of 314 places in 357 ms of which 1 ms to minimize.
[2023-03-24 14:31:53] [INFO ] Deduced a trap composed of 300 places in 350 ms of which 1 ms to minimize.
[2023-03-24 14:31:54] [INFO ] Deduced a trap composed of 304 places in 355 ms of which 1 ms to minimize.
[2023-03-24 14:31:54] [INFO ] Deduced a trap composed of 317 places in 360 ms of which 1 ms to minimize.
[2023-03-24 14:31:55] [INFO ] Deduced a trap composed of 309 places in 356 ms of which 1 ms to minimize.
[2023-03-24 14:31:55] [INFO ] Deduced a trap composed of 292 places in 325 ms of which 2 ms to minimize.
[2023-03-24 14:31:56] [INFO ] Deduced a trap composed of 304 places in 348 ms of which 1 ms to minimize.
[2023-03-24 14:31:56] [INFO ] Deduced a trap composed of 294 places in 343 ms of which 1 ms to minimize.
[2023-03-24 14:31:57] [INFO ] Deduced a trap composed of 296 places in 350 ms of which 0 ms to minimize.
[2023-03-24 14:31:57] [INFO ] Deduced a trap composed of 294 places in 348 ms of which 1 ms to minimize.
[2023-03-24 14:31:57] [INFO ] Deduced a trap composed of 294 places in 386 ms of which 1 ms to minimize.
[2023-03-24 14:31:58] [INFO ] Deduced a trap composed of 304 places in 355 ms of which 1 ms to minimize.
[2023-03-24 14:31:58] [INFO ] Deduced a trap composed of 302 places in 381 ms of which 4 ms to minimize.
[2023-03-24 14:31:59] [INFO ] Deduced a trap composed of 300 places in 328 ms of which 2 ms to minimize.
[2023-03-24 14:31:59] [INFO ] Deduced a trap composed of 306 places in 336 ms of which 1 ms to minimize.
[2023-03-24 14:32:00] [INFO ] Deduced a trap composed of 309 places in 338 ms of which 2 ms to minimize.
[2023-03-24 14:32:00] [INFO ] Deduced a trap composed of 309 places in 339 ms of which 4 ms to minimize.
[2023-03-24 14:32:01] [INFO ] Deduced a trap composed of 302 places in 339 ms of which 2 ms to minimize.
[2023-03-24 14:32:01] [INFO ] Deduced a trap composed of 306 places in 350 ms of which 1 ms to minimize.
[2023-03-24 14:32:01] [INFO ] Deduced a trap composed of 309 places in 336 ms of which 0 ms to minimize.
[2023-03-24 14:32:02] [INFO ] Deduced a trap composed of 302 places in 357 ms of which 1 ms to minimize.
[2023-03-24 14:32:02] [INFO ] Deduced a trap composed of 306 places in 339 ms of which 1 ms to minimize.
[2023-03-24 14:32:03] [INFO ] Deduced a trap composed of 308 places in 355 ms of which 1 ms to minimize.
[2023-03-24 14:32:03] [INFO ] Deduced a trap composed of 298 places in 332 ms of which 1 ms to minimize.
[2023-03-24 14:32:04] [INFO ] Deduced a trap composed of 315 places in 358 ms of which 1 ms to minimize.
[2023-03-24 14:32:04] [INFO ] Deduced a trap composed of 296 places in 328 ms of which 0 ms to minimize.
[2023-03-24 14:32:05] [INFO ] Deduced a trap composed of 314 places in 350 ms of which 1 ms to minimize.
[2023-03-24 14:32:06] [INFO ] Deduced a trap composed of 300 places in 330 ms of which 0 ms to minimize.
[2023-03-24 14:32:06] [INFO ] Deduced a trap composed of 296 places in 327 ms of which 1 ms to minimize.
[2023-03-24 14:32:07] [INFO ] Deduced a trap composed of 303 places in 320 ms of which 1 ms to minimize.
[2023-03-24 14:32:07] [INFO ] Deduced a trap composed of 302 places in 332 ms of which 1 ms to minimize.
[2023-03-24 14:32:08] [INFO ] Deduced a trap composed of 292 places in 350 ms of which 0 ms to minimize.
[2023-03-24 14:32:10] [INFO ] Deduced a trap composed of 290 places in 332 ms of which 1 ms to minimize.
[2023-03-24 14:32:10] [INFO ] Deduced a trap composed of 302 places in 329 ms of which 1 ms to minimize.
[2023-03-24 14:32:10] [INFO ] Deduced a trap composed of 286 places in 316 ms of which 0 ms to minimize.
[2023-03-24 14:32:13] [INFO ] Trap strengthening (SAT) tested/added 43/43 trap constraints in 24574 ms
Current structural bounds on expressions (after SMT) : [181] Max seen :[3]
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 1522/1522 transitions.
Applied a total of 0 rules in 39 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 751/751 places, 1522/1522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 1522/1522 transitions.
Applied a total of 0 rules in 39 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2023-03-24 14:32:14] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-24 14:32:14] [INFO ] Invariant cache hit.
[2023-03-24 14:32:15] [INFO ] Implicit Places using invariants in 929 ms returned []
[2023-03-24 14:32:15] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-24 14:32:15] [INFO ] Invariant cache hit.
[2023-03-24 14:32:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 14:32:26] [INFO ] Implicit Places using invariants and state equation in 11241 ms returned []
Implicit Place search using SMT with State Equation took 12172 ms to find 0 implicit places.
[2023-03-24 14:32:26] [INFO ] Redundant transitions in 92 ms returned []
[2023-03-24 14:32:26] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-24 14:32:26] [INFO ] Invariant cache hit.
[2023-03-24 14:32:27] [INFO ] Dead Transitions using invariants and state equation in 1029 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13340 ms. Remains : 751/751 places, 1522/1522 transitions.
Starting property specific reduction for PolyORBNT-PT-S10J40-UpperBounds-13
Normalized transition count is 1513 out of 1522 initially.
// Phase 1: matrix 1513 rows 751 cols
[2023-03-24 14:32:27] [INFO ] Computed 102 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 712 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :3
[2023-03-24 14:32:27] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-24 14:32:27] [INFO ] Computed 102 place invariants in 26 ms
[2023-03-24 14:32:27] [INFO ] [Real]Absence check using 81 positive place invariants in 17 ms returned sat
[2023-03-24 14:32:27] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 20 ms returned sat
[2023-03-24 14:32:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 14:32:28] [INFO ] [Real]Absence check using state equation in 675 ms returned sat
[2023-03-24 14:32:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 14:32:28] [INFO ] [Nat]Absence check using 81 positive place invariants in 19 ms returned sat
[2023-03-24 14:32:28] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 21 ms returned sat
[2023-03-24 14:32:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 14:32:29] [INFO ] [Nat]Absence check using state equation in 527 ms returned sat
[2023-03-24 14:32:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 14:32:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 1209 ms returned sat
[2023-03-24 14:32:30] [INFO ] Deduced a trap composed of 302 places in 329 ms of which 1 ms to minimize.
[2023-03-24 14:32:31] [INFO ] Deduced a trap composed of 303 places in 354 ms of which 1 ms to minimize.
[2023-03-24 14:32:31] [INFO ] Deduced a trap composed of 292 places in 349 ms of which 1 ms to minimize.
[2023-03-24 14:32:31] [INFO ] Deduced a trap composed of 305 places in 351 ms of which 0 ms to minimize.
[2023-03-24 14:32:32] [INFO ] Deduced a trap composed of 311 places in 361 ms of which 0 ms to minimize.
[2023-03-24 14:32:32] [INFO ] Deduced a trap composed of 298 places in 346 ms of which 1 ms to minimize.
[2023-03-24 14:32:33] [INFO ] Deduced a trap composed of 308 places in 353 ms of which 0 ms to minimize.
[2023-03-24 14:32:33] [INFO ] Deduced a trap composed of 306 places in 349 ms of which 1 ms to minimize.
[2023-03-24 14:32:33] [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) : [181] Max seen :[3]
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 1522/1522 transitions.
Applied a total of 0 rules in 45 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2023-03-24 14:32:33] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-24 14:32:33] [INFO ] Invariant cache hit.
[2023-03-24 14:32:34] [INFO ] Dead Transitions using invariants and state equation in 967 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1012 ms. Remains : 751/751 places, 1522/1522 transitions.
Normalized transition count is 1513 out of 1522 initially.
// Phase 1: matrix 1513 rows 751 cols
[2023-03-24 14:32:34] [INFO ] Computed 102 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 70170 resets, run finished after 8635 ms. (steps per millisecond=115 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 8206 resets, run finished after 1685 ms. (steps per millisecond=593 ) properties (out of 1) seen :3
[2023-03-24 14:32:44] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-24 14:32:44] [INFO ] Computed 102 place invariants in 27 ms
[2023-03-24 14:32:45] [INFO ] [Real]Absence check using 81 positive place invariants in 18 ms returned sat
[2023-03-24 14:32:45] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 20 ms returned sat
[2023-03-24 14:32:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 14:32:45] [INFO ] [Real]Absence check using state equation in 688 ms returned sat
[2023-03-24 14:32:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 14:32:46] [INFO ] [Nat]Absence check using 81 positive place invariants in 21 ms returned sat
[2023-03-24 14:32:46] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 22 ms returned sat
[2023-03-24 14:32:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 14:32:46] [INFO ] [Nat]Absence check using state equation in 526 ms returned sat
[2023-03-24 14:32:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 14:32:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 1221 ms returned sat
[2023-03-24 14:32:48] [INFO ] Deduced a trap composed of 302 places in 348 ms of which 1 ms to minimize.
[2023-03-24 14:32:48] [INFO ] Deduced a trap composed of 303 places in 343 ms of which 1 ms to minimize.
[2023-03-24 14:32:48] [INFO ] Deduced a trap composed of 292 places in 345 ms of which 1 ms to minimize.
[2023-03-24 14:32:49] [INFO ] Deduced a trap composed of 305 places in 356 ms of which 1 ms to minimize.
[2023-03-24 14:32:49] [INFO ] Deduced a trap composed of 311 places in 351 ms of which 0 ms to minimize.
[2023-03-24 14:32:50] [INFO ] Deduced a trap composed of 298 places in 352 ms of which 0 ms to minimize.
[2023-03-24 14:32:50] [INFO ] Deduced a trap composed of 308 places in 353 ms of which 1 ms to minimize.
[2023-03-24 14:32:51] [INFO ] Deduced a trap composed of 306 places in 347 ms of which 1 ms to minimize.
[2023-03-24 14:32:51] [INFO ] Deduced a trap composed of 314 places in 357 ms of which 0 ms to minimize.
[2023-03-24 14:32:51] [INFO ] Deduced a trap composed of 300 places in 339 ms of which 1 ms to minimize.
[2023-03-24 14:32:52] [INFO ] Deduced a trap composed of 304 places in 336 ms of which 0 ms to minimize.
[2023-03-24 14:32:52] [INFO ] Deduced a trap composed of 317 places in 361 ms of which 1 ms to minimize.
[2023-03-24 14:32:53] [INFO ] Deduced a trap composed of 309 places in 325 ms of which 0 ms to minimize.
[2023-03-24 14:32:54] [INFO ] Deduced a trap composed of 292 places in 356 ms of which 1 ms to minimize.
[2023-03-24 14:32:54] [INFO ] Deduced a trap composed of 304 places in 355 ms of which 1 ms to minimize.
[2023-03-24 14:32:54] [INFO ] Deduced a trap composed of 294 places in 356 ms of which 1 ms to minimize.
[2023-03-24 14:32:55] [INFO ] Deduced a trap composed of 296 places in 383 ms of which 1 ms to minimize.
[2023-03-24 14:32:55] [INFO ] Deduced a trap composed of 294 places in 339 ms of which 1 ms to minimize.
[2023-03-24 14:32:56] [INFO ] Deduced a trap composed of 294 places in 360 ms of which 1 ms to minimize.
[2023-03-24 14:32:56] [INFO ] Deduced a trap composed of 304 places in 355 ms of which 0 ms to minimize.
[2023-03-24 14:32:57] [INFO ] Deduced a trap composed of 302 places in 358 ms of which 1 ms to minimize.
[2023-03-24 14:32:57] [INFO ] Deduced a trap composed of 300 places in 357 ms of which 0 ms to minimize.
[2023-03-24 14:32:57] [INFO ] Deduced a trap composed of 306 places in 358 ms of which 1 ms to minimize.
[2023-03-24 14:32:58] [INFO ] Deduced a trap composed of 309 places in 355 ms of which 1 ms to minimize.
[2023-03-24 14:32:58] [INFO ] Deduced a trap composed of 309 places in 367 ms of which 1 ms to minimize.
[2023-03-24 14:32:59] [INFO ] Deduced a trap composed of 302 places in 352 ms of which 0 ms to minimize.
[2023-03-24 14:32:59] [INFO ] Deduced a trap composed of 306 places in 334 ms of which 1 ms to minimize.
[2023-03-24 14:33:00] [INFO ] Deduced a trap composed of 309 places in 323 ms of which 1 ms to minimize.
[2023-03-24 14:33:00] [INFO ] Deduced a trap composed of 302 places in 320 ms of which 1 ms to minimize.
[2023-03-24 14:33:01] [INFO ] Deduced a trap composed of 306 places in 320 ms of which 1 ms to minimize.
[2023-03-24 14:33:01] [INFO ] Deduced a trap composed of 308 places in 350 ms of which 1 ms to minimize.
[2023-03-24 14:33:01] [INFO ] Deduced a trap composed of 298 places in 351 ms of which 0 ms to minimize.
[2023-03-24 14:33:02] [INFO ] Deduced a trap composed of 315 places in 361 ms of which 0 ms to minimize.
[2023-03-24 14:33:02] [INFO ] Deduced a trap composed of 296 places in 332 ms of which 1 ms to minimize.
[2023-03-24 14:33:03] [INFO ] Deduced a trap composed of 314 places in 351 ms of which 1 ms to minimize.
[2023-03-24 14:33:04] [INFO ] Deduced a trap composed of 300 places in 351 ms of which 1 ms to minimize.
[2023-03-24 14:33:04] [INFO ] Deduced a trap composed of 296 places in 335 ms of which 0 ms to minimize.
[2023-03-24 14:33:05] [INFO ] Deduced a trap composed of 303 places in 362 ms of which 0 ms to minimize.
[2023-03-24 14:33:06] [INFO ] Deduced a trap composed of 302 places in 349 ms of which 1 ms to minimize.
[2023-03-24 14:33:06] [INFO ] Deduced a trap composed of 292 places in 358 ms of which 1 ms to minimize.
[2023-03-24 14:33:08] [INFO ] Deduced a trap composed of 290 places in 366 ms of which 1 ms to minimize.
[2023-03-24 14:33:08] [INFO ] Deduced a trap composed of 302 places in 360 ms of which 0 ms to minimize.
[2023-03-24 14:33:09] [INFO ] Deduced a trap composed of 286 places in 351 ms of which 0 ms to minimize.
[2023-03-24 14:33:12] [INFO ] Trap strengthening (SAT) tested/added 43/43 trap constraints in 24667 ms
Current structural bounds on expressions (after SMT) : [181] Max seen :[3]
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 1522/1522 transitions.
Applied a total of 0 rules in 37 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 751/751 places, 1522/1522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 1522/1522 transitions.
Applied a total of 0 rules in 35 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2023-03-24 14:33:12] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-24 14:33:12] [INFO ] Invariant cache hit.
[2023-03-24 14:33:13] [INFO ] Implicit Places using invariants in 956 ms returned []
[2023-03-24 14:33:13] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-24 14:33:13] [INFO ] Invariant cache hit.
[2023-03-24 14:33:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 14:33:25] [INFO ] Implicit Places using invariants and state equation in 12146 ms returned []
Implicit Place search using SMT with State Equation took 13109 ms to find 0 implicit places.
[2023-03-24 14:33:25] [INFO ] Redundant transitions in 83 ms returned []
[2023-03-24 14:33:25] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-24 14:33:25] [INFO ] Invariant cache hit.
[2023-03-24 14:33:26] [INFO ] Dead Transitions using invariants and state equation in 894 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14136 ms. Remains : 751/751 places, 1522/1522 transitions.
Ending property specific reduction for PolyORBNT-PT-S10J40-UpperBounds-13 in 59249 ms.
[2023-03-24 14:33:27] [INFO ] Flatten gal took : 207 ms
[2023-03-24 14:33:27] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-24 14:33:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 751 places, 1522 transitions and 9221 arcs took 11 ms.
Total runtime 167419 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: PolyORBNT_PT_S10J40
(NrP: 751 NrTr: 1522 NrArc: 9221)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.156sec

net check time: 0m 0.001sec

init dd package: 0m 2.773sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9482900 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16074304 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.023sec

1248391 2319558

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-S10J40"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is PolyORBNT-PT-S10J40, 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 r298-tall-167873952200773"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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