Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r307-tajo-171654460900311.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r307-tajo-171654460900311
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 19M
-rw-r--r-- 1 mcc users 32K Apr 12 11:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 12 11:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 249K Apr 12 10:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 904K Apr 12 10:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 56K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 190K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 46K Apr 12 13:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 233K Apr 12 13:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 627K Apr 12 13:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.5M Apr 12 13:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 21K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14M May 18 16:43 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 1717134181368

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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J40
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-31 05:43:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 05:43:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 05:43:04] [INFO ] Load time of PNML (sax parser for PT used): 614 ms
[2024-05-31 05:43:04] [INFO ] Transformed 854 places.
[2024-05-31 05:43:04] [INFO ] Transformed 12340 transitions.
[2024-05-31 05:43:04] [INFO ] Parsed PT model containing 854 places and 12340 transitions and 113999 arcs in 822 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 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
[2024-05-31 05:43:04] [INFO ] Computed 112 invariants in 131 ms
FORMULA PolyORBNT-PT-S10J40-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J40-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 559 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 14) seen :23
FORMULA PolyORBNT-PT-S10J40-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 13) seen :22
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :22
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 13) seen :29
FORMULA PolyORBNT-PT-S10J40-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :22
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :28
FORMULA PolyORBNT-PT-S10J40-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 10) seen :22
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :22
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :22
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :22
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :22
[2024-05-31 05:43:05] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
// Phase 1: matrix 2221 rows 854 cols
[2024-05-31 05:43:05] [INFO ] Computed 112 invariants in 140 ms
[2024-05-31 05:43:06] [INFO ] [Real]Absence check using 81 positive place invariants in 58 ms returned sat
[2024-05-31 05:43:06] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 39 ms returned unsat
[2024-05-31 05:43:06] [INFO ] [Real]Absence check using 81 positive place invariants in 24 ms returned sat
[2024-05-31 05:43:06] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 38 ms returned unsat
[2024-05-31 05:43:06] [INFO ] [Real]Absence check using 81 positive place invariants in 31 ms returned sat
[2024-05-31 05:43:06] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 41 ms returned unsat
[2024-05-31 05:43:06] [INFO ] [Real]Absence check using 81 positive place invariants in 36 ms returned sat
[2024-05-31 05:43:06] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 42 ms returned unsat
[2024-05-31 05:43:07] [INFO ] [Real]Absence check using 81 positive place invariants in 22 ms returned sat
[2024-05-31 05:43:07] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 47 ms returned unsat
[2024-05-31 05:43:07] [INFO ] [Real]Absence check using 81 positive place invariants in 23 ms returned sat
[2024-05-31 05:43:07] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 24 ms returned sat
[2024-05-31 05:43:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:43:08] [INFO ] [Real]Absence check using state equation in 1470 ms returned sat
[2024-05-31 05:43:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:43:09] [INFO ] [Nat]Absence check using 81 positive place invariants in 23 ms returned sat
[2024-05-31 05:43:09] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 23 ms returned sat
[2024-05-31 05:43:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:43:11] [INFO ] [Nat]Absence check using state equation in 2484 ms returned sat
[2024-05-31 05:43:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:43:13] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 05:43:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 2351 ms returned unknown
[2024-05-31 05:43:14] [INFO ] [Real]Absence check using 81 positive place invariants in 23 ms returned sat
[2024-05-31 05:43:14] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 27 ms returned unsat
[2024-05-31 05:43:14] [INFO ] [Real]Absence check using 81 positive place invariants in 39 ms returned sat
[2024-05-31 05:43:14] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 85 ms returned unsat
[2024-05-31 05:43:14] [INFO ] [Real]Absence check using 81 positive place invariants in 22 ms returned sat
[2024-05-31 05:43:14] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 30 ms returned sat
[2024-05-31 05:43:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:43:15] [INFO ] [Real]Absence check using state equation in 1208 ms returned sat
[2024-05-31 05:43:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:43:16] [INFO ] [Nat]Absence check using 81 positive place invariants in 22 ms returned sat
[2024-05-31 05:43:16] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 41 ms returned sat
[2024-05-31 05:43:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:43:20] [INFO ] [Nat]Absence check using state equation in 4845 ms returned unknown
[2024-05-31 05:43:21] [INFO ] [Real]Absence check using 81 positive place invariants in 22 ms returned sat
[2024-05-31 05:43:21] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 33 ms returned sat
[2024-05-31 05:43:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:43:21] [INFO ] [Real]Absence check using state equation in 605 ms returned sat
[2024-05-31 05:43:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:43:22] [INFO ] [Nat]Absence check using 81 positive place invariants in 22 ms returned sat
[2024-05-31 05:43:22] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 30 ms returned sat
[2024-05-31 05:43:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:43:22] [INFO ] [Nat]Absence check using state equation in 742 ms returned sat
[2024-05-31 05:43:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 84 ms returned sat
[2024-05-31 05:43:23] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 276 ms.
[2024-05-31 05:43:26] [INFO ] Added : 5 causal constraints over 1 iterations in 3721 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 10, 1, 10, 410, 1, 1, 445, 1] Max seen :[1, 1, 10, 1, 10, 1, 1, 1, 1, 0]
FORMULA PolyORBNT-PT-S10J40-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 412 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 2 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 2 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 390 ms. Remains 751 /854 variables (removed 103) and now considering 2137/2230 (removed 93) transitions.
[2024-05-31 05:43:27] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
// Phase 1: matrix 2128 rows 751 cols
[2024-05-31 05:43:27] [INFO ] Computed 102 invariants in 31 ms
[2024-05-31 05:43:28] [INFO ] Dead Transitions using invariants and state equation in 1582 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 2019 ms. Remains : 751/854 places, 1522/2230 transitions.
Normalized transition count is 1513 out of 1522 initially.
// Phase 1: matrix 1513 rows 751 cols
[2024-05-31 05:43:29] [INFO ] Computed 102 invariants in 44 ms
Incomplete random walk after 1000000 steps, including 70420 resets, run finished after 15330 ms. (steps per millisecond=65 ) properties (out of 3) seen :8
FORMULA PolyORBNT-PT-S10J40-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 637400 steps, including 5265 resets, run visited all 2 properties in 5001 ms. (steps per millisecond=127 )
Incomplete Best-First random walk after 1000001 steps, including 8127 resets, run finished after 2464 ms. (steps per millisecond=405 ) properties (out of 2) seen :7
[2024-05-31 05:43:51] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2024-05-31 05:43:51] [INFO ] Computed 102 invariants in 50 ms
[2024-05-31 05:43:52] [INFO ] [Real]Absence check using 81 positive place invariants in 21 ms returned sat
[2024-05-31 05:43:52] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 22 ms returned sat
[2024-05-31 05:43:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:43:52] [INFO ] [Real]Absence check using state equation in 654 ms returned sat
[2024-05-31 05:43:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:43:52] [INFO ] [Nat]Absence check using 81 positive place invariants in 23 ms returned sat
[2024-05-31 05:43:52] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 19 ms returned sat
[2024-05-31 05:43:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:43:54] [INFO ] [Nat]Absence check using state equation in 1537 ms returned unsat
[2024-05-31 05:43:54] [INFO ] [Real]Absence check using 81 positive place invariants in 25 ms returned sat
[2024-05-31 05:43:54] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 24 ms returned sat
[2024-05-31 05:43:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:43:55] [INFO ] [Real]Absence check using state equation in 833 ms returned sat
[2024-05-31 05:43:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:43:55] [INFO ] [Nat]Absence check using 81 positive place invariants in 26 ms returned sat
[2024-05-31 05:43:55] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 27 ms returned sat
[2024-05-31 05:43:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:43:56] [INFO ] [Nat]Absence check using state equation in 679 ms returned sat
[2024-05-31 05:43:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:43:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 1251 ms returned sat
[2024-05-31 05:43:58] [INFO ] Deduced a trap composed of 302 places in 470 ms of which 11 ms to minimize.
[2024-05-31 05:43:58] [INFO ] Deduced a trap composed of 303 places in 473 ms of which 1 ms to minimize.
[2024-05-31 05:43:59] [INFO ] Deduced a trap composed of 292 places in 419 ms of which 2 ms to minimize.
[2024-05-31 05:43:59] [INFO ] Deduced a trap composed of 305 places in 404 ms of which 2 ms to minimize.
[2024-05-31 05:44:00] [INFO ] Deduced a trap composed of 311 places in 458 ms of which 1 ms to minimize.
[2024-05-31 05:44:00] [INFO ] Deduced a trap composed of 298 places in 322 ms of which 1 ms to minimize.
[2024-05-31 05:44:00] [INFO ] Deduced a trap composed of 308 places in 322 ms of which 0 ms to minimize.
[2024-05-31 05:44:01] [INFO ] Deduced a trap composed of 306 places in 303 ms of which 1 ms to minimize.
[2024-05-31 05:44:01] [INFO ] Deduced a trap composed of 314 places in 368 ms of which 1 ms to minimize.
[2024-05-31 05:44:02] [INFO ] Deduced a trap composed of 300 places in 387 ms of which 1 ms to minimize.
[2024-05-31 05:44:02] [INFO ] Deduced a trap composed of 304 places in 419 ms of which 1 ms to minimize.
[2024-05-31 05:44:03] [INFO ] Deduced a trap composed of 317 places in 429 ms of which 1 ms to minimize.
[2024-05-31 05:44:04] [INFO ] Deduced a trap composed of 309 places in 492 ms of which 1 ms to minimize.
[2024-05-31 05:44:04] [INFO ] Deduced a trap composed of 292 places in 446 ms of which 1 ms to minimize.
[2024-05-31 05:44:05] [INFO ] Deduced a trap composed of 304 places in 452 ms of which 1 ms to minimize.
[2024-05-31 05:44:05] [INFO ] Deduced a trap composed of 294 places in 296 ms of which 1 ms to minimize.
[2024-05-31 05:44:06] [INFO ] Deduced a trap composed of 296 places in 334 ms of which 1 ms to minimize.
[2024-05-31 05:44:06] [INFO ] Deduced a trap composed of 294 places in 337 ms of which 0 ms to minimize.
[2024-05-31 05:44:06] [INFO ] Deduced a trap composed of 294 places in 389 ms of which 1 ms to minimize.
[2024-05-31 05:44:07] [INFO ] Deduced a trap composed of 304 places in 396 ms of which 0 ms to minimize.
[2024-05-31 05:44:07] [INFO ] Deduced a trap composed of 302 places in 400 ms of which 1 ms to minimize.
[2024-05-31 05:44:08] [INFO ] Deduced a trap composed of 300 places in 371 ms of which 2 ms to minimize.
[2024-05-31 05:44:08] [INFO ] Deduced a trap composed of 306 places in 335 ms of which 0 ms to minimize.
[2024-05-31 05:44:09] [INFO ] Deduced a trap composed of 309 places in 412 ms of which 1 ms to minimize.
[2024-05-31 05:44:09] [INFO ] Deduced a trap composed of 309 places in 461 ms of which 1 ms to minimize.
[2024-05-31 05:44:10] [INFO ] Deduced a trap composed of 302 places in 505 ms of which 1 ms to minimize.
[2024-05-31 05:44:11] [INFO ] Deduced a trap composed of 306 places in 419 ms of which 1 ms to minimize.
[2024-05-31 05:44:11] [INFO ] Deduced a trap composed of 309 places in 409 ms of which 0 ms to minimize.
[2024-05-31 05:44:11] [INFO ] Deduced a trap composed of 302 places in 341 ms of which 1 ms to minimize.
[2024-05-31 05:44:12] [INFO ] Deduced a trap composed of 306 places in 317 ms of which 1 ms to minimize.
[2024-05-31 05:44:12] [INFO ] Deduced a trap composed of 308 places in 324 ms of which 1 ms to minimize.
[2024-05-31 05:44:13] [INFO ] Deduced a trap composed of 298 places in 369 ms of which 1 ms to minimize.
[2024-05-31 05:44:13] [INFO ] Deduced a trap composed of 315 places in 479 ms of which 1 ms to minimize.
[2024-05-31 05:44:14] [INFO ] Deduced a trap composed of 296 places in 468 ms of which 2 ms to minimize.
[2024-05-31 05:44:15] [INFO ] Deduced a trap composed of 314 places in 489 ms of which 5 ms to minimize.
[2024-05-31 05:44:16] [INFO ] Deduced a trap composed of 300 places in 474 ms of which 1 ms to minimize.
[2024-05-31 05:44:16] [INFO ] Deduced a trap composed of 296 places in 474 ms of which 1 ms to minimize.
[2024-05-31 05:44:17] [INFO ] Deduced a trap composed of 303 places in 482 ms of which 1 ms to minimize.
[2024-05-31 05:44:18] [INFO ] Deduced a trap composed of 302 places in 453 ms of which 1 ms to minimize.
[2024-05-31 05:44:18] [INFO ] Deduced a trap composed of 292 places in 435 ms of which 1 ms to minimize.
[2024-05-31 05:44:21] [INFO ] Deduced a trap composed of 290 places in 478 ms of which 1 ms to minimize.
[2024-05-31 05:44:21] [INFO ] Deduced a trap composed of 302 places in 444 ms of which 1 ms to minimize.
[2024-05-31 05:44:22] [INFO ] Deduced a trap composed of 286 places in 473 ms of which 1 ms to minimize.
[2024-05-31 05:44:25] [INFO ] Trap strengthening (SAT) tested/added 43/43 trap constraints in 27670 ms
Current structural bounds on expressions (after SMT) : [4, 181] Max seen :[4, 3]
FORMULA PolyORBNT-PT-S10J40-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
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 76 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 78 ms. Remains : 751/751 places, 1522/1522 transitions.
Normalized transition count is 1513 out of 1522 initially.
// Phase 1: matrix 1513 rows 751 cols
[2024-05-31 05:44:25] [INFO ] Computed 102 invariants in 49 ms
Incomplete random walk after 1000000 steps, including 70700 resets, run finished after 9122 ms. (steps per millisecond=109 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 8211 resets, run finished after 1920 ms. (steps per millisecond=520 ) properties (out of 1) seen :3
[2024-05-31 05:44:36] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2024-05-31 05:44:36] [INFO ] Computed 102 invariants in 56 ms
[2024-05-31 05:44:36] [INFO ] [Real]Absence check using 81 positive place invariants in 23 ms returned sat
[2024-05-31 05:44:36] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 25 ms returned sat
[2024-05-31 05:44:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:44:37] [INFO ] [Real]Absence check using state equation in 847 ms returned sat
[2024-05-31 05:44:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:44:37] [INFO ] [Nat]Absence check using 81 positive place invariants in 23 ms returned sat
[2024-05-31 05:44:37] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 26 ms returned sat
[2024-05-31 05:44:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:44:38] [INFO ] [Nat]Absence check using state equation in 633 ms returned sat
[2024-05-31 05:44:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:44:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 1161 ms returned sat
[2024-05-31 05:44:40] [INFO ] Deduced a trap composed of 302 places in 493 ms of which 1 ms to minimize.
[2024-05-31 05:44:40] [INFO ] Deduced a trap composed of 303 places in 488 ms of which 1 ms to minimize.
[2024-05-31 05:44:41] [INFO ] Deduced a trap composed of 292 places in 467 ms of which 1 ms to minimize.
[2024-05-31 05:44:41] [INFO ] Deduced a trap composed of 305 places in 456 ms of which 0 ms to minimize.
[2024-05-31 05:44:42] [INFO ] Deduced a trap composed of 311 places in 447 ms of which 1 ms to minimize.
[2024-05-31 05:44:42] [INFO ] Deduced a trap composed of 298 places in 440 ms of which 1 ms to minimize.
[2024-05-31 05:44:43] [INFO ] Deduced a trap composed of 308 places in 461 ms of which 1 ms to minimize.
[2024-05-31 05:44:43] [INFO ] Deduced a trap composed of 306 places in 422 ms of which 2 ms to minimize.
[2024-05-31 05:44:44] [INFO ] Deduced a trap composed of 314 places in 463 ms of which 1 ms to minimize.
[2024-05-31 05:44:45] [INFO ] Deduced a trap composed of 300 places in 467 ms of which 1 ms to minimize.
[2024-05-31 05:44:45] [INFO ] Deduced a trap composed of 304 places in 448 ms of which 1 ms to minimize.
[2024-05-31 05:44:46] [INFO ] Deduced a trap composed of 317 places in 452 ms of which 0 ms to minimize.
[2024-05-31 05:44:47] [INFO ] Deduced a trap composed of 309 places in 487 ms of which 1 ms to minimize.
[2024-05-31 05:44:48] [INFO ] Deduced a trap composed of 292 places in 493 ms of which 3 ms to minimize.
[2024-05-31 05:44:48] [INFO ] Deduced a trap composed of 304 places in 448 ms of which 1 ms to minimize.
[2024-05-31 05:44:49] [INFO ] Deduced a trap composed of 294 places in 425 ms of which 0 ms to minimize.
[2024-05-31 05:44:49] [INFO ] Deduced a trap composed of 296 places in 489 ms of which 1 ms to minimize.
[2024-05-31 05:44:50] [INFO ] Deduced a trap composed of 294 places in 503 ms of which 1 ms to minimize.
[2024-05-31 05:44:50] [INFO ] Deduced a trap composed of 294 places in 496 ms of which 1 ms to minimize.
[2024-05-31 05:44:51] [INFO ] Deduced a trap composed of 304 places in 457 ms of which 1 ms to minimize.
[2024-05-31 05:44:51] [INFO ] Deduced a trap composed of 302 places in 404 ms of which 1 ms to minimize.
[2024-05-31 05:44:52] [INFO ] Deduced a trap composed of 300 places in 507 ms of which 3 ms to minimize.
[2024-05-31 05:44:53] [INFO ] Deduced a trap composed of 306 places in 474 ms of which 1 ms to minimize.
[2024-05-31 05:44:53] [INFO ] Deduced a trap composed of 309 places in 487 ms of which 3 ms to minimize.
[2024-05-31 05:44:54] [INFO ] Deduced a trap composed of 309 places in 475 ms of which 1 ms to minimize.
[2024-05-31 05:44:55] [INFO ] Deduced a trap composed of 302 places in 509 ms of which 2 ms to minimize.
[2024-05-31 05:44:55] [INFO ] Deduced a trap composed of 306 places in 471 ms of which 1 ms to minimize.
[2024-05-31 05:44:56] [INFO ] Deduced a trap composed of 309 places in 446 ms of which 1 ms to minimize.
[2024-05-31 05:44:56] [INFO ] Deduced a trap composed of 302 places in 423 ms of which 1 ms to minimize.
[2024-05-31 05:44:57] [INFO ] Deduced a trap composed of 306 places in 435 ms of which 1 ms to minimize.
[2024-05-31 05:44:57] [INFO ] Deduced a trap composed of 308 places in 456 ms of which 1 ms to minimize.
[2024-05-31 05:44:58] [INFO ] Deduced a trap composed of 298 places in 533 ms of which 1 ms to minimize.
[2024-05-31 05:44:59] [INFO ] Deduced a trap composed of 315 places in 491 ms of which 1 ms to minimize.
[2024-05-31 05:44:59] [INFO ] Deduced a trap composed of 296 places in 480 ms of which 1 ms to minimize.
[2024-05-31 05:45:00] [INFO ] Deduced a trap composed of 314 places in 508 ms of which 1 ms to minimize.
[2024-05-31 05:45:01] [INFO ] Deduced a trap composed of 300 places in 478 ms of which 1 ms to minimize.
[2024-05-31 05:45:02] [INFO ] Deduced a trap composed of 296 places in 495 ms of which 2 ms to minimize.
[2024-05-31 05:45:03] [INFO ] Deduced a trap composed of 303 places in 497 ms of which 1 ms to minimize.
[2024-05-31 05:45:03] [INFO ] Deduced a trap composed of 302 places in 468 ms of which 1 ms to minimize.
[2024-05-31 05:45:04] [INFO ] Deduced a trap composed of 292 places in 449 ms of which 1 ms to minimize.
[2024-05-31 05:45:06] [INFO ] Deduced a trap composed of 290 places in 478 ms of which 1 ms to minimize.
[2024-05-31 05:45:07] [INFO ] Deduced a trap composed of 302 places in 446 ms of which 1 ms to minimize.
[2024-05-31 05:45:07] [INFO ] Deduced a trap composed of 286 places in 455 ms of which 1 ms to minimize.
[2024-05-31 05:45:10] [INFO ] Trap strengthening (SAT) tested/added 43/43 trap constraints in 31233 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 47 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 47 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 40 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2024-05-31 05:45:11] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2024-05-31 05:45:11] [INFO ] Invariant cache hit.
[2024-05-31 05:45:12] [INFO ] Implicit Places using invariants in 960 ms returned []
[2024-05-31 05:45:12] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2024-05-31 05:45:12] [INFO ] Invariant cache hit.
[2024-05-31 05:45:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:45:21] [INFO ] Implicit Places using invariants and state equation in 9870 ms returned []
Implicit Place search using SMT with State Equation took 10838 ms to find 0 implicit places.
[2024-05-31 05:45:22] [INFO ] Redundant transitions in 128 ms returned []
[2024-05-31 05:45:22] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2024-05-31 05:45:22] [INFO ] Invariant cache hit.
[2024-05-31 05:45:23] [INFO ] Dead Transitions using invariants and state equation in 1178 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12197 ms. Remains : 751/751 places, 1522/1522 transitions.
Starting property specific reduction for PolyORBNT-PT-S10J40-UpperBounds-12
Normalized transition count is 1513 out of 1522 initially.
// Phase 1: matrix 1513 rows 751 cols
[2024-05-31 05:45:23] [INFO ] Computed 102 invariants in 32 ms
Incomplete random walk after 10000 steps, including 718 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :3
[2024-05-31 05:45:23] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2024-05-31 05:45:23] [INFO ] Computed 102 invariants in 51 ms
[2024-05-31 05:45:23] [INFO ] [Real]Absence check using 81 positive place invariants in 22 ms returned sat
[2024-05-31 05:45:23] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 24 ms returned sat
[2024-05-31 05:45:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:45:24] [INFO ] [Real]Absence check using state equation in 771 ms returned sat
[2024-05-31 05:45:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:45:24] [INFO ] [Nat]Absence check using 81 positive place invariants in 29 ms returned sat
[2024-05-31 05:45:24] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 30 ms returned sat
[2024-05-31 05:45:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:45:25] [INFO ] [Nat]Absence check using state equation in 616 ms returned sat
[2024-05-31 05:45:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:45:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1365 ms returned sat
[2024-05-31 05:45:27] [INFO ] Deduced a trap composed of 302 places in 481 ms of which 0 ms to minimize.
[2024-05-31 05:45:27] [INFO ] Deduced a trap composed of 303 places in 468 ms of which 1 ms to minimize.
[2024-05-31 05:45:28] [INFO ] Deduced a trap composed of 292 places in 443 ms of which 1 ms to minimize.
[2024-05-31 05:45:28] [INFO ] Deduced a trap composed of 305 places in 437 ms of which 1 ms to minimize.
[2024-05-31 05:45:29] [INFO ] Deduced a trap composed of 311 places in 438 ms of which 0 ms to minimize.
[2024-05-31 05:45:29] [INFO ] Deduced a trap composed of 298 places in 426 ms of which 1 ms to minimize.
[2024-05-31 05:45:29] [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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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 43 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2024-05-31 05:45:29] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2024-05-31 05:45:29] [INFO ] Invariant cache hit.
[2024-05-31 05:45:30] [INFO ] Dead Transitions using invariants and state equation in 1047 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1103 ms. Remains : 751/751 places, 1522/1522 transitions.
Normalized transition count is 1513 out of 1522 initially.
// Phase 1: matrix 1513 rows 751 cols
[2024-05-31 05:45:30] [INFO ] Computed 102 invariants in 25 ms
Incomplete random walk after 1000000 steps, including 70253 resets, run finished after 8805 ms. (steps per millisecond=113 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 8174 resets, run finished after 1906 ms. (steps per millisecond=524 ) properties (out of 1) seen :3
[2024-05-31 05:45:41] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2024-05-31 05:45:41] [INFO ] Computed 102 invariants in 45 ms
[2024-05-31 05:45:41] [INFO ] [Real]Absence check using 81 positive place invariants in 21 ms returned sat
[2024-05-31 05:45:41] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 26 ms returned sat
[2024-05-31 05:45:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:45:42] [INFO ] [Real]Absence check using state equation in 740 ms returned sat
[2024-05-31 05:45:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:45:42] [INFO ] [Nat]Absence check using 81 positive place invariants in 23 ms returned sat
[2024-05-31 05:45:42] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 26 ms returned sat
[2024-05-31 05:45:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:45:43] [INFO ] [Nat]Absence check using state equation in 628 ms returned sat
[2024-05-31 05:45:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:45:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 1191 ms returned sat
[2024-05-31 05:45:45] [INFO ] Deduced a trap composed of 302 places in 485 ms of which 1 ms to minimize.
[2024-05-31 05:45:45] [INFO ] Deduced a trap composed of 303 places in 465 ms of which 1 ms to minimize.
[2024-05-31 05:45:46] [INFO ] Deduced a trap composed of 292 places in 441 ms of which 1 ms to minimize.
[2024-05-31 05:45:46] [INFO ] Deduced a trap composed of 305 places in 442 ms of which 1 ms to minimize.
[2024-05-31 05:45:47] [INFO ] Deduced a trap composed of 311 places in 441 ms of which 1 ms to minimize.
[2024-05-31 05:45:47] [INFO ] Deduced a trap composed of 298 places in 458 ms of which 1 ms to minimize.
[2024-05-31 05:45:48] [INFO ] Deduced a trap composed of 308 places in 493 ms of which 1 ms to minimize.
[2024-05-31 05:45:48] [INFO ] Deduced a trap composed of 306 places in 442 ms of which 1 ms to minimize.
[2024-05-31 05:45:49] [INFO ] Deduced a trap composed of 314 places in 510 ms of which 2 ms to minimize.
[2024-05-31 05:45:49] [INFO ] Deduced a trap composed of 300 places in 464 ms of which 1 ms to minimize.
[2024-05-31 05:45:50] [INFO ] Deduced a trap composed of 304 places in 487 ms of which 1 ms to minimize.
[2024-05-31 05:45:51] [INFO ] Deduced a trap composed of 317 places in 485 ms of which 1 ms to minimize.
[2024-05-31 05:45:52] [INFO ] Deduced a trap composed of 309 places in 495 ms of which 1 ms to minimize.
[2024-05-31 05:45:52] [INFO ] Deduced a trap composed of 292 places in 479 ms of which 1 ms to minimize.
[2024-05-31 05:45:53] [INFO ] Deduced a trap composed of 304 places in 491 ms of which 1 ms to minimize.
[2024-05-31 05:45:53] [INFO ] Deduced a trap composed of 294 places in 439 ms of which 1 ms to minimize.
[2024-05-31 05:45:54] [INFO ] Deduced a trap composed of 296 places in 440 ms of which 0 ms to minimize.
[2024-05-31 05:45:54] [INFO ] Deduced a trap composed of 294 places in 399 ms of which 1 ms to minimize.
[2024-05-31 05:45:55] [INFO ] Deduced a trap composed of 294 places in 489 ms of which 1 ms to minimize.
[2024-05-31 05:45:56] [INFO ] Deduced a trap composed of 304 places in 466 ms of which 0 ms to minimize.
[2024-05-31 05:45:56] [INFO ] Deduced a trap composed of 302 places in 459 ms of which 1 ms to minimize.
[2024-05-31 05:45:57] [INFO ] Deduced a trap composed of 300 places in 444 ms of which 0 ms to minimize.
[2024-05-31 05:45:57] [INFO ] Deduced a trap composed of 306 places in 465 ms of which 1 ms to minimize.
[2024-05-31 05:45:58] [INFO ] Deduced a trap composed of 309 places in 497 ms of which 1 ms to minimize.
[2024-05-31 05:45:58] [INFO ] Deduced a trap composed of 309 places in 377 ms of which 0 ms to minimize.
[2024-05-31 05:45:59] [INFO ] Deduced a trap composed of 302 places in 490 ms of which 1 ms to minimize.
[2024-05-31 05:46:00] [INFO ] Deduced a trap composed of 306 places in 440 ms of which 1 ms to minimize.
[2024-05-31 05:46:00] [INFO ] Deduced a trap composed of 309 places in 398 ms of which 1 ms to minimize.
[2024-05-31 05:46:01] [INFO ] Deduced a trap composed of 302 places in 363 ms of which 1 ms to minimize.
[2024-05-31 05:46:01] [INFO ] Deduced a trap composed of 306 places in 360 ms of which 1 ms to minimize.
[2024-05-31 05:46:02] [INFO ] Deduced a trap composed of 308 places in 356 ms of which 1 ms to minimize.
[2024-05-31 05:46:02] [INFO ] Deduced a trap composed of 298 places in 408 ms of which 1 ms to minimize.
[2024-05-31 05:46:03] [INFO ] Deduced a trap composed of 315 places in 373 ms of which 1 ms to minimize.
[2024-05-31 05:46:03] [INFO ] Deduced a trap composed of 296 places in 393 ms of which 1 ms to minimize.
[2024-05-31 05:46:04] [INFO ] Deduced a trap composed of 314 places in 369 ms of which 1 ms to minimize.
[2024-05-31 05:46:05] [INFO ] Deduced a trap composed of 300 places in 364 ms of which 1 ms to minimize.
[2024-05-31 05:46:06] [INFO ] Deduced a trap composed of 296 places in 430 ms of which 1 ms to minimize.
[2024-05-31 05:46:06] [INFO ] Deduced a trap composed of 303 places in 435 ms of which 1 ms to minimize.
[2024-05-31 05:46:07] [INFO ] Deduced a trap composed of 302 places in 450 ms of which 0 ms to minimize.
[2024-05-31 05:46:08] [INFO ] Deduced a trap composed of 292 places in 475 ms of which 1 ms to minimize.
[2024-05-31 05:46:10] [INFO ] Deduced a trap composed of 290 places in 526 ms of which 1 ms to minimize.
[2024-05-31 05:46:11] [INFO ] Deduced a trap composed of 302 places in 482 ms of which 1 ms to minimize.
[2024-05-31 05:46:11] [INFO ] Deduced a trap composed of 286 places in 479 ms of which 0 ms to minimize.
[2024-05-31 05:46:14] [INFO ] Trap strengthening (SAT) tested/added 43/43 trap constraints in 30317 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 82 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 82 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 59 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2024-05-31 05:46:14] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2024-05-31 05:46:14] [INFO ] Invariant cache hit.
[2024-05-31 05:46:16] [INFO ] Implicit Places using invariants in 1113 ms returned []
[2024-05-31 05:46:16] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2024-05-31 05:46:16] [INFO ] Invariant cache hit.
[2024-05-31 05:46:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:46:26] [INFO ] Implicit Places using invariants and state equation in 10640 ms returned []
Implicit Place search using SMT with State Equation took 11757 ms to find 0 implicit places.
[2024-05-31 05:46:26] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-31 05:46:26] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2024-05-31 05:46:26] [INFO ] Invariant cache hit.
[2024-05-31 05:46:27] [INFO ] Dead Transitions using invariants and state equation in 980 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12837 ms. Remains : 751/751 places, 1522/1522 transitions.
Ending property specific reduction for PolyORBNT-PT-S10J40-UpperBounds-12 in 64542 ms.
[2024-05-31 05:46:28] [INFO ] Flatten gal took : 191 ms
[2024-05-31 05:46:28] [INFO ] Applying decomposition
[2024-05-31 05:46:28] [INFO ] Flatten gal took : 122 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5186484457361438084.txt' '-o' '/tmp/graph5186484457361438084.bin' '-w' '/tmp/graph5186484457361438084.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5186484457361438084.bin' '-l' '-1' '-v' '-w' '/tmp/graph5186484457361438084.weights' '-q' '0' '-e' '0.001'
[2024-05-31 05:46:28] [INFO ] Decomposing Gal with order
[2024-05-31 05:46:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 05:46:28] [INFO ] Removed a total of 3516 redundant transitions.
[2024-05-31 05:46:29] [INFO ] Flatten gal took : 309 ms
[2024-05-31 05:46:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 169 labels/synchronizations in 41 ms.
[2024-05-31 05:46:29] [INFO ] Time to serialize gal into /tmp/UpperBounds4753396421086618768.gal : 21 ms
[2024-05-31 05:46:29] [INFO ] Time to serialize properties into /tmp/UpperBounds18072027774758420884.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4753396421086618768.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds18072027774758420884.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds18072027774758420884.prop.
ITS-tools command line returned an error code 137
[2024-05-31 06:05:28] [INFO ] Flatten gal took : 1021 ms
[2024-05-31 06:05:28] [INFO ] Time to serialize gal into /tmp/UpperBounds333767459018478581.gal : 105 ms
[2024-05-31 06:05:28] [INFO ] Time to serialize properties into /tmp/UpperBounds1185907548633495075.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds333767459018478581.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1185907548633495075.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...303
Loading property file /tmp/UpperBounds1185907548633495075.prop.
Detected timeout of ITS tools.
[2024-05-31 06:26:41] [INFO ] Flatten gal took : 695 ms
[2024-05-31 06:26:43] [INFO ] Input system was already deterministic with 1522 transitions.
[2024-05-31 06:26:43] [INFO ] Transformed 751 places.
[2024-05-31 06:26:43] [INFO ] Transformed 1522 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-31 06:27:13] [INFO ] Time to serialize gal into /tmp/UpperBounds5694526903739230715.gal : 32 ms
[2024-05-31 06:27:13] [INFO ] Time to serialize properties into /tmp/UpperBounds842269378868792469.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5694526903739230715.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds842269378868792469.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...348
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds842269378868792469.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 191380 kB
After kill :
MemTotal: 16393340 kB
MemFree: 6225212 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r307-tajo-171654460900311"
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 ;