Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r193-tajo-165281577000123.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-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 RERS17pb115-PT-7, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-tajo-165281577000123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 8.0K Apr 30 06:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 30 06:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 30 06:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K Apr 30 06:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 9 08:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 69M 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 1653139552893

Running Version 202205111006
[2022-05-21 13:25:54] [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-21 13:25:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 13:25:56] [INFO ] Load time of PNML (sax parser for PT used): 2285 ms
[2022-05-21 13:25:56] [INFO ] Transformed 1399 places.
[2022-05-21 13:25:57] [INFO ] Transformed 144369 transitions.
[2022-05-21 13:25:57] [INFO ] Parsed PT model containing 1399 places and 144369 transitions in 3025 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2193 ms. (steps per millisecond=4 ) properties (out of 1399) seen :948
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=4 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=5 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=5 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=5 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=5 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=5 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=5 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=5 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=5 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=5 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=5 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=4 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=5 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=5 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=4 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=5 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=5 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=5 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=4 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=5 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=5 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=5 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=2 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=3 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=3 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=4 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=4 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=4 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=4 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=4 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=4 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=4 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=4 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=4 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=4 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=4 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=4 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=4 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=4 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=4 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=3 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=4 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=4 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=5 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=4 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=4 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=4 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=4 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=4 ) properties (out of 451) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=5 ) properties (out of 451) seen :0
Running SMT prover for 451 properties.
[2022-05-21 13:26:02] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1399 cols
[2022-05-21 13:26:02] [INFO ] Computed 37 place invariants in 585 ms
[2022-05-21 13:26:11] [INFO ] After 8941ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:451
[2022-05-21 13:26:18] [INFO ] [Nat]Absence check using 19 positive place invariants in 31 ms returned sat
[2022-05-21 13:26:18] [INFO ] [Nat]Absence check using 19 positive and 18 generalized place invariants in 4 ms returned sat
[2022-05-21 13:26:36] [INFO ] After 12781ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :450
[2022-05-21 13:26:39] [INFO ] State equation strengthened by 2277 read => feed constraints.
[2022-05-21 13:26:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-21 13:26:39] [INFO ] After 27518ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:451
Fused 451 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 451 out of 1399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1399/1399 places, 144369/144369 transitions.
Ensure Unique test removed 18 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 1381 transition count 144369
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 1380 transition count 144368
Applied a total of 19 rules in 3803 ms. Remains 1380 /1399 variables (removed 19) and now considering 144368/144369 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 1380/1399 places, 144368/144369 transitions.
Interrupted random walk after 171409 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=5 ) properties seen 423
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 494 ms. (steps per millisecond=202 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 494 ms. (steps per millisecond=202 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 494 ms. (steps per millisecond=202 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 503 ms. (steps per millisecond=198 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 512 ms. (steps per millisecond=195 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 520 ms. (steps per millisecond=192 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 514 ms. (steps per millisecond=194 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 503 ms. (steps per millisecond=198 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 484 ms. (steps per millisecond=206 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 527 ms. (steps per millisecond=189 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 493 ms. (steps per millisecond=202 ) properties (out of 28) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 502 ms. (steps per millisecond=199 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 490 ms. (steps per millisecond=204 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 550 ms. (steps per millisecond=181 ) properties (out of 27) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 583 ms. (steps per millisecond=171 ) properties (out of 26) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 494 ms. (steps per millisecond=202 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 505 ms. (steps per millisecond=198 ) properties (out of 25) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 496 ms. (steps per millisecond=201 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 536 ms. (steps per millisecond=186 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 555 ms. (steps per millisecond=180 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 499 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 487 ms. (steps per millisecond=205 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 476 ms. (steps per millisecond=210 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 471 ms. (steps per millisecond=212 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 494 ms. (steps per millisecond=202 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 496 ms. (steps per millisecond=201 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
[2022-05-21 13:27:27] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2022-05-21 13:27:27] [INFO ] Computed 19 place invariants in 298 ms
[2022-05-21 13:27:27] [INFO ] After 554ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2022-05-21 13:27:28] [INFO ] [Nat]Absence check using 19 positive place invariants in 29 ms returned sat
[2022-05-21 13:28:16] [INFO ] After 47918ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2022-05-21 13:28:17] [INFO ] State equation strengthened by 741 read => feed constraints.
[2022-05-21 13:28:56] [INFO ] After 39330ms SMT Verify possible using 741 Read/Feed constraints in natural domain returned unsat :0 sat :22
[2022-05-21 13:29:04] [INFO ] Deduced a trap composed of 40 places in 5939 ms of which 10 ms to minimize.
[2022-05-21 13:29:10] [INFO ] Deduced a trap composed of 72 places in 5308 ms of which 1 ms to minimize.
[2022-05-21 13:29:16] [INFO ] Deduced a trap composed of 48 places in 4450 ms of which 1 ms to minimize.
[2022-05-21 13:29:21] [INFO ] Deduced a trap composed of 128 places in 3933 ms of which 2 ms to minimize.
[2022-05-21 13:29:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 29563 ms
[2022-05-21 13:31:14] [INFO ] After 176894ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :22
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-05-21 13:31:14] [INFO ] After 226295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :22
Fused 22 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 22 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 1442 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1380/1380 places, 144368/144368 transitions.
Interrupted random walk after 175783 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=5 ) properties seen 14
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4537 ms. (steps per millisecond=220 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4931 ms. (steps per millisecond=202 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3818 ms. (steps per millisecond=261 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3706 ms. (steps per millisecond=269 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3595 ms. (steps per millisecond=278 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-05-21 13:32:06] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2022-05-21 13:32:06] [INFO ] Computed 19 place invariants in 293 ms
[2022-05-21 13:32:07] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-21 13:32:07] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2022-05-21 13:32:34] [INFO ] After 26556ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-21 13:32:35] [INFO ] State equation strengthened by 741 read => feed constraints.
[2022-05-21 13:32:49] [INFO ] After 14133ms SMT Verify possible using 741 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-21 13:32:59] [INFO ] Deduced a trap composed of 128 places in 8408 ms of which 2 ms to minimize.
[2022-05-21 13:33:07] [INFO ] Deduced a trap composed of 34 places in 6521 ms of which 1 ms to minimize.
[2022-05-21 13:33:15] [INFO ] Deduced a trap composed of 128 places in 6495 ms of which 2 ms to minimize.
[2022-05-21 13:33:22] [INFO ] Deduced a trap composed of 48 places in 5929 ms of which 2 ms to minimize.
[2022-05-21 13:33:28] [INFO ] Deduced a trap composed of 128 places in 5420 ms of which 1 ms to minimize.
[2022-05-21 13:33:35] [INFO ] Deduced a trap composed of 72 places in 4933 ms of which 1 ms to minimize.
[2022-05-21 13:33:41] [INFO ] Deduced a trap composed of 40 places in 4714 ms of which 0 ms to minimize.
[2022-05-21 13:33:46] [INFO ] Deduced a trap composed of 72 places in 4382 ms of which 0 ms to minimize.
[2022-05-21 13:33:51] [INFO ] Deduced a trap composed of 96 places in 3813 ms of which 12 ms to minimize.
[2022-05-21 13:33:56] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 66563 ms
[2022-05-21 13:34:18] [INFO ] After 102594ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 8597 ms.
[2022-05-21 13:34:26] [INFO ] After 139487ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 1347 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1380/1380 places, 144368/144368 transitions.
Interrupted random walk after 241102 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3784 ms. (steps per millisecond=264 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3575 ms. (steps per millisecond=279 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3506 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-21 13:35:09] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2022-05-21 13:35:09] [INFO ] Computed 19 place invariants in 244 ms
[2022-05-21 13:35:09] [INFO ] After 237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-21 13:35:10] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2022-05-21 13:35:32] [INFO ] After 22577ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-21 13:35:33] [INFO ] State equation strengthened by 741 read => feed constraints.
[2022-05-21 13:35:43] [INFO ] After 10148ms SMT Verify possible using 741 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-21 13:35:55] [INFO ] Deduced a trap composed of 128 places in 10728 ms of which 1 ms to minimize.
[2022-05-21 13:36:03] [INFO ] Deduced a trap composed of 34 places in 6836 ms of which 1 ms to minimize.
[2022-05-21 13:36:11] [INFO ] Deduced a trap composed of 128 places in 6621 ms of which 1 ms to minimize.
[2022-05-21 13:36:19] [INFO ] Deduced a trap composed of 48 places in 6194 ms of which 0 ms to minimize.
[2022-05-21 13:36:26] [INFO ] Deduced a trap composed of 128 places in 5824 ms of which 1 ms to minimize.
[2022-05-21 13:36:32] [INFO ] Deduced a trap composed of 72 places in 5438 ms of which 0 ms to minimize.
[2022-05-21 13:36:39] [INFO ] Deduced a trap composed of 40 places in 5066 ms of which 3 ms to minimize.
[2022-05-21 13:36:45] [INFO ] Deduced a trap composed of 72 places in 4608 ms of which 1 ms to minimize.
[2022-05-21 13:36:50] [INFO ] Deduced a trap composed of 96 places in 4164 ms of which 0 ms to minimize.
[2022-05-21 13:36:55] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 71649 ms
[2022-05-21 13:37:06] [INFO ] After 93651ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 4500 ms.
[2022-05-21 13:37:11] [INFO ] After 121596ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 1176 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1380/1380 places, 144368/144368 transitions.
Interrupted random walk after 270014 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3488 ms. (steps per millisecond=286 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3415 ms. (steps per millisecond=292 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2022-05-21 13:37:49] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2022-05-21 13:37:50] [INFO ] Computed 19 place invariants in 325 ms
[2022-05-21 13:37:50] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-21 13:37:50] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2022-05-21 13:38:11] [INFO ] After 20281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-21 13:38:11] [INFO ] State equation strengthened by 741 read => feed constraints.
[2022-05-21 13:38:21] [INFO ] After 9098ms SMT Verify possible using 741 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-21 13:38:32] [INFO ] Deduced a trap composed of 72 places in 10131 ms of which 1 ms to minimize.
[2022-05-21 13:38:43] [INFO ] Deduced a trap composed of 84 places in 9463 ms of which 2 ms to minimize.
[2022-05-21 13:38:52] [INFO ] Deduced a trap composed of 34 places in 8074 ms of which 1 ms to minimize.
[2022-05-21 13:39:01] [INFO ] Deduced a trap composed of 48 places in 7534 ms of which 1 ms to minimize.
[2022-05-21 13:39:10] [INFO ] Deduced a trap composed of 72 places in 7372 ms of which 1 ms to minimize.
[2022-05-21 13:39:18] [INFO ] Deduced a trap composed of 40 places in 7097 ms of which 1 ms to minimize.
[2022-05-21 13:39:27] [INFO ] Deduced a trap composed of 128 places in 6903 ms of which 1 ms to minimize.
[2022-05-21 13:39:35] [INFO ] Deduced a trap composed of 96 places in 6643 ms of which 2 ms to minimize.
[2022-05-21 13:39:42] [INFO ] Deduced a trap composed of 128 places in 6233 ms of which 1 ms to minimize.
[2022-05-21 13:39:49] [INFO ] Deduced a trap composed of 128 places in 5298 ms of which 3 ms to minimize.
[2022-05-21 13:39:55] [INFO ] Deduced a trap composed of 128 places in 4300 ms of which 5 ms to minimize.
[2022-05-21 13:39:59] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 98551 ms
[2022-05-21 13:40:00] [INFO ] After 108523ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1527 ms.
[2022-05-21 13:40:02] [INFO ] After 131500ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 1336 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1380/1380 places, 144368/144368 transitions.
Interrupted random walk after 270584 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3649 ms. (steps per millisecond=274 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 137213 steps, run timeout after 99002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 137213 steps, saw 124066 distinct states, run finished after 99005 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-21 13:42:16] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2022-05-21 13:42:16] [INFO ] Computed 19 place invariants in 211 ms
[2022-05-21 13:42:16] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-21 13:42:17] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2022-05-21 13:42:38] [INFO ] After 21645ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-21 13:42:39] [INFO ] State equation strengthened by 741 read => feed constraints.
[2022-05-21 13:42:46] [INFO ] After 6854ms SMT Verify possible using 741 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-21 13:42:57] [INFO ] Deduced a trap composed of 72 places in 10038 ms of which 1 ms to minimize.
[2022-05-21 13:43:09] [INFO ] Deduced a trap composed of 84 places in 10109 ms of which 2 ms to minimize.
[2022-05-21 13:43:19] [INFO ] Deduced a trap composed of 34 places in 8523 ms of which 1 ms to minimize.
[2022-05-21 13:43:28] [INFO ] Deduced a trap composed of 48 places in 7918 ms of which 4 ms to minimize.
[2022-05-21 13:43:37] [INFO ] Deduced a trap composed of 72 places in 7811 ms of which 1 ms to minimize.
[2022-05-21 13:43:45] [INFO ] Deduced a trap composed of 40 places in 7239 ms of which 5 ms to minimize.
[2022-05-21 13:43:54] [INFO ] Deduced a trap composed of 128 places in 7880 ms of which 2 ms to minimize.
[2022-05-21 13:44:02] [INFO ] Deduced a trap composed of 96 places in 6127 ms of which 0 ms to minimize.
[2022-05-21 13:44:10] [INFO ] Deduced a trap composed of 128 places in 6486 ms of which 0 ms to minimize.
[2022-05-21 13:44:16] [INFO ] Deduced a trap composed of 128 places in 4876 ms of which 1 ms to minimize.
[2022-05-21 13:44:22] [INFO ] Deduced a trap composed of 128 places in 4205 ms of which 1 ms to minimize.
[2022-05-21 13:44:26] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 99934 ms
[2022-05-21 13:44:27] [INFO ] After 107655ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1751 ms.
[2022-05-21 13:44:29] [INFO ] After 132139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 1293 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1380/1380 places, 144368/144368 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 1217 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2022-05-21 13:44:31] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2022-05-21 13:44:31] [INFO ] Computed 19 place invariants in 348 ms
[2022-05-21 13:44:38] [INFO ] Implicit Places using invariants in 6945 ms returned []
Implicit Place search using SMT only with invariants took 6948 ms to find 0 implicit places.
[2022-05-21 13:44:38] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2022-05-21 13:44:38] [INFO ] Computed 19 place invariants in 248 ms
[2022-05-21 13:45:08] [INFO ] Performed 98151/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-05-21 13:45:23] [INFO ] Dead Transitions using invariants and state equation in 44892 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1380/1380 places, 144368/144368 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 15510 ms. (steps per millisecond=6 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-21 13:45:39] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2022-05-21 13:45:40] [INFO ] Computed 19 place invariants in 500 ms
[2022-05-21 13:45:40] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-21 13:45:40] [INFO ] [Nat]Absence check using 19 positive place invariants in 16 ms returned sat
[2022-05-21 13:46:01] [INFO ] After 21048ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-21 13:46:03] [INFO ] State equation strengthened by 741 read => feed constraints.
[2022-05-21 13:46:11] [INFO ] After 7660ms SMT Verify possible using 741 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-21 13:46:21] [INFO ] Deduced a trap composed of 72 places in 8847 ms of which 1 ms to minimize.
[2022-05-21 13:46:31] [INFO ] Deduced a trap composed of 84 places in 8676 ms of which 4 ms to minimize.
[2022-05-21 13:46:39] [INFO ] Deduced a trap composed of 34 places in 7022 ms of which 1 ms to minimize.
[2022-05-21 13:46:47] [INFO ] Deduced a trap composed of 48 places in 6879 ms of which 0 ms to minimize.
[2022-05-21 13:46:55] [INFO ] Deduced a trap composed of 72 places in 6583 ms of which 1 ms to minimize.
[2022-05-21 13:47:03] [INFO ] Deduced a trap composed of 40 places in 7407 ms of which 1 ms to minimize.
[2022-05-21 13:47:12] [INFO ] Deduced a trap composed of 128 places in 6941 ms of which 1 ms to minimize.
[2022-05-21 13:47:19] [INFO ] Deduced a trap composed of 96 places in 5642 ms of which 3 ms to minimize.
[2022-05-21 13:47:30] [INFO ] Deduced a trap composed of 4 places in 9999 ms of which 2 ms to minimize.
[2022-05-21 13:47:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-21 13:47:30] [INFO ] After 110031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Finished random walk after 265220 steps, including 0 resets, run visited all 1 properties in 23814 ms. (steps per millisecond=11 )
Able to resolve query StableMarking after proving 1399 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 1320174 ms.

BK_STOP 1653140874600

--------------------
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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="RERS17pb115-PT-7"
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 RERS17pb115-PT-7, 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 r193-tajo-165281577000123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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