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-165281577000118.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-6, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-tajo-165281577000118
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 6.2K Apr 30 06:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 30 06:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 30 06:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 06:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 08:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 08:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 1653139186493

Running Version 202205111006
[2022-05-21 13:19:47] [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:19:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 13:19:50] [INFO ] Load time of PNML (sax parser for PT used): 2133 ms
[2022-05-21 13:19:50] [INFO ] Transformed 1399 places.
[2022-05-21 13:19:50] [INFO ] Transformed 144369 transitions.
[2022-05-21 13:19:50] [INFO ] Parsed PT model containing 1399 places and 144369 transitions in 2835 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2203 ms. (steps per millisecond=4 ) properties (out of 1399) seen :984
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=5 ) properties (out of 415) 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 415) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 415) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=3 ) properties (out of 415) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=3 ) properties (out of 415) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=3 ) properties (out of 415) 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 415) 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 415) 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 415) 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 415) 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 415) 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 415) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=3 ) properties (out of 415) 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 415) 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 415) 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 415) 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 415) 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 415) 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 415) 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 415) 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 415) 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 415) 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 415) 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 415) 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 415) 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 415) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 415) 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 415) 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 415) 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 415) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 415) 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 415) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 415) 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 415) 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 415) 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 415) 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 415) 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 415) 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 415) 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 415) 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 415) 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 415) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 415) 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 415) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 415) 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 415) 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 415) 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 415) 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 415) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 415) seen :0
Running SMT prover for 415 properties.
[2022-05-21 13:19:55] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1399 cols
[2022-05-21 13:19:56] [INFO ] Computed 37 place invariants in 508 ms
[2022-05-21 13:20:04] [INFO ] After 8649ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:415
[2022-05-21 13:20:11] [INFO ] [Nat]Absence check using 19 positive place invariants in 15 ms returned sat
[2022-05-21 13:20:11] [INFO ] [Nat]Absence check using 19 positive and 18 generalized place invariants in 13 ms returned sat
[2022-05-21 13:20:29] [INFO ] After 12330ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :414
[2022-05-21 13:20:32] [INFO ] State equation strengthened by 2277 read => feed constraints.
[2022-05-21 13:20:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-21 13:20:32] [INFO ] After 27265ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:415
Fused 415 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 415 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 2896 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 210631 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 ) properties seen 396
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 481 ms. (steps per millisecond=207 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 514 ms. (steps per millisecond=194 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 472 ms. (steps per millisecond=211 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 465 ms. (steps per millisecond=215 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 474 ms. (steps per millisecond=210 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 448 ms. (steps per millisecond=223 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 454 ms. (steps per millisecond=220 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 521 ms. (steps per millisecond=191 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 462 ms. (steps per millisecond=216 ) properties (out of 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 482 ms. (steps per millisecond=207 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 501 ms. (steps per millisecond=199 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 461 ms. (steps per millisecond=216 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 466 ms. (steps per millisecond=214 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 469 ms. (steps per millisecond=213 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2022-05-21 13:21:13] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2022-05-21 13:21:14] [INFO ] Computed 19 place invariants in 300 ms
[2022-05-21 13:21:14] [INFO ] After 410ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2022-05-21 13:21:14] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2022-05-21 13:21:54] [INFO ] After 39296ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2022-05-21 13:21:54] [INFO ] State equation strengthened by 741 read => feed constraints.
[2022-05-21 13:22:24] [INFO ] After 29056ms SMT Verify possible using 741 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2022-05-21 13:22:31] [INFO ] Deduced a trap composed of 34 places in 5890 ms of which 4 ms to minimize.
[2022-05-21 13:22:38] [INFO ] Deduced a trap composed of 48 places in 5803 ms of which 1 ms to minimize.
[2022-05-21 13:22:45] [INFO ] Deduced a trap composed of 88 places in 5097 ms of which 1 ms to minimize.
[2022-05-21 13:22:50] [INFO ] Deduced a trap composed of 40 places in 3864 ms of which 2 ms to minimize.
[2022-05-21 13:22:56] [INFO ] Deduced a trap composed of 72 places in 4343 ms of which 1 ms to minimize.
[2022-05-21 13:23:01] [INFO ] Deduced a trap composed of 128 places in 3768 ms of which 0 ms to minimize.
[2022-05-21 13:23:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 41200 ms
[2022-05-21 13:24:21] [INFO ] After 146435ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 25319 ms.
[2022-05-21 13:24:46] [INFO ] After 212269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 16 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 1400 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 248837 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3655 ms. (steps per millisecond=273 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3665 ms. (steps per millisecond=272 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3632 ms. (steps per millisecond=275 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3635 ms. (steps per millisecond=275 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3902 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3855 ms. (steps per millisecond=259 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-05-21 13:25:40] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2022-05-21 13:25:41] [INFO ] Computed 19 place invariants in 353 ms
[2022-05-21 13:25:41] [INFO ] After 296ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-21 13:25:41] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2022-05-21 13:26:06] [INFO ] After 24770ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-21 13:26:07] [INFO ] State equation strengthened by 741 read => feed constraints.
[2022-05-21 13:26:23] [INFO ] After 15675ms SMT Verify possible using 741 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-21 13:26:33] [INFO ] Deduced a trap composed of 34 places in 8554 ms of which 1 ms to minimize.
[2022-05-21 13:26:41] [INFO ] Deduced a trap composed of 40 places in 7217 ms of which 2 ms to minimize.
[2022-05-21 13:26:49] [INFO ] Deduced a trap composed of 72 places in 6724 ms of which 1 ms to minimize.
[2022-05-21 13:26:58] [INFO ] Deduced a trap composed of 96 places in 7204 ms of which 1 ms to minimize.
[2022-05-21 13:27:07] [INFO ] Deduced a trap composed of 128 places in 7355 ms of which 1 ms to minimize.
[2022-05-21 13:27:13] [INFO ] Deduced a trap composed of 128 places in 4966 ms of which 1 ms to minimize.
[2022-05-21 13:27:18] [INFO ] Deduced a trap composed of 128 places in 4131 ms of which 0 ms to minimize.
[2022-05-21 13:27:23] [INFO ] Deduced a trap composed of 48 places in 3149 ms of which 1 ms to minimize.
[2022-05-21 13:27:27] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 64742 ms
[2022-05-21 13:27:50] [INFO ] After 103429ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 9201 ms.
[2022-05-21 13:28:00] [INFO ] After 138499ms 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 1091 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 248447 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3271 ms. (steps per millisecond=305 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3545 ms. (steps per millisecond=282 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-21 13:28:38] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2022-05-21 13:28:38] [INFO ] Computed 19 place invariants in 559 ms
[2022-05-21 13:28:39] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-21 13:28:39] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2022-05-21 13:29:00] [INFO ] After 20754ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-21 13:29:00] [INFO ] State equation strengthened by 741 read => feed constraints.
[2022-05-21 13:29:11] [INFO ] After 10723ms SMT Verify possible using 741 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-21 13:29:24] [INFO ] Deduced a trap composed of 48 places in 10936 ms of which 2 ms to minimize.
[2022-05-21 13:29:34] [INFO ] Deduced a trap composed of 72 places in 8559 ms of which 1 ms to minimize.
[2022-05-21 13:29:42] [INFO ] Deduced a trap composed of 34 places in 6487 ms of which 1 ms to minimize.
[2022-05-21 13:29:50] [INFO ] Deduced a trap composed of 40 places in 6658 ms of which 1 ms to minimize.
[2022-05-21 13:29:58] [INFO ] Deduced a trap composed of 128 places in 5893 ms of which 0 ms to minimize.
[2022-05-21 13:30:05] [INFO ] Deduced a trap composed of 72 places in 5854 ms of which 1 ms to minimize.
[2022-05-21 13:30:12] [INFO ] Deduced a trap composed of 128 places in 5401 ms of which 0 ms to minimize.
[2022-05-21 13:30:18] [INFO ] Deduced a trap composed of 128 places in 4215 ms of which 1 ms to minimize.
[2022-05-21 13:30:23] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 71785 ms
[2022-05-21 13:30:29] [INFO ] After 88588ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2814 ms.
[2022-05-21 13:30:32] [INFO ] After 113081ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 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 2080 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 171388 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=5 ) properties seen 0
Interrupted Best-First random walk after 876358 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=175 ) properties seen 0
Interrupted Best-First random walk after 866616 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=173 ) properties seen 0
Interrupted probabilistic random walk after 133634 steps, run timeout after 120010 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 133634 steps, saw 120685 distinct states, run finished after 120016 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-21 13:33:15] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2022-05-21 13:33:15] [INFO ] Computed 19 place invariants in 361 ms
[2022-05-21 13:33:15] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-21 13:33:15] [INFO ] [Nat]Absence check using 19 positive place invariants in 15 ms returned sat
[2022-05-21 13:33:38] [INFO ] After 22094ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-21 13:33:39] [INFO ] State equation strengthened by 741 read => feed constraints.
[2022-05-21 13:33:49] [INFO ] After 10329ms SMT Verify possible using 741 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-21 13:34:00] [INFO ] Deduced a trap composed of 48 places in 9655 ms of which 1 ms to minimize.
[2022-05-21 13:34:10] [INFO ] Deduced a trap composed of 72 places in 8822 ms of which 3 ms to minimize.
[2022-05-21 13:34:19] [INFO ] Deduced a trap composed of 34 places in 7439 ms of which 1 ms to minimize.
[2022-05-21 13:34:27] [INFO ] Deduced a trap composed of 40 places in 6423 ms of which 0 ms to minimize.
[2022-05-21 13:34:34] [INFO ] Deduced a trap composed of 128 places in 6059 ms of which 1 ms to minimize.
[2022-05-21 13:34:41] [INFO ] Deduced a trap composed of 72 places in 5725 ms of which 1 ms to minimize.
[2022-05-21 13:34:48] [INFO ] Deduced a trap composed of 128 places in 5552 ms of which 1 ms to minimize.
[2022-05-21 13:34:54] [INFO ] Deduced a trap composed of 128 places in 3871 ms of which 0 ms to minimize.
[2022-05-21 13:34:58] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 69085 ms
[2022-05-21 13:35:04] [INFO ] After 85687ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2965 ms.
[2022-05-21 13:35:07] [INFO ] After 111946ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 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 1741 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 1734 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2022-05-21 13:35:11] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2022-05-21 13:35:11] [INFO ] Computed 19 place invariants in 409 ms
[2022-05-21 13:35:18] [INFO ] Implicit Places using invariants in 7794 ms returned []
Implicit Place search using SMT only with invariants took 7797 ms to find 0 implicit places.
[2022-05-21 13:35:19] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2022-05-21 13:35:19] [INFO ] Computed 19 place invariants in 301 ms
[2022-05-21 13:35:49] [INFO ] Performed 97464/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-05-21 13:36:04] [INFO ] Dead Transitions using invariants and state equation in 45494 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 15346 ms. (steps per millisecond=6 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-21 13:36:20] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2022-05-21 13:36:20] [INFO ] Computed 19 place invariants in 253 ms
[2022-05-21 13:36:21] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-21 13:36:21] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2022-05-21 13:36:42] [INFO ] After 21384ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-21 13:36:44] [INFO ] State equation strengthened by 741 read => feed constraints.
[2022-05-21 13:36:52] [INFO ] After 8705ms SMT Verify possible using 741 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-21 13:37:04] [INFO ] Deduced a trap composed of 48 places in 9717 ms of which 2 ms to minimize.
[2022-05-21 13:37:14] [INFO ] Deduced a trap composed of 72 places in 8564 ms of which 1 ms to minimize.
[2022-05-21 13:37:22] [INFO ] Deduced a trap composed of 34 places in 7074 ms of which 1 ms to minimize.
[2022-05-21 13:37:30] [INFO ] Deduced a trap composed of 40 places in 6359 ms of which 1 ms to minimize.
[2022-05-21 13:37:37] [INFO ] Deduced a trap composed of 128 places in 6252 ms of which 1 ms to minimize.
[2022-05-21 13:37:44] [INFO ] Deduced a trap composed of 72 places in 5548 ms of which 2 ms to minimize.
[2022-05-21 13:37:51] [INFO ] Deduced a trap composed of 128 places in 5417 ms of which 1 ms to minimize.
[2022-05-21 13:37:57] [INFO ] Deduced a trap composed of 128 places in 4149 ms of which 1 ms to minimize.
[2022-05-21 13:38:01] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 69043 ms
[2022-05-21 13:38:01] [INFO ] After 77837ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-21 13:38:02] [INFO ] After 100873ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Interrupted random walk after 291157 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 1
Finished Best-First random walk after 847096 steps, including 2 resets, run visited all 1 properties in 2837 ms. (steps per millisecond=298 )
Able to resolve query StableMarking after proving 1399 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 1127049 ms.

BK_STOP 1653140315005

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="RERS17pb115-PT-6"
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-6, 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-165281577000118"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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