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-171654460900306.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-S10J30, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460900306
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 27M
-rw-r--r-- 1 mcc users 12K Apr 12 11:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 12 11:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 762K Apr 12 11:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.7M Apr 12 11:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 44K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 143K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K Apr 12 14:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 212K Apr 12 14:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.9M Apr 12 13:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 7.1M Apr 12 13:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K 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-S10J30-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717133463379

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-S10J30
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-31 05:31:05] [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:31:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 05:31:06] [INFO ] Load time of PNML (sax parser for PT used): 843 ms
[2024-05-31 05:31:06] [INFO ] Transformed 664 places.
[2024-05-31 05:31:06] [INFO ] Transformed 12050 transitions.
[2024-05-31 05:31:06] [INFO ] Parsed PT model containing 664 places and 12050 transitions and 112559 arcs in 1129 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Normalized transition count is 1931 out of 1940 initially.
// Phase 1: matrix 1931 rows 664 cols
[2024-05-31 05:31:07] [INFO ] Computed 92 invariants in 160 ms
FORMULA PolyORBNT-PT-S10J30-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 560 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 15) seen :19
FORMULA PolyORBNT-PT-S10J30-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :12
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 14) seen :12
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :12
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :12
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :12
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 14) seen :12
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 14) seen :12
[2024-05-31 05:31:08] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2024-05-31 05:31:08] [INFO ] Computed 92 invariants in 94 ms
[2024-05-31 05:31:08] [INFO ] [Real]Absence check using 63 positive place invariants in 22 ms returned sat
[2024-05-31 05:31:08] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 30 ms returned unsat
[2024-05-31 05:31:08] [INFO ] [Real]Absence check using 63 positive place invariants in 22 ms returned sat
[2024-05-31 05:31:08] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 20 ms returned sat
[2024-05-31 05:31:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:31:09] [INFO ] [Real]Absence check using state equation in 749 ms returned sat
[2024-05-31 05:31:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:31:09] [INFO ] [Nat]Absence check using 63 positive place invariants in 14 ms returned sat
[2024-05-31 05:31:09] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 17 ms returned sat
[2024-05-31 05:31:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:31:13] [INFO ] [Nat]Absence check using state equation in 3426 ms returned sat
[2024-05-31 05:31:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:31:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 13 ms returned sat
[2024-05-31 05:31:13] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 283 ms.
[2024-05-31 05:31:14] [INFO ] Added : 32 causal constraints over 7 iterations in 1345 ms. Result :unknown
[2024-05-31 05:31:14] [INFO ] [Real]Absence check using 63 positive place invariants in 31 ms returned sat
[2024-05-31 05:31:14] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 38 ms returned sat
[2024-05-31 05:31:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:31:15] [INFO ] [Real]Absence check using state equation in 631 ms returned sat
[2024-05-31 05:31:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:31:15] [INFO ] [Nat]Absence check using 63 positive place invariants in 35 ms returned sat
[2024-05-31 05:31:15] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 42 ms returned sat
[2024-05-31 05:31:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:31:20] [INFO ] [Nat]Absence check using state equation in 4805 ms returned unknown
[2024-05-31 05:31:20] [INFO ] [Real]Absence check using 63 positive place invariants in 23 ms returned sat
[2024-05-31 05:31:20] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 31 ms returned unsat
[2024-05-31 05:31:20] [INFO ] [Real]Absence check using 63 positive place invariants in 24 ms returned sat
[2024-05-31 05:31:21] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 27 ms returned sat
[2024-05-31 05:31:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:31:21] [INFO ] [Real]Absence check using state equation in 704 ms returned sat
[2024-05-31 05:31:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:31:21] [INFO ] [Nat]Absence check using 63 positive place invariants in 20 ms returned sat
[2024-05-31 05:31:21] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 15 ms returned unsat
[2024-05-31 05:31:22] [INFO ] [Real]Absence check using 63 positive place invariants in 17 ms returned sat
[2024-05-31 05:31:22] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 23 ms returned sat
[2024-05-31 05:31:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:31:22] [INFO ] [Real]Absence check using state equation in 471 ms returned unsat
[2024-05-31 05:31:22] [INFO ] [Real]Absence check using 63 positive place invariants in 15 ms returned sat
[2024-05-31 05:31:22] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 19 ms returned sat
[2024-05-31 05:31:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:31:23] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2024-05-31 05:31:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:31:23] [INFO ] [Nat]Absence check using 63 positive place invariants in 18 ms returned sat
[2024-05-31 05:31:23] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 26 ms returned sat
[2024-05-31 05:31:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:31:28] [INFO ] [Nat]Absence check using state equation in 4873 ms returned unknown
[2024-05-31 05:31:28] [INFO ] [Real]Absence check using 63 positive place invariants in 19 ms returned sat
[2024-05-31 05:31:28] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 16 ms returned unsat
[2024-05-31 05:31:28] [INFO ] [Real]Absence check using 63 positive place invariants in 15 ms returned sat
[2024-05-31 05:31:28] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 19 ms returned unsat
[2024-05-31 05:31:28] [INFO ] [Real]Absence check using 63 positive place invariants in 18 ms returned sat
[2024-05-31 05:31:28] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 17 ms returned unsat
[2024-05-31 05:31:28] [INFO ] [Real]Absence check using 63 positive place invariants in 17 ms returned sat
[2024-05-31 05:31:28] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 24 ms returned unsat
[2024-05-31 05:31:28] [INFO ] [Real]Absence check using 63 positive place invariants in 19 ms returned sat
[2024-05-31 05:31:28] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 28 ms returned sat
[2024-05-31 05:31:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:31:30] [INFO ] [Real]Absence check using state equation in 1615 ms returned sat
[2024-05-31 05:31:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:31:30] [INFO ] [Nat]Absence check using 63 positive place invariants in 22 ms returned sat
[2024-05-31 05:31:30] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 25 ms returned sat
[2024-05-31 05:31:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:31:31] [INFO ] [Nat]Absence check using state equation in 1027 ms returned sat
[2024-05-31 05:31:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 253 ms returned sat
[2024-05-31 05:31:32] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 187 ms.
[2024-05-31 05:31:35] [INFO ] Added : 5 causal constraints over 1 iterations in 3459 ms. Result :unknown
[2024-05-31 05:31:35] [INFO ] [Real]Absence check using 63 positive place invariants in 18 ms returned sat
[2024-05-31 05:31:35] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 25 ms returned sat
[2024-05-31 05:31:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:31:36] [INFO ] [Real]Absence check using state equation in 670 ms returned sat
[2024-05-31 05:31:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:31:36] [INFO ] [Nat]Absence check using 63 positive place invariants in 18 ms returned sat
[2024-05-31 05:31:36] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 50 ms returned sat
[2024-05-31 05:31:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:31:37] [INFO ] [Nat]Absence check using state equation in 766 ms returned sat
[2024-05-31 05:31:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 334 ms returned sat
[2024-05-31 05:31:38] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 214 ms.
[2024-05-31 05:31:39] [INFO ] Deduced a trap composed of 19 places in 461 ms of which 6 ms to minimize.
[2024-05-31 05:31:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1177 ms
[2024-05-31 05:31:40] [INFO ] Added : 32 causal constraints over 8 iterations in 2702 ms. Result :sat
Minimization took 839 ms.
[2024-05-31 05:31:41] [INFO ] [Real]Absence check using 63 positive place invariants in 18 ms returned sat
[2024-05-31 05:31:41] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 15 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 151, 302, 1, 1, 10, 4, 1, 1, 1, 1, 1, 1, 1] Max seen :[1, 0, 0, 1, 1, 10, 0, 1, 1, 1, 1, 0, 0, 1]
FORMULA PolyORBNT-PT-S10J30-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 654 transition count 1904
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 82 place count 618 transition count 1904
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 82 place count 618 transition count 1869
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 152 place count 583 transition count 1869
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 582 transition count 1868
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 582 transition count 1868
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 158 place count 580 transition count 1866
Applied a total of 158 rules in 414 ms. Remains 580 /664 variables (removed 84) and now considering 1866/1940 (removed 74) transitions.
[2024-05-31 05:31:42] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
// Phase 1: matrix 1857 rows 580 cols
[2024-05-31 05:31:43] [INFO ] Computed 82 invariants in 69 ms
[2024-05-31 05:31:44] [INFO ] Dead Transitions using invariants and state equation in 1089 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 : 580/664 places, 1251/1940 transitions.
Applied a total of 0 rules in 48 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1554 ms. Remains : 580/664 places, 1251/1940 transitions.
Normalized transition count is 1242 out of 1251 initially.
// Phase 1: matrix 1242 rows 580 cols
[2024-05-31 05:31:44] [INFO ] Computed 82 invariants in 24 ms
Incomplete random walk after 1000000 steps, including 72794 resets, run finished after 6887 ms. (steps per millisecond=145 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 1000000 steps, including 8991 resets, run finished after 1456 ms. (steps per millisecond=686 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 1000001 steps, including 8911 resets, run finished after 1417 ms. (steps per millisecond=705 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 1000001 steps, including 8860 resets, run finished after 1455 ms. (steps per millisecond=687 ) properties (out of 3) seen :6
[2024-05-31 05:31:55] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2024-05-31 05:31:55] [INFO ] Computed 82 invariants in 57 ms
[2024-05-31 05:31:55] [INFO ] [Real]Absence check using 63 positive place invariants in 16 ms returned sat
[2024-05-31 05:31:55] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 6 ms returned unsat
[2024-05-31 05:31:55] [INFO ] [Real]Absence check using 63 positive place invariants in 16 ms returned sat
[2024-05-31 05:31:55] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 17 ms returned sat
[2024-05-31 05:31:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:31:56] [INFO ] [Real]Absence check using state equation in 679 ms returned sat
[2024-05-31 05:31:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:31:56] [INFO ] [Nat]Absence check using 63 positive place invariants in 18 ms returned sat
[2024-05-31 05:31:56] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 16 ms returned sat
[2024-05-31 05:31:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:31:56] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2024-05-31 05:31:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:31:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 788 ms returned sat
[2024-05-31 05:31:58] [INFO ] Deduced a trap composed of 236 places in 415 ms of which 1 ms to minimize.
[2024-05-31 05:31:58] [INFO ] Deduced a trap composed of 234 places in 375 ms of which 1 ms to minimize.
[2024-05-31 05:31:59] [INFO ] Deduced a trap composed of 221 places in 382 ms of which 2 ms to minimize.
[2024-05-31 05:31:59] [INFO ] Deduced a trap composed of 227 places in 395 ms of which 1 ms to minimize.
[2024-05-31 05:31:59] [INFO ] Deduced a trap composed of 226 places in 317 ms of which 1 ms to minimize.
[2024-05-31 05:32:00] [INFO ] Deduced a trap composed of 220 places in 329 ms of which 1 ms to minimize.
[2024-05-31 05:32:00] [INFO ] Deduced a trap composed of 235 places in 279 ms of which 2 ms to minimize.
[2024-05-31 05:32:00] [INFO ] Deduced a trap composed of 232 places in 292 ms of which 0 ms to minimize.
[2024-05-31 05:32:01] [INFO ] Deduced a trap composed of 239 places in 387 ms of which 1 ms to minimize.
[2024-05-31 05:32:01] [INFO ] Deduced a trap composed of 249 places in 353 ms of which 1 ms to minimize.
[2024-05-31 05:32:02] [INFO ] Deduced a trap composed of 226 places in 320 ms of which 0 ms to minimize.
[2024-05-31 05:32:02] [INFO ] Deduced a trap composed of 230 places in 361 ms of which 1 ms to minimize.
[2024-05-31 05:32:03] [INFO ] Deduced a trap composed of 228 places in 370 ms of which 0 ms to minimize.
[2024-05-31 05:32:03] [INFO ] Deduced a trap composed of 237 places in 400 ms of which 1 ms to minimize.
[2024-05-31 05:32:04] [INFO ] Deduced a trap composed of 234 places in 395 ms of which 0 ms to minimize.
[2024-05-31 05:32:05] [INFO ] Deduced a trap composed of 239 places in 413 ms of which 1 ms to minimize.
[2024-05-31 05:32:05] [INFO ] Deduced a trap composed of 232 places in 383 ms of which 1 ms to minimize.
[2024-05-31 05:32:05] [INFO ] Deduced a trap composed of 232 places in 372 ms of which 0 ms to minimize.
[2024-05-31 05:32:06] [INFO ] Deduced a trap composed of 230 places in 371 ms of which 1 ms to minimize.
[2024-05-31 05:32:07] [INFO ] Deduced a trap composed of 235 places in 341 ms of which 0 ms to minimize.
[2024-05-31 05:32:07] [INFO ] Deduced a trap composed of 231 places in 414 ms of which 3 ms to minimize.
[2024-05-31 05:32:08] [INFO ] Deduced a trap composed of 230 places in 374 ms of which 1 ms to minimize.
[2024-05-31 05:32:08] [INFO ] Deduced a trap composed of 224 places in 359 ms of which 0 ms to minimize.
[2024-05-31 05:32:09] [INFO ] Deduced a trap composed of 245 places in 412 ms of which 0 ms to minimize.
[2024-05-31 05:32:09] [INFO ] Deduced a trap composed of 224 places in 350 ms of which 1 ms to minimize.
[2024-05-31 05:32:10] [INFO ] Deduced a trap composed of 236 places in 410 ms of which 1 ms to minimize.
[2024-05-31 05:32:12] [INFO ] Deduced a trap composed of 230 places in 407 ms of which 1 ms to minimize.
[2024-05-31 05:32:12] [INFO ] Deduced a trap composed of 237 places in 395 ms of which 1 ms to minimize.
[2024-05-31 05:32:13] [INFO ] Deduced a trap composed of 241 places in 409 ms of which 0 ms to minimize.
[2024-05-31 05:32:13] [INFO ] Deduced a trap composed of 232 places in 373 ms of which 0 ms to minimize.
[2024-05-31 05:32:13] [INFO ] Deduced a trap composed of 226 places in 390 ms of which 1 ms to minimize.
[2024-05-31 05:32:14] [INFO ] Deduced a trap composed of 230 places in 375 ms of which 0 ms to minimize.
[2024-05-31 05:32:15] [INFO ] Deduced a trap composed of 240 places in 409 ms of which 1 ms to minimize.
[2024-05-31 05:32:15] [INFO ] Deduced a trap composed of 230 places in 412 ms of which 0 ms to minimize.
[2024-05-31 05:32:16] [INFO ] Deduced a trap composed of 244 places in 383 ms of which 1 ms to minimize.
[2024-05-31 05:32:16] [INFO ] Deduced a trap composed of 232 places in 402 ms of which 0 ms to minimize.
[2024-05-31 05:32:16] [INFO ] Deduced a trap composed of 237 places in 395 ms of which 0 ms to minimize.
[2024-05-31 05:32:17] [INFO ] Deduced a trap composed of 232 places in 392 ms of which 1 ms to minimize.
[2024-05-31 05:32:18] [INFO ] Deduced a trap composed of 241 places in 371 ms of which 1 ms to minimize.
[2024-05-31 05:32:18] [INFO ] Deduced a trap composed of 228 places in 408 ms of which 0 ms to minimize.
[2024-05-31 05:32:19] [INFO ] Deduced a trap composed of 228 places in 384 ms of which 0 ms to minimize.
[2024-05-31 05:32:20] [INFO ] Deduced a trap composed of 232 places in 378 ms of which 1 ms to minimize.
[2024-05-31 05:32:20] [INFO ] Deduced a trap composed of 226 places in 298 ms of which 1 ms to minimize.
[2024-05-31 05:32:21] [INFO ] Deduced a trap composed of 228 places in 328 ms of which 0 ms to minimize.
[2024-05-31 05:32:21] [INFO ] Deduced a trap composed of 234 places in 393 ms of which 1 ms to minimize.
[2024-05-31 05:32:22] [INFO ] Deduced a trap composed of 234 places in 361 ms of which 1 ms to minimize.
[2024-05-31 05:32:22] [INFO ] Deduced a trap composed of 224 places in 370 ms of which 1 ms to minimize.
[2024-05-31 05:32:23] [INFO ] Deduced a trap composed of 240 places in 366 ms of which 1 ms to minimize.
[2024-05-31 05:32:25] [INFO ] Deduced a trap composed of 230 places in 422 ms of which 1 ms to minimize.
[2024-05-31 05:32:26] [INFO ] Deduced a trap composed of 224 places in 404 ms of which 2 ms to minimize.
[2024-05-31 05:32:28] [INFO ] Deduced a trap composed of 228 places in 401 ms of which 1 ms to minimize.
[2024-05-31 05:32:31] [INFO ] Trap strengthening (SAT) tested/added 51/51 trap constraints in 33620 ms
[2024-05-31 05:32:31] [INFO ] [Real]Absence check using 63 positive place invariants in 17 ms returned sat
[2024-05-31 05:32:31] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 15 ms returned unsat
Current structural bounds on expressions (after SMT) : [2, 60, 1] Max seen :[2, 3, 1]
FORMULA PolyORBNT-PT-S10J30-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 44 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 580/580 places, 1251/1251 transitions.
Normalized transition count is 1242 out of 1251 initially.
// Phase 1: matrix 1242 rows 580 cols
[2024-05-31 05:32:31] [INFO ] Computed 82 invariants in 21 ms
Incomplete random walk after 1000000 steps, including 72735 resets, run finished after 7789 ms. (steps per millisecond=128 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 8909 resets, run finished after 1834 ms. (steps per millisecond=545 ) properties (out of 1) seen :3
[2024-05-31 05:32:41] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2024-05-31 05:32:41] [INFO ] Computed 82 invariants in 36 ms
[2024-05-31 05:32:41] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2024-05-31 05:32:41] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 13 ms returned sat
[2024-05-31 05:32:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:32:41] [INFO ] [Real]Absence check using state equation in 510 ms returned sat
[2024-05-31 05:32:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:32:42] [INFO ] [Nat]Absence check using 63 positive place invariants in 16 ms returned sat
[2024-05-31 05:32:42] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 15 ms returned sat
[2024-05-31 05:32:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:32:42] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2024-05-31 05:32:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:32:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 640 ms returned sat
[2024-05-31 05:32:43] [INFO ] Deduced a trap composed of 236 places in 418 ms of which 2 ms to minimize.
[2024-05-31 05:32:44] [INFO ] Deduced a trap composed of 234 places in 383 ms of which 0 ms to minimize.
[2024-05-31 05:32:44] [INFO ] Deduced a trap composed of 221 places in 380 ms of which 0 ms to minimize.
[2024-05-31 05:32:44] [INFO ] Deduced a trap composed of 227 places in 323 ms of which 0 ms to minimize.
[2024-05-31 05:32:45] [INFO ] Deduced a trap composed of 226 places in 385 ms of which 6 ms to minimize.
[2024-05-31 05:32:45] [INFO ] Deduced a trap composed of 220 places in 381 ms of which 1 ms to minimize.
[2024-05-31 05:32:46] [INFO ] Deduced a trap composed of 235 places in 397 ms of which 1 ms to minimize.
[2024-05-31 05:32:46] [INFO ] Deduced a trap composed of 232 places in 433 ms of which 1 ms to minimize.
[2024-05-31 05:32:47] [INFO ] Deduced a trap composed of 239 places in 354 ms of which 1 ms to minimize.
[2024-05-31 05:32:47] [INFO ] Deduced a trap composed of 249 places in 385 ms of which 1 ms to minimize.
[2024-05-31 05:32:48] [INFO ] Deduced a trap composed of 226 places in 408 ms of which 1 ms to minimize.
[2024-05-31 05:32:48] [INFO ] Deduced a trap composed of 230 places in 424 ms of which 0 ms to minimize.
[2024-05-31 05:32:48] [INFO ] Deduced a trap composed of 228 places in 418 ms of which 3 ms to minimize.
[2024-05-31 05:32:49] [INFO ] Deduced a trap composed of 237 places in 301 ms of which 0 ms to minimize.
[2024-05-31 05:32:50] [INFO ] Deduced a trap composed of 234 places in 311 ms of which 2 ms to minimize.
[2024-05-31 05:32:50] [INFO ] Deduced a trap composed of 239 places in 430 ms of which 13 ms to minimize.
[2024-05-31 05:32:51] [INFO ] Deduced a trap composed of 232 places in 423 ms of which 2 ms to minimize.
[2024-05-31 05:32:51] [INFO ] Deduced a trap composed of 232 places in 376 ms of which 1 ms to minimize.
[2024-05-31 05:32:52] [INFO ] Deduced a trap composed of 230 places in 425 ms of which 1 ms to minimize.
[2024-05-31 05:32:52] [INFO ] Deduced a trap composed of 235 places in 402 ms of which 1 ms to minimize.
[2024-05-31 05:32:53] [INFO ] Deduced a trap composed of 231 places in 412 ms of which 1 ms to minimize.
[2024-05-31 05:32:53] [INFO ] Deduced a trap composed of 230 places in 403 ms of which 1 ms to minimize.
[2024-05-31 05:32:54] [INFO ] Deduced a trap composed of 224 places in 346 ms of which 0 ms to minimize.
[2024-05-31 05:32:54] [INFO ] Deduced a trap composed of 245 places in 369 ms of which 1 ms to minimize.
[2024-05-31 05:32:55] [INFO ] Deduced a trap composed of 224 places in 313 ms of which 0 ms to minimize.
[2024-05-31 05:32:55] [INFO ] Deduced a trap composed of 236 places in 396 ms of which 1 ms to minimize.
[2024-05-31 05:32:57] [INFO ] Deduced a trap composed of 230 places in 402 ms of which 1 ms to minimize.
[2024-05-31 05:32:57] [INFO ] Deduced a trap composed of 237 places in 390 ms of which 1 ms to minimize.
[2024-05-31 05:32:58] [INFO ] Deduced a trap composed of 241 places in 342 ms of which 1 ms to minimize.
[2024-05-31 05:32:58] [INFO ] Deduced a trap composed of 232 places in 320 ms of which 0 ms to minimize.
[2024-05-31 05:32:58] [INFO ] Deduced a trap composed of 226 places in 298 ms of which 1 ms to minimize.
[2024-05-31 05:32:59] [INFO ] Deduced a trap composed of 230 places in 265 ms of which 0 ms to minimize.
[2024-05-31 05:32:59] [INFO ] Deduced a trap composed of 240 places in 355 ms of which 2 ms to minimize.
[2024-05-31 05:33:00] [INFO ] Deduced a trap composed of 230 places in 403 ms of which 1 ms to minimize.
[2024-05-31 05:33:00] [INFO ] Deduced a trap composed of 244 places in 395 ms of which 1 ms to minimize.
[2024-05-31 05:33:01] [INFO ] Deduced a trap composed of 232 places in 416 ms of which 1 ms to minimize.
[2024-05-31 05:33:01] [INFO ] Deduced a trap composed of 237 places in 380 ms of which 0 ms to minimize.
[2024-05-31 05:33:02] [INFO ] Deduced a trap composed of 232 places in 423 ms of which 2 ms to minimize.
[2024-05-31 05:33:03] [INFO ] Deduced a trap composed of 241 places in 394 ms of which 0 ms to minimize.
[2024-05-31 05:33:03] [INFO ] Deduced a trap composed of 228 places in 392 ms of which 1 ms to minimize.
[2024-05-31 05:33:04] [INFO ] Deduced a trap composed of 228 places in 385 ms of which 0 ms to minimize.
[2024-05-31 05:33:05] [INFO ] Deduced a trap composed of 232 places in 389 ms of which 1 ms to minimize.
[2024-05-31 05:33:05] [INFO ] Deduced a trap composed of 226 places in 368 ms of which 1 ms to minimize.
[2024-05-31 05:33:06] [INFO ] Deduced a trap composed of 228 places in 384 ms of which 0 ms to minimize.
[2024-05-31 05:33:06] [INFO ] Deduced a trap composed of 234 places in 377 ms of which 0 ms to minimize.
[2024-05-31 05:33:07] [INFO ] Deduced a trap composed of 234 places in 403 ms of which 1 ms to minimize.
[2024-05-31 05:33:07] [INFO ] Deduced a trap composed of 224 places in 382 ms of which 0 ms to minimize.
[2024-05-31 05:33:08] [INFO ] Deduced a trap composed of 240 places in 372 ms of which 0 ms to minimize.
[2024-05-31 05:33:10] [INFO ] Deduced a trap composed of 230 places in 400 ms of which 1 ms to minimize.
[2024-05-31 05:33:11] [INFO ] Deduced a trap composed of 224 places in 382 ms of which 1 ms to minimize.
[2024-05-31 05:33:13] [INFO ] Deduced a trap composed of 228 places in 349 ms of which 1 ms to minimize.
[2024-05-31 05:33:16] [INFO ] Trap strengthening (SAT) tested/added 51/51 trap constraints in 32939 ms
Current structural bounds on expressions (after SMT) : [60] Max seen :[3]
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 42 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 580/580 places, 1251/1251 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 36 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2024-05-31 05:33:16] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 05:33:16] [INFO ] Invariant cache hit.
[2024-05-31 05:33:16] [INFO ] Implicit Places using invariants in 672 ms returned []
[2024-05-31 05:33:16] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 05:33:16] [INFO ] Invariant cache hit.
[2024-05-31 05:33:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:33:24] [INFO ] Implicit Places using invariants and state equation in 7490 ms returned []
Implicit Place search using SMT with State Equation took 8165 ms to find 0 implicit places.
[2024-05-31 05:33:24] [INFO ] Redundant transitions in 109 ms returned []
[2024-05-31 05:33:24] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 05:33:24] [INFO ] Invariant cache hit.
[2024-05-31 05:33:25] [INFO ] Dead Transitions using invariants and state equation in 726 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9051 ms. Remains : 580/580 places, 1251/1251 transitions.
Starting property specific reduction for PolyORBNT-PT-S10J30-UpperBounds-02
Normalized transition count is 1242 out of 1251 initially.
// Phase 1: matrix 1242 rows 580 cols
[2024-05-31 05:33:25] [INFO ] Computed 82 invariants in 14 ms
Incomplete random walk after 10000 steps, including 739 resets, run finished after 81 ms. (steps per millisecond=123 ) 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:33:25] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2024-05-31 05:33:25] [INFO ] Computed 82 invariants in 35 ms
[2024-05-31 05:33:25] [INFO ] [Real]Absence check using 63 positive place invariants in 15 ms returned sat
[2024-05-31 05:33:25] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 27 ms returned sat
[2024-05-31 05:33:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:33:26] [INFO ] [Real]Absence check using state equation in 633 ms returned sat
[2024-05-31 05:33:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:33:26] [INFO ] [Nat]Absence check using 63 positive place invariants in 16 ms returned sat
[2024-05-31 05:33:26] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 14 ms returned sat
[2024-05-31 05:33:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:33:26] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2024-05-31 05:33:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:33:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 641 ms returned sat
[2024-05-31 05:33:27] [INFO ] Deduced a trap composed of 236 places in 393 ms of which 1 ms to minimize.
[2024-05-31 05:33:28] [INFO ] Deduced a trap composed of 234 places in 370 ms of which 0 ms to minimize.
[2024-05-31 05:33:28] [INFO ] Deduced a trap composed of 221 places in 367 ms of which 0 ms to minimize.
[2024-05-31 05:33:29] [INFO ] Deduced a trap composed of 227 places in 351 ms of which 1 ms to minimize.
[2024-05-31 05:33:29] [INFO ] Deduced a trap composed of 226 places in 350 ms of which 0 ms to minimize.
[2024-05-31 05:33:29] [INFO ] Deduced a trap composed of 220 places in 361 ms of which 1 ms to minimize.
[2024-05-31 05:33:30] [INFO ] Deduced a trap composed of 235 places in 359 ms of which 0 ms to minimize.
[2024-05-31 05:33:30] [INFO ] Deduced a trap composed of 232 places in 371 ms of which 1 ms to minimize.
[2024-05-31 05:33:31] [INFO ] Deduced a trap composed of 239 places in 374 ms of which 0 ms to minimize.
[2024-05-31 05:33:31] [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) : [60] Max seen :[3]
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 47 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2024-05-31 05:33:31] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 05:33:31] [INFO ] Invariant cache hit.
[2024-05-31 05:33:32] [INFO ] Dead Transitions using invariants and state equation in 885 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 935 ms. Remains : 580/580 places, 1251/1251 transitions.
Normalized transition count is 1242 out of 1251 initially.
// Phase 1: matrix 1242 rows 580 cols
[2024-05-31 05:33:32] [INFO ] Computed 82 invariants in 13 ms
Incomplete random walk after 1000000 steps, including 72759 resets, run finished after 6352 ms. (steps per millisecond=157 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 9012 resets, run finished after 1482 ms. (steps per millisecond=674 ) properties (out of 1) seen :3
[2024-05-31 05:33:40] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2024-05-31 05:33:40] [INFO ] Computed 82 invariants in 38 ms
[2024-05-31 05:33:40] [INFO ] [Real]Absence check using 63 positive place invariants in 16 ms returned sat
[2024-05-31 05:33:40] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 16 ms returned sat
[2024-05-31 05:33:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:33:40] [INFO ] [Real]Absence check using state equation in 632 ms returned sat
[2024-05-31 05:33:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:33:41] [INFO ] [Nat]Absence check using 63 positive place invariants in 14 ms returned sat
[2024-05-31 05:33:41] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 13 ms returned sat
[2024-05-31 05:33:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:33:41] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2024-05-31 05:33:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:33:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 774 ms returned sat
[2024-05-31 05:33:42] [INFO ] Deduced a trap composed of 236 places in 351 ms of which 0 ms to minimize.
[2024-05-31 05:33:42] [INFO ] Deduced a trap composed of 234 places in 337 ms of which 0 ms to minimize.
[2024-05-31 05:33:43] [INFO ] Deduced a trap composed of 221 places in 319 ms of which 1 ms to minimize.
[2024-05-31 05:33:43] [INFO ] Deduced a trap composed of 227 places in 351 ms of which 1 ms to minimize.
[2024-05-31 05:33:44] [INFO ] Deduced a trap composed of 226 places in 387 ms of which 1 ms to minimize.
[2024-05-31 05:33:44] [INFO ] Deduced a trap composed of 220 places in 358 ms of which 0 ms to minimize.
[2024-05-31 05:33:45] [INFO ] Deduced a trap composed of 235 places in 359 ms of which 1 ms to minimize.
[2024-05-31 05:33:45] [INFO ] Deduced a trap composed of 232 places in 347 ms of which 1 ms to minimize.
[2024-05-31 05:33:45] [INFO ] Deduced a trap composed of 239 places in 381 ms of which 1 ms to minimize.
[2024-05-31 05:33:46] [INFO ] Deduced a trap composed of 249 places in 354 ms of which 1 ms to minimize.
[2024-05-31 05:33:46] [INFO ] Deduced a trap composed of 226 places in 338 ms of which 2 ms to minimize.
[2024-05-31 05:33:47] [INFO ] Deduced a trap composed of 230 places in 464 ms of which 2 ms to minimize.
[2024-05-31 05:33:47] [INFO ] Deduced a trap composed of 228 places in 370 ms of which 1 ms to minimize.
[2024-05-31 05:33:48] [INFO ] Deduced a trap composed of 237 places in 656 ms of which 1 ms to minimize.
[2024-05-31 05:33:49] [INFO ] Deduced a trap composed of 234 places in 441 ms of which 1 ms to minimize.
[2024-05-31 05:33:50] [INFO ] Deduced a trap composed of 239 places in 449 ms of which 1 ms to minimize.
[2024-05-31 05:33:50] [INFO ] Deduced a trap composed of 232 places in 488 ms of which 0 ms to minimize.
[2024-05-31 05:33:51] [INFO ] Deduced a trap composed of 232 places in 443 ms of which 1 ms to minimize.
[2024-05-31 05:33:51] [INFO ] Deduced a trap composed of 230 places in 473 ms of which 0 ms to minimize.
[2024-05-31 05:33:52] [INFO ] Deduced a trap composed of 235 places in 442 ms of which 1 ms to minimize.
[2024-05-31 05:33:52] [INFO ] Deduced a trap composed of 231 places in 457 ms of which 1 ms to minimize.
[2024-05-31 05:33:53] [INFO ] Deduced a trap composed of 230 places in 482 ms of which 0 ms to minimize.
[2024-05-31 05:33:53] [INFO ] Deduced a trap composed of 224 places in 328 ms of which 1 ms to minimize.
[2024-05-31 05:33:54] [INFO ] Deduced a trap composed of 245 places in 422 ms of which 1 ms to minimize.
[2024-05-31 05:33:55] [INFO ] Deduced a trap composed of 224 places in 401 ms of which 1 ms to minimize.
[2024-05-31 05:33:55] [INFO ] Deduced a trap composed of 236 places in 430 ms of which 1 ms to minimize.
[2024-05-31 05:33:57] [INFO ] Deduced a trap composed of 230 places in 652 ms of which 1 ms to minimize.
[2024-05-31 05:33:58] [INFO ] Deduced a trap composed of 237 places in 597 ms of which 1 ms to minimize.
[2024-05-31 05:33:58] [INFO ] Deduced a trap composed of 241 places in 426 ms of which 1 ms to minimize.
[2024-05-31 05:33:59] [INFO ] Deduced a trap composed of 232 places in 439 ms of which 1 ms to minimize.
[2024-05-31 05:33:59] [INFO ] Deduced a trap composed of 226 places in 360 ms of which 1 ms to minimize.
[2024-05-31 05:34:00] [INFO ] Deduced a trap composed of 230 places in 365 ms of which 1 ms to minimize.
[2024-05-31 05:34:00] [INFO ] Deduced a trap composed of 240 places in 382 ms of which 0 ms to minimize.
[2024-05-31 05:34:01] [INFO ] Deduced a trap composed of 230 places in 403 ms of which 0 ms to minimize.
[2024-05-31 05:34:01] [INFO ] Deduced a trap composed of 244 places in 365 ms of which 1 ms to minimize.
[2024-05-31 05:34:02] [INFO ] Deduced a trap composed of 232 places in 401 ms of which 1 ms to minimize.
[2024-05-31 05:34:02] [INFO ] Deduced a trap composed of 237 places in 411 ms of which 1 ms to minimize.
[2024-05-31 05:34:03] [INFO ] Deduced a trap composed of 232 places in 288 ms of which 1 ms to minimize.
[2024-05-31 05:34:03] [INFO ] Deduced a trap composed of 241 places in 331 ms of which 0 ms to minimize.
[2024-05-31 05:34:04] [INFO ] Deduced a trap composed of 228 places in 365 ms of which 0 ms to minimize.
[2024-05-31 05:34:04] [INFO ] Deduced a trap composed of 228 places in 369 ms of which 1 ms to minimize.
[2024-05-31 05:34:05] [INFO ] Deduced a trap composed of 232 places in 331 ms of which 1 ms to minimize.
[2024-05-31 05:34:06] [INFO ] Deduced a trap composed of 226 places in 311 ms of which 4 ms to minimize.
[2024-05-31 05:34:06] [INFO ] Deduced a trap composed of 228 places in 348 ms of which 0 ms to minimize.
[2024-05-31 05:34:07] [INFO ] Deduced a trap composed of 234 places in 402 ms of which 1 ms to minimize.
[2024-05-31 05:34:07] [INFO ] Deduced a trap composed of 234 places in 406 ms of which 0 ms to minimize.
[2024-05-31 05:34:08] [INFO ] Deduced a trap composed of 224 places in 379 ms of which 0 ms to minimize.
[2024-05-31 05:34:08] [INFO ] Deduced a trap composed of 240 places in 375 ms of which 1 ms to minimize.
[2024-05-31 05:34:10] [INFO ] Deduced a trap composed of 230 places in 399 ms of which 0 ms to minimize.
[2024-05-31 05:34:12] [INFO ] Deduced a trap composed of 224 places in 350 ms of which 0 ms to minimize.
[2024-05-31 05:34:13] [INFO ] Deduced a trap composed of 228 places in 335 ms of which 1 ms to minimize.
[2024-05-31 05:34:16] [INFO ] Trap strengthening (SAT) tested/added 51/51 trap constraints in 34351 ms
Current structural bounds on expressions (after SMT) : [60] Max seen :[3]
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 78 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 580/580 places, 1251/1251 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 48 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2024-05-31 05:34:16] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 05:34:16] [INFO ] Invariant cache hit.
[2024-05-31 05:34:17] [INFO ] Implicit Places using invariants in 648 ms returned []
[2024-05-31 05:34:17] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 05:34:17] [INFO ] Invariant cache hit.
[2024-05-31 05:34:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:34:24] [INFO ] Implicit Places using invariants and state equation in 7169 ms returned []
Implicit Place search using SMT with State Equation took 7820 ms to find 0 implicit places.
[2024-05-31 05:34:24] [INFO ] Redundant transitions in 33 ms returned []
[2024-05-31 05:34:24] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 05:34:24] [INFO ] Invariant cache hit.
[2024-05-31 05:34:25] [INFO ] Dead Transitions using invariants and state equation in 1054 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8973 ms. Remains : 580/580 places, 1251/1251 transitions.
Ending property specific reduction for PolyORBNT-PT-S10J30-UpperBounds-02 in 60365 ms.
[2024-05-31 05:34:26] [INFO ] Flatten gal took : 264 ms
[2024-05-31 05:34:26] [INFO ] Applying decomposition
[2024-05-31 05:34:26] [INFO ] Flatten gal took : 126 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/graph9624898434416918486.txt' '-o' '/tmp/graph9624898434416918486.bin' '-w' '/tmp/graph9624898434416918486.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9624898434416918486.bin' '-l' '-1' '-v' '-w' '/tmp/graph9624898434416918486.weights' '-q' '0' '-e' '0.001'
[2024-05-31 05:34:26] [INFO ] Decomposing Gal with order
[2024-05-31 05:34:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 05:34:27] [INFO ] Removed a total of 3072 redundant transitions.
[2024-05-31 05:34:27] [INFO ] Flatten gal took : 476 ms
[2024-05-31 05:34:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 343 labels/synchronizations in 90 ms.
[2024-05-31 05:34:27] [INFO ] Time to serialize gal into /tmp/UpperBounds14256103696580804309.gal : 60 ms
[2024-05-31 05:34:27] [INFO ] Time to serialize properties into /tmp/UpperBounds5066295359444454022.prop : 10 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/UpperBounds14256103696580804309.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5066295359444454022.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/UpperBounds5066295359444454022.prop.
Detected timeout of ITS tools.
[2024-05-31 05:55:38] [INFO ] Flatten gal took : 657 ms
[2024-05-31 05:55:38] [INFO ] Time to serialize gal into /tmp/UpperBounds9745658994895139261.gal : 101 ms
[2024-05-31 05:55:38] [INFO ] Time to serialize properties into /tmp/UpperBounds12398939845465108980.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/UpperBounds9745658994895139261.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12398939845465108980.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 ...305
Loading property file /tmp/UpperBounds12398939845465108980.prop.
Detected timeout of ITS tools.
[2024-05-31 06:16:47] [INFO ] Flatten gal took : 880 ms
[2024-05-31 06:16:50] [INFO ] Input system was already deterministic with 1251 transitions.
[2024-05-31 06:16:50] [INFO ] Transformed 580 places.
[2024-05-31 06:16:50] [INFO ] Transformed 1251 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:17:20] [INFO ] Time to serialize gal into /tmp/UpperBounds18378299241798427478.gal : 29 ms
[2024-05-31 06:17:20] [INFO ] Time to serialize properties into /tmp/UpperBounds3512368835540401066.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/UpperBounds18378299241798427478.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3512368835540401066.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 ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds3512368835540401066.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 160440 kB
After kill :
MemTotal: 16393340 kB
MemFree: 15728660 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:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ sed s/.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-S10J30"
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-S10J30, 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-171654460900306"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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