Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r175-tall-165277023800038.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-PT-3, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-tall-165277023800038
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 44K Apr 30 09:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 212K Apr 30 09:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 34K Apr 30 09:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 169K Apr 30 09:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 19K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.6K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 143K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1652803285620

Running Version 202205111006
[2022-05-17 16:01:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -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, 1800]
[2022-05-17 16:01:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 16:01:26] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2022-05-17 16:01:26] [INFO ] Transformed 244 places.
[2022-05-17 16:01:26] [INFO ] Transformed 332 transitions.
[2022-05-17 16:01:26] [INFO ] Found NUPN structural information;
[2022-05-17 16:01:26] [INFO ] Completing missing partition info from NUPN : creating a component with [TestAlone_1_2_3, TestAlone_2_2_3]
[2022-05-17 16:01:26] [INFO ] Parsed PT model containing 244 places and 332 transitions in 208 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 537 ms. (steps per millisecond=18 ) properties (out of 244) seen :143
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 101) seen :0
Running SMT prover for 101 properties.
[2022-05-17 16:01:27] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2022-05-17 16:01:27] [INFO ] Computed 15 place invariants in 15 ms
[2022-05-17 16:01:28] [INFO ] After 739ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:101
[2022-05-17 16:01:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2022-05-17 16:01:28] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-17 16:01:30] [INFO ] After 1101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :101
[2022-05-17 16:01:30] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-17 16:01:31] [INFO ] After 1194ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :101
[2022-05-17 16:01:31] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 5 ms to minimize.
[2022-05-17 16:01:31] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:01:31] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:01:32] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:01:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 443 ms
[2022-05-17 16:01:32] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 0 ms to minimize.
[2022-05-17 16:01:32] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 0 ms to minimize.
[2022-05-17 16:01:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 142 ms
[2022-05-17 16:01:32] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:01:32] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2022-05-17 16:01:32] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 0 ms to minimize.
[2022-05-17 16:01:32] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:01:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 357 ms
[2022-05-17 16:01:32] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2022-05-17 16:01:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2022-05-17 16:01:32] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:01:32] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:01:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 189 ms
[2022-05-17 16:01:33] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:01:33] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:01:33] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:01:33] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:01:33] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 0 ms to minimize.
[2022-05-17 16:01:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 429 ms
[2022-05-17 16:01:33] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:01:33] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2022-05-17 16:01:33] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 0 ms to minimize.
[2022-05-17 16:01:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 221 ms
[2022-05-17 16:01:33] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:01:33] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2022-05-17 16:01:33] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2022-05-17 16:01:33] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 0 ms to minimize.
[2022-05-17 16:01:34] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2022-05-17 16:01:34] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 0 ms to minimize.
[2022-05-17 16:01:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 436 ms
[2022-05-17 16:01:34] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:01:34] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:01:34] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 0 ms to minimize.
[2022-05-17 16:01:34] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 1 ms to minimize.
[2022-05-17 16:01:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 325 ms
[2022-05-17 16:01:34] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:01:34] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2022-05-17 16:01:34] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:01:34] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:01:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 329 ms
[2022-05-17 16:01:35] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2022-05-17 16:01:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2022-05-17 16:01:35] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:01:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2022-05-17 16:01:35] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:01:35] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 0 ms to minimize.
[2022-05-17 16:01:35] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 1 ms to minimize.
[2022-05-17 16:01:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 215 ms
[2022-05-17 16:01:35] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 0 ms to minimize.
[2022-05-17 16:01:35] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 0 ms to minimize.
[2022-05-17 16:01:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 143 ms
[2022-05-17 16:01:35] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:01:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2022-05-17 16:01:35] [INFO ] Deduced a trap composed of 80 places in 53 ms of which 1 ms to minimize.
[2022-05-17 16:01:35] [INFO ] Deduced a trap composed of 97 places in 53 ms of which 1 ms to minimize.
[2022-05-17 16:01:36] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:01:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 252 ms
[2022-05-17 16:01:36] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2022-05-17 16:01:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2022-05-17 16:01:36] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 0 ms to minimize.
[2022-05-17 16:01:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2022-05-17 16:01:37] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 0 ms to minimize.
[2022-05-17 16:01:37] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 0 ms to minimize.
[2022-05-17 16:01:37] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 1 ms to minimize.
[2022-05-17 16:01:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 199 ms
[2022-05-17 16:01:37] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2022-05-17 16:01:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2022-05-17 16:01:37] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 0 ms to minimize.
[2022-05-17 16:01:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2022-05-17 16:01:38] [INFO ] After 7897ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :101
Attempting to minimize the solution found.
Minimization took 1585 ms.
[2022-05-17 16:01:39] [INFO ] After 11485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :101
Parikh walk visited 50 properties in 3332 ms.
Support contains 51 out of 244 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 244 transition count 263
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 138 place count 175 transition count 263
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 138 place count 175 transition count 224
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 216 place count 136 transition count 224
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 228 place count 130 transition count 218
Applied a total of 228 rules in 40 ms. Remains 130 /244 variables (removed 114) and now considering 218/332 (removed 114) transitions.
Finished structural reductions, in 1 iterations. Remains : 130/244 places, 218/332 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 29691 ms. (steps per millisecond=33 ) properties (out of 51) seen :8
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 758 ms. (steps per millisecond=131 ) properties (out of 43) seen :4
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 598 ms. (steps per millisecond=167 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 596 ms. (steps per millisecond=167 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 623 ms. (steps per millisecond=160 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 634 ms. (steps per millisecond=157 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 627 ms. (steps per millisecond=159 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 622 ms. (steps per millisecond=160 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 569 ms. (steps per millisecond=175 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 559 ms. (steps per millisecond=178 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 574 ms. (steps per millisecond=174 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 548 ms. (steps per millisecond=182 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 579 ms. (steps per millisecond=172 ) properties (out of 39) seen :4
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 584 ms. (steps per millisecond=171 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 583 ms. (steps per millisecond=171 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 583 ms. (steps per millisecond=171 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 585 ms. (steps per millisecond=170 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 602 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 632 ms. (steps per millisecond=158 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 648 ms. (steps per millisecond=154 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 642 ms. (steps per millisecond=155 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 619 ms. (steps per millisecond=161 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 621 ms. (steps per millisecond=161 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 621 ms. (steps per millisecond=161 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 637 ms. (steps per millisecond=156 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 616 ms. (steps per millisecond=162 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 616 ms. (steps per millisecond=162 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 631 ms. (steps per millisecond=158 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 640 ms. (steps per millisecond=156 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 652 ms. (steps per millisecond=153 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 628 ms. (steps per millisecond=159 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 624 ms. (steps per millisecond=160 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 596 ms. (steps per millisecond=167 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 579 ms. (steps per millisecond=172 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 548 ms. (steps per millisecond=182 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 580 ms. (steps per millisecond=172 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 513 ms. (steps per millisecond=194 ) properties (out of 35) seen :0
Running SMT prover for 35 properties.
[2022-05-17 16:02:34] [INFO ] Flow matrix only has 194 transitions (discarded 24 similar events)
// Phase 1: matrix 194 rows 130 cols
[2022-05-17 16:02:34] [INFO ] Computed 15 place invariants in 2 ms
[2022-05-17 16:02:34] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:35
[2022-05-17 16:02:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-17 16:02:35] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-17 16:02:35] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :35
[2022-05-17 16:02:35] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-17 16:02:35] [INFO ] After 234ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :35
[2022-05-17 16:02:35] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2022-05-17 16:02:35] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2022-05-17 16:02:35] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 5 ms to minimize.
[2022-05-17 16:02:35] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2022-05-17 16:02:35] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2022-05-17 16:02:35] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2022-05-17 16:02:36] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2022-05-17 16:02:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 387 ms
[2022-05-17 16:02:36] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2022-05-17 16:02:36] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 0 ms to minimize.
[2022-05-17 16:02:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 99 ms
[2022-05-17 16:02:36] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2022-05-17 16:02:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2022-05-17 16:02:36] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2022-05-17 16:02:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2022-05-17 16:02:36] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2022-05-17 16:02:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2022-05-17 16:02:36] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2022-05-17 16:02:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2022-05-17 16:02:36] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2022-05-17 16:02:36] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 4 ms to minimize.
[2022-05-17 16:02:36] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2022-05-17 16:02:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 145 ms
[2022-05-17 16:02:36] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2022-05-17 16:02:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2022-05-17 16:02:37] [INFO ] After 1586ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :35
Attempting to minimize the solution found.
Minimization took 284 ms.
[2022-05-17 16:02:37] [INFO ] After 2315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :35
Parikh walk visited 8 properties in 418 ms.
Support contains 27 out of 130 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 130/130 places, 218/218 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 130 transition count 205
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 117 transition count 205
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 26 place count 117 transition count 200
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 36 place count 112 transition count 200
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 111 transition count 199
Applied a total of 38 rules in 13 ms. Remains 111 /130 variables (removed 19) and now considering 199/218 (removed 19) transitions.
Finished structural reductions, in 1 iterations. Remains : 111/130 places, 199/218 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 26199 ms. (steps per millisecond=38 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 563 ms. (steps per millisecond=177 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 535 ms. (steps per millisecond=186 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 548 ms. (steps per millisecond=182 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 584 ms. (steps per millisecond=171 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 551 ms. (steps per millisecond=181 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 556 ms. (steps per millisecond=179 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 481 ms. (steps per millisecond=207 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 562 ms. (steps per millisecond=177 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 565 ms. (steps per millisecond=176 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 584 ms. (steps per millisecond=171 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 545 ms. (steps per millisecond=183 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 539 ms. (steps per millisecond=185 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 565 ms. (steps per millisecond=176 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 583 ms. (steps per millisecond=171 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 549 ms. (steps per millisecond=182 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 571 ms. (steps per millisecond=175 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 544 ms. (steps per millisecond=183 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 553 ms. (steps per millisecond=180 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 557 ms. (steps per millisecond=179 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 537 ms. (steps per millisecond=186 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 522 ms. (steps per millisecond=191 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 546 ms. (steps per millisecond=183 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 541 ms. (steps per millisecond=184 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 577 ms. (steps per millisecond=173 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 523 ms. (steps per millisecond=191 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 529 ms. (steps per millisecond=189 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 533 ms. (steps per millisecond=187 ) properties (out of 27) seen :0
Finished probabilistic random walk after 180725 steps, run visited all 27 properties in 1109 ms. (steps per millisecond=162 )
Probabilistic random walk after 180725 steps, saw 36262 distinct states, run finished after 1110 ms. (steps per millisecond=162 ) properties seen :27
Able to resolve query StableMarking after proving 244 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 113134 ms.

BK_STOP 1652803399923

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination StableMarking -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 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-3"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-3, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r175-tall-165277023800038"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-3.tgz
mv Peterson-PT-3 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;