Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162089128200603.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r140-tall-162089128200603
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 79K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 360K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 52K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 257K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.4K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Mar 27 06:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 27 06:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Mar 25 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Mar 25 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 100K May 5 16:51 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 1621018757094

Running Version 0
[2021-05-14 18:59:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 18:59:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 18:59:22] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2021-05-14 18:59:22] [INFO ] Transformed 102 places.
[2021-05-14 18:59:22] [INFO ] Transformed 126 transitions.
[2021-05-14 18:59:22] [INFO ] Found NUPN structural information;
[2021-05-14 18:59:22] [INFO ] Parsed PT model containing 102 places and 126 transitions in 132 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
FORMULA Peterson-PT-2-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 120 out of 126 initially.
// Phase 1: matrix 120 rows 102 cols
[2021-05-14 18:59:22] [INFO ] Computed 11 place invariants in 14 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 15) seen :23
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-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-2-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :17
[2021-05-14 18:59:23] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2021-05-14 18:59:23] [INFO ] Computed 11 place invariants in 8 ms
[2021-05-14 18:59:23] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned unsat
[2021-05-14 18:59:23] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-14 18:59:23] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 18:59:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:59:23] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2021-05-14 18:59:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:59:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-14 18:59:23] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-14 18:59:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:59:23] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2021-05-14 18:59:23] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-14 18:59:23] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 18:59:23] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 3 ms to minimize.
[2021-05-14 18:59:23] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2021-05-14 18:59:23] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2021-05-14 18:59:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 170 ms
[2021-05-14 18:59:23] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned unsat
[2021-05-14 18:59:23] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-14 18:59:23] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-14 18:59:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:59:23] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2021-05-14 18:59:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:59:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-14 18:59:23] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 18:59:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:59:23] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2021-05-14 18:59:23] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 18:59:23] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2021-05-14 18:59:23] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2021-05-14 18:59:23] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2021-05-14 18:59:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 102 ms
[2021-05-14 18:59:23] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-14 18:59:23] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 18:59:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:59:23] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2021-05-14 18:59:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:59:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-14 18:59:23] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-14 18:59:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:59:23] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2021-05-14 18:59:23] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 18:59:24] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2021-05-14 18:59:24] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2021-05-14 18:59:24] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 0 ms to minimize.
[2021-05-14 18:59:24] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2021-05-14 18:59:24] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2021-05-14 18:59:24] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2021-05-14 18:59:24] [INFO ] Deduced a trap composed of 29 places in 23 ms of which 0 ms to minimize.
[2021-05-14 18:59:24] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 1 ms to minimize.
[2021-05-14 18:59:24] [INFO ] Deduced a trap composed of 22 places in 17 ms of which 0 ms to minimize.
[2021-05-14 18:59:24] [INFO ] Deduced a trap composed of 29 places in 18 ms of which 0 ms to minimize.
[2021-05-14 18:59:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 296 ms
[2021-05-14 18:59:24] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned unsat
[2021-05-14 18:59:24] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned unsat
[2021-05-14 18:59:24] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned unsat
[2021-05-14 18:59:24] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-14 18:59:24] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-14 18:59:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:59:24] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-14 18:59:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:59:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-14 18:59:24] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-14 18:59:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:59:24] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2021-05-14 18:59:24] [INFO ] [Nat]Added 26 Read/Feed constraints in 2 ms returned sat
[2021-05-14 18:59:24] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2021-05-14 18:59:24] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2021-05-14 18:59:24] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2021-05-14 18:59:24] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2021-05-14 18:59:24] [INFO ] Deduced a trap composed of 26 places in 20 ms of which 1 ms to minimize.
[2021-05-14 18:59:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 158 ms
[2021-05-14 18:59:24] [INFO ] Computed and/alt/rep : 111/188/111 causal constraints (skipped 6 transitions) in 8 ms.
[2021-05-14 18:59:24] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
[2021-05-14 18:59:24] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2021-05-14 18:59:24] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
[2021-05-14 18:59:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 101 ms
[2021-05-14 18:59:24] [INFO ] Added : 97 causal constraints over 20 iterations in 280 ms. Result :sat
Minimization took 29 ms.
[2021-05-14 18:59:24] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-14 18:59:24] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-14 18:59:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:59:25] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2021-05-14 18:59:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:59:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-14 18:59:25] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-14 18:59:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:59:25] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2021-05-14 18:59:25] [INFO ] [Nat]Added 26 Read/Feed constraints in 2 ms returned sat
[2021-05-14 18:59:25] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2021-05-14 18:59:25] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2021-05-14 18:59:25] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2021-05-14 18:59:25] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2021-05-14 18:59:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 134 ms
[2021-05-14 18:59:25] [INFO ] Computed and/alt/rep : 111/188/111 causal constraints (skipped 6 transitions) in 7 ms.
[2021-05-14 18:59:25] [INFO ] Deduced a trap composed of 25 places in 20 ms of which 0 ms to minimize.
[2021-05-14 18:59:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2021-05-14 18:59:25] [INFO ] Added : 98 causal constraints over 20 iterations in 215 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [3, 2, 3, 2, 1, 3, 3, 3, 1, 1] Max seen :[3, 2, 3, 2, 1, 3, 3, 3, 0, 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 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-2-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-2-UpperBounds-03 2 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 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-2-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 17800 steps, including 614 resets, run finished after 67 ms. (steps per millisecond=265 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 19400 steps, including 617 resets, run finished after 61 ms. (steps per millisecond=318 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 102 transition count 93
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 69 transition count 93
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 66 place count 69 transition count 74
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 104 place count 50 transition count 74
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 114 place count 45 transition count 69
Applied a total of 114 rules in 20 ms. Remains 45 /102 variables (removed 57) and now considering 69/126 (removed 57) transitions.
Finished structural reductions, in 1 iterations. Remains : 45/102 places, 69/126 transitions.
Normalized transition count is 63 out of 69 initially.
// Phase 1: matrix 63 rows 45 cols
[2021-05-14 18:59:25] [INFO ] Computed 11 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1703 ms. (steps per millisecond=587 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 543 ms. (steps per millisecond=1841 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 535 ms. (steps per millisecond=1869 ) properties (out of 2) seen :0
[2021-05-14 18:59:28] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
// Phase 1: matrix 63 rows 45 cols
[2021-05-14 18:59:28] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-14 18:59:28] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-14 18:59:28] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-14 18:59:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:59:28] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-14 18:59:28] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-14 18:59:28] [INFO ] [Real]Added 26 Read/Feed constraints in 8 ms returned sat
[2021-05-14 18:59:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:59:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-14 18:59:28] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 18:59:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:59:28] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-14 18:59:28] [INFO ] [Nat]Added 26 Read/Feed constraints in 2 ms returned sat
[2021-05-14 18:59:28] [INFO ] Deduced a trap composed of 11 places in 13 ms of which 1 ms to minimize.
[2021-05-14 18:59:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[2021-05-14 18:59:28] [INFO ] Computed and/alt/rep : 54/137/54 causal constraints (skipped 6 transitions) in 11 ms.
[2021-05-14 18:59:28] [INFO ] Deduced a trap composed of 10 places in 15 ms of which 0 ms to minimize.
[2021-05-14 18:59:28] [INFO ] Deduced a trap composed of 7 places in 11 ms of which 1 ms to minimize.
[2021-05-14 18:59:28] [INFO ] Deduced a trap composed of 6 places in 11 ms of which 0 ms to minimize.
[2021-05-14 18:59:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 54 ms
[2021-05-14 18:59:28] [INFO ] Added : 34 causal constraints over 7 iterations in 105 ms. Result :sat
Minimization took 14 ms.
[2021-05-14 18:59:28] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-14 18:59:28] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 18:59:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:59:28] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-14 18:59:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:59:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-14 18:59:28] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-14 18:59:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:59:28] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-14 18:59:28] [INFO ] [Nat]Added 26 Read/Feed constraints in 2 ms returned sat
[2021-05-14 18:59:28] [INFO ] Deduced a trap composed of 7 places in 13 ms of which 0 ms to minimize.
[2021-05-14 18:59:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[2021-05-14 18:59:28] [INFO ] Computed and/alt/rep : 54/137/54 causal constraints (skipped 6 transitions) in 4 ms.
[2021-05-14 18:59:28] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 4 ms to minimize.
[2021-05-14 18:59:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2021-05-14 18:59:28] [INFO ] Added : 44 causal constraints over 10 iterations in 73 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 4800 steps, including 248 resets, run finished after 12 ms. (steps per millisecond=400 ) properties (out of 2) seen :2 could not realise parikh vector
FORMULA Peterson-PT-2-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-2-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621018780024

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="itstools"
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-4028"
echo " Executing tool itstools"
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 r140-tall-162089128200603"
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 ;