Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r298-tall-167873951800509.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is PolyORBLF-PT-S02J04T10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873951800509
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 19K Feb 26 13:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 13:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Feb 26 13:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 139K Feb 26 13:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Feb 25 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 54K Feb 26 14:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 249K Feb 26 14:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 65K Feb 26 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 329K Feb 26 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 906K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679571822001

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 11:43:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 11:43:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 11:43:43] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2023-03-23 11:43:43] [INFO ] Transformed 752 places.
[2023-03-23 11:43:43] [INFO ] Transformed 1572 transitions.
[2023-03-23 11:43:43] [INFO ] Parsed PT model containing 752 places and 1572 transitions and 7262 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Normalized transition count is 1392 out of 1412 initially.
// Phase 1: matrix 1392 rows 752 cols
[2023-03-23 11:43:43] [INFO ] Computed 54 place invariants in 98 ms
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 14) seen :19
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) seen :16
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :16
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :17
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :17
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :16
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :17
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :13
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :16
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :12
[2023-03-23 11:43:44] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2023-03-23 11:43:44] [INFO ] Computed 54 place invariants in 57 ms
[2023-03-23 11:43:44] [INFO ] [Real]Absence check using 15 positive place invariants in 21 ms returned sat
[2023-03-23 11:43:44] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 25 ms returned unsat
[2023-03-23 11:43:44] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2023-03-23 11:43:44] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 18 ms returned unsat
[2023-03-23 11:43:44] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned unsat
[2023-03-23 11:43:45] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned unsat
[2023-03-23 11:43:45] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2023-03-23 11:43:45] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 25 ms returned sat
[2023-03-23 11:43:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 11:43:46] [INFO ] [Real]Absence check using state equation in 1184 ms returned sat
[2023-03-23 11:43:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 11:43:46] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-23 11:43:46] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 22 ms returned sat
[2023-03-23 11:43:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 11:43:48] [INFO ] [Nat]Absence check using state equation in 2043 ms returned sat
[2023-03-23 11:43:48] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 11:43:51] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 11:43:51] [INFO ] [Nat]Added 120 Read/Feed constraints in 2845 ms returned unknown
[2023-03-23 11:43:51] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-23 11:43:51] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 17 ms returned unsat
[2023-03-23 11:43:51] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-23 11:43:51] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 37 ms returned sat
[2023-03-23 11:43:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 11:43:53] [INFO ] [Real]Absence check using state equation in 1530 ms returned sat
[2023-03-23 11:43:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 11:43:53] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-23 11:43:53] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 28 ms returned sat
[2023-03-23 11:43:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 11:43:57] [INFO ] [Nat]Absence check using state equation in 4399 ms returned sat
[2023-03-23 11:43:58] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 11:43:58] [INFO ] [Nat]Added 120 Read/Feed constraints in 501 ms returned unknown
[2023-03-23 11:43:58] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-23 11:43:58] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 3 ms returned unsat
[2023-03-23 11:43:58] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-23 11:43:58] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 12 ms returned unsat
[2023-03-23 11:43:58] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-23 11:43:58] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 23 ms returned sat
[2023-03-23 11:43:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 11:43:59] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2023-03-23 11:43:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 11:43:59] [INFO ] [Nat]Absence check using 15 positive place invariants in 18 ms returned sat
[2023-03-23 11:43:59] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 22 ms returned sat
[2023-03-23 11:43:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 11:44:02] [INFO ] [Nat]Absence check using state equation in 3339 ms returned sat
[2023-03-23 11:44:03] [INFO ] [Nat]Added 120 Read/Feed constraints in 857 ms returned sat
[2023-03-23 11:44:03] [INFO ] Deduced a trap composed of 23 places in 327 ms of which 7 ms to minimize.
[2023-03-23 11:44:04] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 683 ms
[2023-03-23 11:44:04] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-23 11:44:04] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 25 ms returned unsat
[2023-03-23 11:44:04] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-23 11:44:04] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 27 ms returned sat
[2023-03-23 11:44:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 11:44:05] [INFO ] [Real]Absence check using state equation in 1359 ms returned sat
[2023-03-23 11:44:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 11:44:05] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-23 11:44:05] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 26 ms returned sat
[2023-03-23 11:44:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 11:44:07] [INFO ] [Nat]Absence check using state equation in 1296 ms returned sat
[2023-03-23 11:44:08] [INFO ] [Nat]Added 120 Read/Feed constraints in 1689 ms returned sat
[2023-03-23 11:44:09] [INFO ] Deduced a trap composed of 23 places in 299 ms of which 1 ms to minimize.
[2023-03-23 11:44:09] [INFO ] Deduced a trap composed of 360 places in 313 ms of which 1 ms to minimize.
[2023-03-23 11:44:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1817 ms
[2023-03-23 11:44:10] [INFO ] Computed and/alt/rep : 720/1388/710 causal constraints (skipped 680 transitions) in 92 ms.
[2023-03-23 11:44:10] [INFO ] Added : 0 causal constraints over 0 iterations in 98 ms. Result :unknown
[2023-03-23 11:44:10] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-23 11:44:10] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 22 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, -1, 1, -1, 1, 1, 4, 1, -1, 1] Max seen :[1, 1, 1, 1, 9, 1, 2, 1, 1, 0, 1, 2, 1]
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 22 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 750 transition count 1332
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 162 place count 670 transition count 1332
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 162 place count 670 transition count 1252
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 322 place count 590 transition count 1252
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 2 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 480 place count 511 transition count 1173
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 490 place count 511 transition count 1163
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 500 place count 501 transition count 1163
Applied a total of 500 rules in 210 ms. Remains 501 /752 variables (removed 251) and now considering 1163/1412 (removed 249) transitions.
[2023-03-23 11:44:11] [INFO ] Flow matrix only has 1143 transitions (discarded 20 similar events)
// Phase 1: matrix 1143 rows 501 cols
[2023-03-23 11:44:11] [INFO ] Computed 52 place invariants in 29 ms
[2023-03-23 11:44:12] [INFO ] Dead Transitions using invariants and state equation in 976 ms found 110 transitions.
Found 110 dead transitions using SMT.
Drop transitions removed 110 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 110 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 501/752 places, 1053/1412 transitions.
Reduce places removed 1 places and 20 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 500 transition count 1033
Reduce places removed 20 places and 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 21 place count 480 transition count 1013
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 21 rules in 38 ms. Remains 480 /501 variables (removed 21) and now considering 1013/1053 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1226 ms. Remains : 480/752 places, 1013/1412 transitions.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 993 out of 1013 initially.
// Phase 1: matrix 993 rows 479 cols
[2023-03-23 11:44:12] [INFO ] Computed 52 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 325 resets, run finished after 5150 ms. (steps per millisecond=194 ) properties (out of 3) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2015 ms. (steps per millisecond=496 ) properties (out of 3) seen :13
Incomplete Best-First random walk after 1000001 steps, including 105 resets, run finished after 2380 ms. (steps per millisecond=420 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 1000000 steps, including 110 resets, run finished after 2238 ms. (steps per millisecond=446 ) properties (out of 3) seen :9
[2023-03-23 11:44:24] [INFO ] Flow matrix only has 993 transitions (discarded 20 similar events)
// Phase 1: matrix 993 rows 479 cols
[2023-03-23 11:44:24] [INFO ] Computed 52 place invariants in 16 ms
[2023-03-23 11:44:24] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2023-03-23 11:44:24] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 16 ms returned sat
[2023-03-23 11:44:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 11:44:25] [INFO ] [Real]Absence check using state equation in 1311 ms returned sat
[2023-03-23 11:44:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 11:44:25] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-23 11:44:25] [INFO ] [Nat]Absence check using 14 positive and 38 generalized place invariants in 18 ms returned sat
[2023-03-23 11:44:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 11:44:27] [INFO ] [Nat]Absence check using state equation in 2027 ms returned sat
[2023-03-23 11:44:27] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 11:44:29] [INFO ] [Nat]Added 120 Read/Feed constraints in 1475 ms returned sat
[2023-03-23 11:44:29] [INFO ] Deduced a trap composed of 59 places in 177 ms of which 2 ms to minimize.
[2023-03-23 11:44:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 212 ms
[2023-03-23 11:44:29] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-23 11:44:29] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 18 ms returned unsat
[2023-03-23 11:44:29] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-23 11:44:29] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 12 ms returned unsat
Current structural bounds on expressions (after SMT) : [9, 2, 2, -1] Max seen :[9, 2, 2, 2]
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-04 9 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 46137 ms.
ITS solved all properties within timeout

BK_STOP 1679571870401

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="PolyORBLF-PT-S02J04T10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is PolyORBLF-PT-S02J04T10, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r298-tall-167873951800509"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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