fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r066-tajo-158922813700047
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for DLCshifumi-PT-4b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15738.240 83597.00 113930.00 63.80 FTTFTTFTTTTTTTTT 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/mcc2020-input.r066-tajo-158922813700047.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 DLCshifumi-PT-4b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922813700047
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.3M
-rw-r--r-- 1 mcc users 4.1K Mar 30 23:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 30 23:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 29 12:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 29 12:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 08:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 28 08:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 27 02:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 27 02:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 5.1M Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityFireability-00
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityFireability-01
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityFireability-02
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityFireability-03
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityFireability-04
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityFireability-05
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityFireability-06
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityFireability-07
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityFireability-08
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityFireability-09
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityFireability-10
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityFireability-11
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityFireability-12
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityFireability-13
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityFireability-14
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1590096163089

[2020-05-21 21:22:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-21 21:22:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 21:22:45] [INFO ] Load time of PNML (sax parser for PT used): 605 ms
[2020-05-21 21:22:45] [INFO ] Transformed 15015 places.
[2020-05-21 21:22:45] [INFO ] Transformed 21341 transitions.
[2020-05-21 21:22:45] [INFO ] Found NUPN structural information;
[2020-05-21 21:22:45] [INFO ] Parsed PT model containing 15015 places and 21341 transitions in 1108 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 474 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 261 ms. (steps per millisecond=38 ) properties seen :[0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1]
FORMULA DLCshifumi-PT-4b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0]
FORMULA DLCshifumi-PT-4b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 21341 rows 15015 cols
[2020-05-21 21:22:47] [INFO ] Computed 691 place invariants in 905 ms
[2020-05-21 21:22:52] [INFO ] [Real]Absence check using 691 positive place invariants in 3090 ms returned (error "Solver has unexpectedly terminated")
[2020-05-21 21:22:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 21:22:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 0
[2020-05-21 21:22:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 21:22:58] [INFO ] [Real]Absence check using 691 positive place invariants in 2869 ms returned (error "Failed to check-sat")
[2020-05-21 21:22:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 21:22:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 1
[2020-05-21 21:23:03] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 21:23:03] [INFO ] [Real]Absence check using 691 positive place invariants in 3246 ms returned (error "Failed to check-sat")
[2020-05-21 21:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 21:23:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 2
[2020-05-21 21:23:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 21:23:08] [INFO ] [Real]Absence check using 691 positive place invariants in 2995 ms returned (error "Failed to check-sat")
[2020-05-21 21:23:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 21:23:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 3
[2020-05-21 21:23:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 21:23:13] [INFO ] [Real]Absence check using 691 positive place invariants in 3027 ms returned (error "Failed to check-sat")
[2020-05-21 21:23:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 21:23:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 4
[2020-05-21 21:23:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 21:23:18] [INFO ] [Real]Absence check using 691 positive place invariants in 2996 ms returned (error "Failed to check-sat")
[2020-05-21 21:23:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 21:23:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 5
[2020-05-21 21:23:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 21:23:23] [INFO ] [Real]Absence check using 691 positive place invariants in 3119 ms returned (error "Failed to check-sat")
[2020-05-21 21:23:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 21:23:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 6
[2020-05-21 21:23:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 21:23:28] [INFO ] [Real]Absence check using 691 positive place invariants in 2878 ms returned (error "Failed to check-sat")
[2020-05-21 21:23:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 21:23:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 7
[2020-05-21 21:23:33] [INFO ] [Real]Absence check using 691 positive place invariants in 3057 ms returned (error "Solver has unexpectedly terminated")
[2020-05-21 21:23:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 21:23:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 8
[2020-05-21 21:23:38] [INFO ] [Real]Absence check using 691 positive place invariants in 3157 ms returned (error "Solver has unexpectedly terminated")
[2020-05-21 21:23:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 21:23:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 9
[2020-05-21 21:23:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (= 1 (+ s0 s8284 s8285 s8286 s8287 s8288 s8289 s8290 s8291 s8292 s8293 s8294 s8295 s8296 s8297 s8298 s8299 s8300 s8301 s8302 s8303 s8304 s8305 s8306 s8307 s8308 s8309 s8310 s8311 s8312 s8313 s8314 s8315 s8316 s8317 s8318 s8319 s8320 s8321 s8322 s8323 s8324 s8325 s8326 s8327 s8328 s8329 s8330 s8331 s8332 s8333 s8334 s8335 s8336 s8337 s8338 s8339 s8340 s8341 s8342 s8343 s8344 s8345 s8346 s8347 s8348 s8349 s8350 s8351 s8352 s8353 s8354 s8355 s8356 s8357 s8358 s8359 s8360 s8361 s8362 s8363 s8364 s8365 s8366 s8367 s8368 s8369 s8370 s8371 s8372 s8373 s8374 s8375 s8376 s8377 s8378 s8379 s8380 s8381 s8382 s8383 s8384 s8385 s8386 s8387 s8388 s8389 s8390 s8391 s8392 s8393 s8394 s8395 s8396 s8397 s8398 s8399 s8400 s8401 s8402 s8403 s8404 s8405 s8406 s8407 s8408 s8409 s8410 s8411 s8412 s8413 s8414 s8415 s8416 s8417 s8418 s8419 s8420 s8421 s8422 s8423 s8424 s8425 s8426 s8427 s8428 s8429 s8430 s8431 s8432 s8433 s8434 s8435 s8436 s8437 s8438 s8439 s8440 s8441 s8442 s8443 s8444 s8445 s8446 s8447 s8448 s8449 s8450 s8451 s8452 s8453 s8454 s8455 s8456 s8457 s8458 s8459 s8460 s8461 s8462 s8463 s8464 s8465 s8466 s8467 s8468 s8469 s8470 s8471 s8472 s8473 s8474 s8475 s8476 s8477 s8478 s8479 s8480 s8481 s8482 s8483 s8484 s8485 s8486 s8487 s8488 s8489 s8490 s8491 s8492 s8493 s8494 s8495 s8496 s8497 s8498 s8499 s8500 s8501 s8502 s8503 s8504 s8505 s8506 s8507 s8508 s8509 s8510 s8511 s8512 s8513 s8514 s8515 s8516 s8517 s8518 s8519 s8520 s8521 s8522 s8523 s8524 s8525 s8526 s8527 s8528 s8529 s8530 s8531 s8532 s8533 s8534 s8535 s8536 s8537 s8538 s8539 s8540 s8541 s8542 s8543 s8544 s8545 s8546 s8547 s8548 s8549 s8550 s8551 s8552 s8553 s8554 s8555 s8556 s8557 s8558 s8559 s8560 s8561 s8562 s8563 s8564 s8565 s8566 s8567 s8568 s8569 s8570 s8571 s8572 s8573 s8574 s8575 s8576 s8577 s8578 s8579 s8580 s8581 s8582 s8583 s8584 s8585 s8586 s8587 s8588 s8589 s8590 s8591 s8592 s8593 s8594 s8595 s8596 s8597 s8598 s8599 s8600 s8601 s8602 s8603 s8604 s8605 s8606 s8607 s8608 s8609 s8610 s8611 s8612 s8613 s8614 s8615 s8616 s8617 s8618 s8619 s8620 s8621 s8622 s8623 s8624 s8625 s8626 s8627 s8628 s8629 s8630 s8631 s8632 s8633 s8634 s8635 s8636 s8637 s8638 s8639 s8640 s8641 s8642 s8643 s8644 s8645 s8646 s8647 s8648 s8649 s8650 s8651 s8652 s8653 s8654 s8655 s8656 s8657 s8658 s8659 s8660 s8661 s8662 s8663 s8664 s8665 s8666 s8667 s8668 s8669 s8670 s8671 s8672 s8673 s8674 s8675 s8676 s8677 s8678 s8679 s8680 s8681 s8682 s8683 s8684 s8685 s8686 s8687 s8688 s8689 s8690 s8691 s8692 s8693 s8694 s8695 s8696 s8697 s8698 s8699 s8700 s8701 s8702 s8703 s8704 s8705 s8706 s8707 s8708 s8709 s8710 s8711 s8712 s8713 s8714 s8715 s8716 s8717 s8718 s8719 s8720 s8721 s8722 s8723 s8724 s8725 s8726 s8727 s8728 s8729 s8730 s8731 s8732 s8733 s8734 s8735 s8736 s8737 s8738 s8739 s10455 s10456 s10457 s10458 s10459 s10460 s10461 s10462 s10463 s10464))") while checking expression at index 10
Support contains 35 out of 15015 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15015/15015 places, 21341/21341 transitions.
Graph (trivial) has 14129 edges and 15015 vertex of which 1350 / 15015 are part of one of the 91 SCC in 84 ms
Free SCC test removed 1259 places
Drop transitions removed 1425 transitions
Reduce isomorphic transitions removed 1425 transitions.
Performed 7329 Post agglomeration using F-continuation condition.Transition count delta: 7329
Iterating post reduction 0 with 8754 rules applied. Total rules applied 8755 place count 13756 transition count 12587
Reduce places removed 7329 places and 0 transitions.
Ensure Unique test removed 235 transitions
Reduce isomorphic transitions removed 235 transitions.
Performed 233 Post agglomeration using F-continuation condition.Transition count delta: 233
Iterating post reduction 1 with 7797 rules applied. Total rules applied 16552 place count 6427 transition count 12119
Reduce places removed 233 places and 0 transitions.
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Iterating post reduction 2 with 383 rules applied. Total rules applied 16935 place count 6194 transition count 11969
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 3 with 75 rules applied. Total rules applied 17010 place count 6119 transition count 11969
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 82 Pre rules applied. Total rules applied 17010 place count 6119 transition count 11887
Deduced a syphon composed of 82 places in 245 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 4 with 164 rules applied. Total rules applied 17174 place count 6037 transition count 11887
Symmetric choice reduction at 4 with 1701 rule applications. Total rules 18875 place count 6037 transition count 11887
Deduced a syphon composed of 1701 places in 210 ms
Reduce places removed 1701 places and 1701 transitions.
Iterating global reduction 4 with 3402 rules applied. Total rules applied 22277 place count 4336 transition count 10186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 22279 place count 4336 transition count 10184
Performed 686 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 686 Pre rules applied. Total rules applied 22279 place count 4336 transition count 9498
Deduced a syphon composed of 686 places in 219 ms
Reduce places removed 686 places and 0 transitions.
Iterating global reduction 5 with 1372 rules applied. Total rules applied 23651 place count 3650 transition count 9498
Symmetric choice reduction at 5 with 164 rule applications. Total rules 23815 place count 3650 transition count 9498
Deduced a syphon composed of 164 places in 181 ms
Reduce places removed 164 places and 2207 transitions.
Iterating global reduction 5 with 328 rules applied. Total rules applied 24143 place count 3486 transition count 7291
Ensure Unique test removed 148 transitions
Reduce isomorphic transitions removed 148 transitions.
Iterating post reduction 5 with 148 rules applied. Total rules applied 24291 place count 3486 transition count 7143
Performed 877 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 877 places in 2 ms
Reduce places removed 877 places and 0 transitions.
Iterating global reduction 6 with 1754 rules applied. Total rules applied 26045 place count 2609 transition count 6264
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 26048 place count 2609 transition count 6261
Renaming transitions due to excessive name length > 1024 char.
Symmetric choice reduction at 7 with 1 rule applications. Total rules 26049 place count 2609 transition count 6261
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 78 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 26051 place count 2608 transition count 6183
Performed 101 Post agglomeration using F-continuation condition with reduction of 128 identical transitions.
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 7 with 202 rules applied. Total rules applied 26253 place count 2507 transition count 6520
Performed 101 Post agglomeration using F-continuation condition with reduction of 120 identical transitions.
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 7 with 202 rules applied. Total rules applied 26455 place count 2406 transition count 6863
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 26457 place count 2406 transition count 6861
Performed 36 Post agglomeration using F-continuation condition with reduction of 32 identical transitions.
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 8 with 72 rules applied. Total rules applied 26529 place count 2370 transition count 7035
Drop transitions removed 23 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 26553 place count 2370 transition count 7011
Free-agglomeration rule applied 1433 times with reduction of 802 identical transitions.
Iterating global reduction 9 with 1433 rules applied. Total rules applied 27986 place count 2370 transition count 4776
Reduce places removed 1433 places and 0 transitions.
Drop transitions removed 1807 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 1823 transitions.
Discarding 426 places :
Also discarding 684 output transitions
Drop transitions removed 684 transitions
Graph (complete) has 3451 edges and 937 vertex of which 511 are kept as prefixes of interest. Removing 426 places using SCC suffix rule.9 ms
Iterating post reduction 9 with 3257 rules applied. Total rules applied 31243 place count 511 transition count 2269
Drop transitions removed 527 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 551 transitions.
Iterating post reduction 10 with 551 rules applied. Total rules applied 31794 place count 511 transition count 1718
Symmetric choice reduction at 11 with 14 rule applications. Total rules 31808 place count 511 transition count 1718
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 56 transitions.
Iterating global reduction 11 with 28 rules applied. Total rules applied 31836 place count 497 transition count 1662
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 11 with 36 rules applied. Total rules applied 31872 place count 497 transition count 1626
Free-agglomeration rule applied 2 times.
Iterating global reduction 12 with 2 rules applied. Total rules applied 31874 place count 497 transition count 1624
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 31876 place count 495 transition count 1624
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 13 with 6 rules applied. Total rules applied 31882 place count 495 transition count 2088
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 459 transitions
Reduce isomorphic transitions removed 459 transitions.
Iterating post reduction 13 with 465 rules applied. Total rules applied 32347 place count 489 transition count 1629
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 14 with 4 rules applied. Total rules applied 32351 place count 489 transition count 1629
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 14 with 36 rules applied. Total rules applied 32387 place count 489 transition count 1593
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 32390 place count 486 transition count 1593
Symmetric choice reduction at 15 with 1 rule applications. Total rules 32391 place count 486 transition count 1593
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 32393 place count 485 transition count 1592
Symmetric choice reduction at 15 with 1 rule applications. Total rules 32394 place count 485 transition count 1592
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 78 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 32396 place count 484 transition count 1514
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 32397 place count 484 transition count 1513
Applied a total of 32397 rules in 7063 ms. Remains 484 /15015 variables (removed 14531) and now considering 1513/21341 (removed 19828) transitions.
Finished structural reductions, in 1 iterations. Remains : 484/15015 places, 1513/21341 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 6826 ms. (steps per millisecond=146 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1]
FORMULA DLCshifumi-PT-4b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4404 ms. (steps per millisecond=227 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4281 ms. (steps per millisecond=233 ) properties seen :[0, 1]
FORMULA DLCshifumi-PT-4b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2020-05-21 21:24:06] [INFO ] Flow matrix only has 215 transitions (discarded 1298 similar events)
// Phase 1: matrix 215 rows 484 cols
[2020-05-21 21:24:06] [INFO ] Computed 390 place invariants in 1 ms
[2020-05-21 21:24:06] [INFO ] [Real]Absence check using 390 positive place invariants in 124 ms returned unsat
FORMULA DLCshifumi-PT-4b-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
All properties solved without resorting to model-checking.

BK_STOP 1590096246686

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="DLCshifumi-PT-4b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 DLCshifumi-PT-4b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r066-tajo-158922813700047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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