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.r265-smll-167863540300605.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is Peterson-PT-2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863540300605
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 13K Feb 25 22:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 22:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Feb 25 22:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 124K Feb 25 22:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Feb 25 22:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Feb 25 22:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 33K Feb 25 22:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 185K Feb 25 22:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 100K 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 Peterson-PT-2-UpperBounds-00
FORMULA_NAME Peterson-PT-2-UpperBounds-01
FORMULA_NAME Peterson-PT-2-UpperBounds-02
FORMULA_NAME Peterson-PT-2-UpperBounds-03
FORMULA_NAME Peterson-PT-2-UpperBounds-04
FORMULA_NAME Peterson-PT-2-UpperBounds-05
FORMULA_NAME Peterson-PT-2-UpperBounds-06
FORMULA_NAME Peterson-PT-2-UpperBounds-07
FORMULA_NAME Peterson-PT-2-UpperBounds-08
FORMULA_NAME Peterson-PT-2-UpperBounds-09
FORMULA_NAME Peterson-PT-2-UpperBounds-10
FORMULA_NAME Peterson-PT-2-UpperBounds-11
FORMULA_NAME Peterson-PT-2-UpperBounds-12
FORMULA_NAME Peterson-PT-2-UpperBounds-13
FORMULA_NAME Peterson-PT-2-UpperBounds-14
FORMULA_NAME Peterson-PT-2-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679131828314

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-2
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 09:30:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-18 09:30:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 09:30:31] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2023-03-18 09:30:31] [INFO ] Transformed 102 places.
[2023-03-18 09:30:31] [INFO ] Transformed 126 transitions.
[2023-03-18 09:30:31] [INFO ] Found NUPN structural information;
[2023-03-18 09:30:31] [INFO ] Parsed PT model containing 102 places and 126 transitions and 384 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
FORMULA Peterson-PT-2-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 120 out of 126 initially.
// Phase 1: matrix 120 rows 102 cols
[2023-03-18 09:30:31] [INFO ] Computed 11 place invariants in 16 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 14) seen :22
FORMULA Peterson-PT-2-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-2-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-2-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-2-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-2-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :17
[2023-03-18 09:30:31] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2023-03-18 09:30:31] [INFO ] Computed 11 place invariants in 8 ms
[2023-03-18 09:30:31] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-18 09:30:31] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 09:30:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 09:30:31] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2023-03-18 09:30:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 09:30:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 09:30:32] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 09:30:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 09:30:32] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-18 09:30:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-18 09:30:32] [INFO ] [Nat]Added 22 Read/Feed constraints in 9 ms returned sat
[2023-03-18 09:30:32] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 3 ms to minimize.
[2023-03-18 09:30:32] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2023-03-18 09:30:32] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2023-03-18 09:30:32] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 2 ms to minimize.
[2023-03-18 09:30:32] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2023-03-18 09:30:32] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2023-03-18 09:30:32] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2023-03-18 09:30:32] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2023-03-18 09:30:32] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2023-03-18 09:30:32] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2023-03-18 09:30:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 713 ms
[2023-03-18 09:30:33] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned unsat
[2023-03-18 09:30:33] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned unsat
[2023-03-18 09:30:33] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 09:30:33] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 09:30:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 09:30:33] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-18 09:30:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 09:30:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 09:30:33] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 09:30:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 09:30:33] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-18 09:30:33] [INFO ] [Nat]Added 22 Read/Feed constraints in 5 ms returned sat
[2023-03-18 09:30:33] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2023-03-18 09:30:33] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2023-03-18 09:30:33] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2023-03-18 09:30:33] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2023-03-18 09:30:33] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2023-03-18 09:30:33] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2023-03-18 09:30:33] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2023-03-18 09:30:33] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2023-03-18 09:30:33] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2023-03-18 09:30:33] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2023-03-18 09:30:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 535 ms
[2023-03-18 09:30:33] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned unsat
[2023-03-18 09:30:33] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 09:30:33] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 09:30:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 09:30:33] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-18 09:30:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 09:30:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-18 09:30:34] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 09:30:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 09:30:34] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-18 09:30:34] [INFO ] [Nat]Added 22 Read/Feed constraints in 6 ms returned sat
[2023-03-18 09:30:34] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2023-03-18 09:30:34] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2023-03-18 09:30:34] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2023-03-18 09:30:34] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2023-03-18 09:30:34] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2023-03-18 09:30:34] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2023-03-18 09:30:34] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2023-03-18 09:30:34] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2023-03-18 09:30:34] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
[2023-03-18 09:30:34] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2023-03-18 09:30:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 497 ms
[2023-03-18 09:30:34] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned unsat
[2023-03-18 09:30:34] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned unsat
[2023-03-18 09:30:34] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 09:30:34] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 09:30:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 09:30:34] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-18 09:30:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 09:30:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 09:30:34] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 09:30:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 09:30:34] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-18 09:30:34] [INFO ] [Nat]Added 22 Read/Feed constraints in 4 ms returned sat
[2023-03-18 09:30:34] [INFO ] Computed and/alt/rep : 111/188/111 causal constraints (skipped 6 transitions) in 10 ms.
[2023-03-18 09:30:35] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2023-03-18 09:30:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-18 09:30:35] [INFO ] Added : 53 causal constraints over 11 iterations in 215 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [1, 3, 3, 1, 3, 1, 3, 3, 1] Max seen :[1, 3, 3, 1, 3, 1, 3, 3, 0]
FORMULA Peterson-PT-2-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-2-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-2-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-2-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-2-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-2-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-2-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-2-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 102 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 125/125 transitions.
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 36 rules applied. Total rules applied 36 place count 102 transition count 89
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 66 transition count 89
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 72 place count 66 transition count 71
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 108 place count 48 transition count 71
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 118 place count 43 transition count 66
Applied a total of 118 rules in 27 ms. Remains 43 /102 variables (removed 59) and now considering 66/125 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 43/102 places, 66/125 transitions.
Normalized transition count is 60 out of 66 initially.
// Phase 1: matrix 60 rows 43 cols
[2023-03-18 09:30:35] [INFO ] Computed 11 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 941 ms. (steps per millisecond=1062 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 370 ms. (steps per millisecond=2702 ) properties (out of 1) seen :0
[2023-03-18 09:30:36] [INFO ] Flow matrix only has 60 transitions (discarded 6 similar events)
// Phase 1: matrix 60 rows 43 cols
[2023-03-18 09:30:36] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-18 09:30:36] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 09:30:36] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 09:30:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 09:30:36] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-18 09:30:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 09:30:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 09:30:36] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 09:30:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 09:30:36] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-18 09:30:36] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-18 09:30:36] [INFO ] [Nat]Added 22 Read/Feed constraints in 3 ms returned sat
[2023-03-18 09:30:36] [INFO ] Computed and/alt/rep : 51/131/51 causal constraints (skipped 6 transitions) in 11 ms.
[2023-03-18 09:30:36] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2023-03-18 09:30:36] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2023-03-18 09:30:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 79 ms
[2023-03-18 09:30:36] [INFO ] Added : 41 causal constraints over 10 iterations in 172 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 66/66 transitions.
Applied a total of 0 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 43/43 places, 66/66 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 66/66 transitions.
Applied a total of 0 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2023-03-18 09:30:36] [INFO ] Flow matrix only has 60 transitions (discarded 6 similar events)
[2023-03-18 09:30:36] [INFO ] Invariant cache hit.
[2023-03-18 09:30:36] [INFO ] Implicit Places using invariants in 67 ms returned [32, 34, 35]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 69 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 40/43 places, 66/66 transitions.
Applied a total of 0 rules in 3 ms. Remains 40 /40 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 76 ms. Remains : 40/43 places, 66/66 transitions.
Normalized transition count is 60 out of 66 initially.
// Phase 1: matrix 60 rows 40 cols
[2023-03-18 09:30:36] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 837 ms. (steps per millisecond=1194 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 343 ms. (steps per millisecond=2915 ) properties (out of 1) seen :0
[2023-03-18 09:30:38] [INFO ] Flow matrix only has 60 transitions (discarded 6 similar events)
// Phase 1: matrix 60 rows 40 cols
[2023-03-18 09:30:38] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-18 09:30:38] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 09:30:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 09:30:38] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-18 09:30:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 09:30:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 09:30:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 09:30:38] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-18 09:30:38] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-18 09:30:38] [INFO ] [Nat]Added 22 Read/Feed constraints in 4 ms returned sat
[2023-03-18 09:30:38] [INFO ] Computed and/alt/rep : 51/131/51 causal constraints (skipped 6 transitions) in 6 ms.
[2023-03-18 09:30:38] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 2 ms to minimize.
[2023-03-18 09:30:38] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2023-03-18 09:30:38] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2023-03-18 09:30:38] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2023-03-18 09:30:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 134 ms
[2023-03-18 09:30:38] [INFO ] Added : 36 causal constraints over 8 iterations in 208 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
FORMULA Peterson-PT-2-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 7398 ms.
ITS solved all properties within timeout

BK_STOP 1679131839562

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is Peterson-PT-2, 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 r265-smll-167863540300605"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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