fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r193-tajo-165281576900088
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for RERS17pb114-PT-9

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3200.812 1072353.00 1171447.00 257.30 F normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 73M
-rw-r--r-- 1 mcc users 6.8K Apr 29 17:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 29 17:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 29 17:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 29 17:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 9 08:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:33 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 73M 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 1653138275019

Running Version 202205111006
[2022-05-21 13:04:36] [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:04:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 13:04:38] [INFO ] Load time of PNML (sax parser for PT used): 2076 ms
[2022-05-21 13:04:38] [INFO ] Transformed 1446 places.
[2022-05-21 13:04:39] [INFO ] Transformed 151085 transitions.
[2022-05-21 13:04:39] [INFO ] Parsed PT model containing 1446 places and 151085 transitions in 2980 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1463 ms. (steps per millisecond=6 ) properties (out of 1446) seen :845
Running SMT prover for 601 properties.
[2022-05-21 13:04:43] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
// Phase 1: matrix 84691 rows 1446 cols
[2022-05-21 13:04:43] [INFO ] Computed 35 place invariants in 479 ms
[2022-05-21 13:04:56] [INFO ] After 12746ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:601
[2022-05-21 13:05:06] [INFO ] [Nat]Absence check using 18 positive place invariants in 18 ms returned sat
[2022-05-21 13:05:06] [INFO ] [Nat]Absence check using 18 positive and 17 generalized place invariants in 22 ms returned sat
[2022-05-21 13:05:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-21 13:05:21] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:601
Fused 601 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 601 out of 1446 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1446/1446 places, 151085/151085 transitions.
Ensure Unique test removed 17 places
Drop transitions removed 512 transitions
Reduce isomorphic transitions removed 512 transitions.
Iterating post reduction 0 with 529 rules applied. Total rules applied 529 place count 1429 transition count 150573
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 530 place count 1428 transition count 150572
Applied a total of 530 rules in 3082 ms. Remains 1428 /1446 variables (removed 18) and now considering 150572/151085 (removed 513) transitions.
Finished structural reductions, in 1 iterations. Remains : 1428/1446 places, 150572/151085 transitions.
Interrupted random walk after 157917 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=5 ) properties seen 580
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 644 ms. (steps per millisecond=155 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 613 ms. (steps per millisecond=163 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 679 ms. (steps per millisecond=147 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 623 ms. (steps per millisecond=160 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 574 ms. (steps per millisecond=174 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 636 ms. (steps per millisecond=157 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 645 ms. (steps per millisecond=155 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 633 ms. (steps per millisecond=157 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 687 ms. (steps per millisecond=145 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 584 ms. (steps per millisecond=171 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 567 ms. (steps per millisecond=176 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 600 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 607 ms. (steps per millisecond=164 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 586 ms. (steps per millisecond=170 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 577 ms. (steps per millisecond=173 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 545 ms. (steps per millisecond=183 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 535 ms. (steps per millisecond=186 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 531 ms. (steps per millisecond=188 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 515 ms. (steps per millisecond=194 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 478 ms. (steps per millisecond=209 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2022-05-21 13:06:07] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2022-05-21 13:06:08] [INFO ] Computed 18 place invariants in 443 ms
[2022-05-21 13:06:08] [INFO ] After 542ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2022-05-21 13:06:09] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2022-05-21 13:06:58] [INFO ] After 49205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2022-05-21 13:07:00] [INFO ] State equation strengthened by 773 read => feed constraints.
[2022-05-21 13:07:36] [INFO ] After 35727ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2022-05-21 13:07:47] [INFO ] Deduced a trap composed of 40 places in 10015 ms of which 17 ms to minimize.
[2022-05-21 13:07:59] [INFO ] Deduced a trap composed of 64 places in 11010 ms of which 3 ms to minimize.
[2022-05-21 13:08:11] [INFO ] Deduced a trap composed of 96 places in 10296 ms of which 2 ms to minimize.
[2022-05-21 13:08:22] [INFO ] Deduced a trap composed of 64 places in 9633 ms of which 2 ms to minimize.
[2022-05-21 13:08:32] [INFO ] Deduced a trap composed of 64 places in 8758 ms of which 1 ms to minimize.
[2022-05-21 13:08:42] [INFO ] Deduced a trap composed of 64 places in 8403 ms of which 1 ms to minimize.
[2022-05-21 13:08:52] [INFO ] Deduced a trap composed of 64 places in 8821 ms of which 1 ms to minimize.
[2022-05-21 13:09:00] [INFO ] Deduced a trap composed of 96 places in 7035 ms of which 1 ms to minimize.
[2022-05-21 13:09:08] [INFO ] Deduced a trap composed of 40 places in 6987 ms of which 1 ms to minimize.
[2022-05-21 13:09:16] [INFO ] Deduced a trap composed of 64 places in 6470 ms of which 1 ms to minimize.
[2022-05-21 13:09:24] [INFO ] Deduced a trap composed of 96 places in 6071 ms of which 1 ms to minimize.
[2022-05-21 13:09:30] [INFO ] Deduced a trap composed of 96 places in 4736 ms of which 1 ms to minimize.
[2022-05-21 13:09:34] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 117833 ms
[2022-05-21 13:09:55] [INFO ] After 175440ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-21 13:09:55] [INFO ] After 227077ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 20 out of 1428 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1629 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1428/1428 places, 150572/150572 transitions.
Interrupted random walk after 168921 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=5 ) properties seen 12
Interrupted Best-First random walk after 953303 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=190 ) properties seen 0
Interrupted Best-First random walk after 976270 steps, including 2 resets, run timeout after 5004 ms. (steps per millisecond=195 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4975 ms. (steps per millisecond=201 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4716 ms. (steps per millisecond=212 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4720 ms. (steps per millisecond=211 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4925 ms. (steps per millisecond=203 ) properties (out of 7) seen :0
Interrupted Best-First random walk after 923450 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=184 ) properties seen 0
Interrupted Best-First random walk after 973598 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=194 ) properties seen 0
Running SMT prover for 7 properties.
[2022-05-21 13:11:07] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2022-05-21 13:11:08] [INFO ] Computed 18 place invariants in 520 ms
[2022-05-21 13:11:08] [INFO ] After 345ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-21 13:11:08] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2022-05-21 13:11:38] [INFO ] After 29805ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-21 13:11:40] [INFO ] State equation strengthened by 773 read => feed constraints.
[2022-05-21 13:11:58] [INFO ] After 18235ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-21 13:12:11] [INFO ] Deduced a trap composed of 40 places in 11236 ms of which 1 ms to minimize.
[2022-05-21 13:12:22] [INFO ] Deduced a trap composed of 40 places in 9465 ms of which 2 ms to minimize.
[2022-05-21 13:12:34] [INFO ] Deduced a trap composed of 96 places in 10457 ms of which 3 ms to minimize.
[2022-05-21 13:12:46] [INFO ] Deduced a trap composed of 64 places in 10728 ms of which 2 ms to minimize.
[2022-05-21 13:12:57] [INFO ] Deduced a trap composed of 64 places in 9789 ms of which 1 ms to minimize.
[2022-05-21 13:13:08] [INFO ] Deduced a trap composed of 64 places in 9065 ms of which 2 ms to minimize.
[2022-05-21 13:13:17] [INFO ] Deduced a trap composed of 128 places in 7873 ms of which 1 ms to minimize.
[2022-05-21 13:13:26] [INFO ] Deduced a trap composed of 64 places in 7778 ms of which 2 ms to minimize.
[2022-05-21 13:13:35] [INFO ] Deduced a trap composed of 96 places in 6927 ms of which 1 ms to minimize.
[2022-05-21 13:13:43] [INFO ] Deduced a trap composed of 128 places in 7079 ms of which 1 ms to minimize.
[2022-05-21 13:13:50] [INFO ] Deduced a trap composed of 96 places in 5399 ms of which 2 ms to minimize.
[2022-05-21 13:13:55] [INFO ] Deduced a trap composed of 64 places in 3607 ms of which 1 ms to minimize.
[2022-05-21 13:14:00] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 121557 ms
[2022-05-21 13:14:34] [INFO ] After 174531ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 10078 ms.
[2022-05-21 13:14:44] [INFO ] After 216524ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 1428 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 2575 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1428/1428 places, 150572/150572 transitions.
Interrupted random walk after 198380 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=6 ) properties seen 4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3571 ms. (steps per millisecond=280 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3663 ms. (steps per millisecond=273 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3604 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-21 13:15:29] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2022-05-21 13:15:29] [INFO ] Computed 18 place invariants in 361 ms
[2022-05-21 13:15:29] [INFO ] After 289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-21 13:15:30] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2022-05-21 13:15:55] [INFO ] After 25386ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-21 13:15:56] [INFO ] State equation strengthened by 773 read => feed constraints.
[2022-05-21 13:16:06] [INFO ] After 10617ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-21 13:16:19] [INFO ] Deduced a trap composed of 64 places in 11344 ms of which 2 ms to minimize.
[2022-05-21 13:16:30] [INFO ] Deduced a trap composed of 64 places in 9150 ms of which 2 ms to minimize.
[2022-05-21 13:16:42] [INFO ] Deduced a trap composed of 64 places in 10543 ms of which 2 ms to minimize.
[2022-05-21 13:16:53] [INFO ] Deduced a trap composed of 64 places in 9426 ms of which 2 ms to minimize.
[2022-05-21 13:17:04] [INFO ] Deduced a trap composed of 64 places in 9347 ms of which 2 ms to minimize.
[2022-05-21 13:17:14] [INFO ] Deduced a trap composed of 96 places in 8997 ms of which 1 ms to minimize.
[2022-05-21 13:17:24] [INFO ] Deduced a trap composed of 96 places in 7520 ms of which 1 ms to minimize.
[2022-05-21 13:17:32] [INFO ] Deduced a trap composed of 64 places in 6670 ms of which 1 ms to minimize.
[2022-05-21 13:17:40] [INFO ] Deduced a trap composed of 40 places in 6522 ms of which 1 ms to minimize.
[2022-05-21 13:17:48] [INFO ] Deduced a trap composed of 40 places in 6268 ms of which 5 ms to minimize.
[2022-05-21 13:17:55] [INFO ] Deduced a trap composed of 96 places in 6355 ms of which 1 ms to minimize.
[2022-05-21 13:18:02] [INFO ] Deduced a trap composed of 96 places in 5354 ms of which 0 ms to minimize.
[2022-05-21 13:18:09] [INFO ] Deduced a trap composed of 128 places in 4879 ms of which 0 ms to minimize.
[2022-05-21 13:18:13] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 126389 ms
[2022-05-21 13:18:25] [INFO ] After 149197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 4973 ms.
[2022-05-21 13:18:30] [INFO ] After 180545ms 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 1 ms.
Support contains 3 out of 1428 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1941 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1428/1428 places, 150572/150572 transitions.
Interrupted random walk after 241912 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 3705 ms. (steps per millisecond=269 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-21 13:19:06] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2022-05-21 13:19:07] [INFO ] Computed 18 place invariants in 369 ms
[2022-05-21 13:19:07] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-21 13:19:07] [INFO ] [Nat]Absence check using 18 positive place invariants in 18 ms returned sat
[2022-05-21 13:19:29] [INFO ] After 22103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-21 13:19:30] [INFO ] State equation strengthened by 773 read => feed constraints.
[2022-05-21 13:19:39] [INFO ] After 9105ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-21 13:19:53] [INFO ] Deduced a trap composed of 96 places in 12466 ms of which 3 ms to minimize.
[2022-05-21 13:20:07] [INFO ] Deduced a trap composed of 40 places in 12522 ms of which 2 ms to minimize.
[2022-05-21 13:20:21] [INFO ] Deduced a trap composed of 96 places in 11875 ms of which 4 ms to minimize.
[2022-05-21 13:20:34] [INFO ] Deduced a trap composed of 64 places in 11824 ms of which 2 ms to minimize.
[2022-05-21 13:20:45] [INFO ] Deduced a trap composed of 128 places in 9404 ms of which 1 ms to minimize.
[2022-05-21 13:20:56] [INFO ] Deduced a trap composed of 64 places in 10194 ms of which 2 ms to minimize.
[2022-05-21 13:21:06] [INFO ] Deduced a trap composed of 40 places in 7972 ms of which 1 ms to minimize.
[2022-05-21 13:21:15] [INFO ] Deduced a trap composed of 64 places in 7556 ms of which 2 ms to minimize.
[2022-05-21 13:21:25] [INFO ] Deduced a trap composed of 64 places in 8502 ms of which 3 ms to minimize.
[2022-05-21 13:21:35] [INFO ] Deduced a trap composed of 64 places in 8552 ms of which 1 ms to minimize.
[2022-05-21 13:21:43] [INFO ] Deduced a trap composed of 128 places in 6884 ms of which 1 ms to minimize.
[2022-05-21 13:21:50] [INFO ] Deduced a trap composed of 96 places in 5118 ms of which 1 ms to minimize.
[2022-05-21 13:21:56] [INFO ] Deduced a trap composed of 96 places in 4992 ms of which 1 ms to minimize.
[2022-05-21 13:22:02] [INFO ] Deduced a trap composed of 64 places in 3768 ms of which 1 ms to minimize.
[2022-05-21 13:22:07] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 147317 ms
[2022-05-21 13:22:07] [INFO ] After 157199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1468 ms.
[2022-05-21 13:22:09] [INFO ] After 181721ms 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 1428 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 2193 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1428/1428 places, 150572/150572 transitions.
Finished random walk after 107103 steps, including 0 resets, run visited all 1 properties in 15192 ms. (steps per millisecond=7 )
Able to resolve query StableMarking after proving 1446 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 1070846 ms.

BK_STOP 1653139347372

--------------------
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="RERS17pb114-PT-9"
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 RERS17pb114-PT-9, 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-165281576900088"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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