Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 9.2K Apr 29 16:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 29 16:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 29 16:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 29 16:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K May 9 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 9 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 29 16:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 200K Apr 29 16:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 29 16:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 29 16:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 9 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 544K 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

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

=== Now, execution of the tool begins

BK_START 1654187996725

Running Version 202205111006
[2022-06-02 16:39:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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, 3600]
[2022-06-02 16:39:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 16:39:59] [INFO ] Load time of PNML (sax parser for PT used): 262 ms
[2022-06-02 16:39:59] [INFO ] Transformed 998 places.
[2022-06-02 16:39:59] [INFO ] Transformed 922 transitions.
[2022-06-02 16:39:59] [INFO ] Parsed PT model containing 998 places and 922 transitions in 445 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 46 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 10 resets, run finished after 1056 ms. (steps per millisecond=9 ) properties (out of 16) seen :5
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 922 rows 998 cols
[2022-06-02 16:40:01] [INFO ] Computed 76 place invariants in 36 ms
[2022-06-02 16:40:02] [INFO ] After 1054ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-06-02 16:40:03] [INFO ] [Nat]Absence check using 70 positive place invariants in 95 ms returned sat
[2022-06-02 16:40:03] [INFO ] [Nat]Absence check using 70 positive and 6 generalized place invariants in 10 ms returned sat
[2022-06-02 16:40:06] [INFO ] After 2917ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :2
[2022-06-02 16:40:07] [INFO ] Deduced a trap composed of 105 places in 565 ms of which 11 ms to minimize.
[2022-06-02 16:40:07] [INFO ] Deduced a trap composed of 15 places in 486 ms of which 3 ms to minimize.
[2022-06-02 16:40:08] [INFO ] Deduced a trap composed of 56 places in 807 ms of which 2 ms to minimize.
[2022-06-02 16:40:09] [INFO ] Deduced a trap composed of 36 places in 768 ms of which 3 ms to minimize.
[2022-06-02 16:40:10] [INFO ] Deduced a trap composed of 25 places in 603 ms of which 2 ms to minimize.
[2022-06-02 16:40:10] [INFO ] Deduced a trap composed of 103 places in 402 ms of which 1 ms to minimize.
[2022-06-02 16:40:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4164 ms
[2022-06-02 16:40:13] [INFO ] Deduced a trap composed of 61 places in 575 ms of which 2 ms to minimize.
[2022-06-02 16:40:14] [INFO ] Deduced a trap composed of 174 places in 492 ms of which 1 ms to minimize.
[2022-06-02 16:40:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1334 ms
[2022-06-02 16:40:14] [INFO ] After 10908ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :2
Attempting to minimize the solution found.
Minimization took 3091 ms.
[2022-06-02 16:40:17] [INFO ] After 14883ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :2
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1928 ms.
Support contains 83 out of 998 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 998/998 places, 922/922 transitions.
Graph (complete) has 1924 edges and 998 vertex of which 967 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.11 ms
Discarding 31 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 312 transitions
Trivial Post-agglo rules discarded 312 transitions
Performed 312 trivial Post agglomeration. Transition count delta: 312
Iterating post reduction 0 with 313 rules applied. Total rules applied 314 place count 967 transition count 609
Reduce places removed 312 places and 0 transitions.
Graph (complete) has 1213 edges and 655 vertex of which 581 are kept as prefixes of interest. Removing 74 places using SCC suffix rule.2 ms
Discarding 74 places :
Also discarding 0 output transitions
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 1 with 337 rules applied. Total rules applied 651 place count 581 transition count 585
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 2 with 98 rules applied. Total rules applied 749 place count 557 transition count 511
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 753 place count 553 transition count 507
Iterating global reduction 3 with 4 rules applied. Total rules applied 757 place count 553 transition count 507
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 760 place count 550 transition count 504
Iterating global reduction 3 with 3 rules applied. Total rules applied 763 place count 550 transition count 504
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 3 with 26 rules applied. Total rules applied 789 place count 550 transition count 478
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 815 place count 524 transition count 478
Reduce places removed 30 places and 30 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 845 place count 494 transition count 448
Applied a total of 845 rules in 384 ms. Remains 494 /998 variables (removed 504) and now considering 448/922 (removed 474) transitions.
Finished structural reductions, in 1 iterations. Remains : 494/998 places, 448/922 transitions.
Incomplete random walk after 1000000 steps, including 2198 resets, run finished after 14166 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 586 resets, run finished after 4932 ms. (steps per millisecond=202 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 616 resets, run finished after 3854 ms. (steps per millisecond=259 ) properties (out of 2) seen :1
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 448 rows 494 cols
[2022-06-02 16:40:42] [INFO ] Computed 46 place invariants in 11 ms
[2022-06-02 16:40:43] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 16:40:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 35 ms returned sat
[2022-06-02 16:40:43] [INFO ] [Nat]Absence check using 7 positive and 39 generalized place invariants in 106 ms returned sat
[2022-06-02 16:40:43] [INFO ] After 471ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 16:40:43] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-02 16:40:44] [INFO ] After 307ms SMT Verify possible using 27 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 16:40:44] [INFO ] After 499ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2022-06-02 16:40:44] [INFO ] After 1305ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 64 ms.
Support contains 13 out of 494 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 494/494 places, 448/448 transitions.
Graph (complete) has 961 edges and 494 vertex of which 447 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.1 ms
Discarding 47 places :
Also discarding 0 output transitions
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 92 rules applied. Total rules applied 93 place count 447 transition count 356
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 488 edges and 376 vertex of which 323 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.1 ms
Discarding 53 places :
Also discarding 31 output transitions
Drop transitions removed 31 transitions
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 1 with 181 rules applied. Total rules applied 274 place count 323 transition count 216
Reduce places removed 105 places and 0 transitions.
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 126 rules applied. Total rules applied 400 place count 218 transition count 195
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 403 place count 215 transition count 195
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 76 Pre rules applied. Total rules applied 403 place count 215 transition count 119
Deduced a syphon composed of 76 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 557 place count 137 transition count 119
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 559 place count 136 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 560 place count 135 transition count 118
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 560 place count 135 transition count 117
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 562 place count 134 transition count 117
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 563 place count 133 transition count 116
Iterating global reduction 6 with 1 rules applied. Total rules applied 564 place count 133 transition count 116
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 565 place count 133 transition count 115
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 221 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 7 with 2 rules applied. Total rules applied 567 place count 131 transition count 115
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 568 place count 131 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 570 place count 130 transition count 113
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 572 place count 130 transition count 111
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 5 rules applied. Total rules applied 577 place count 126 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 578 place count 125 transition count 110
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 14 Pre rules applied. Total rules applied 578 place count 125 transition count 96
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 11 with 28 rules applied. Total rules applied 606 place count 111 transition count 96
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 11 with 5 rules applied. Total rules applied 611 place count 106 transition count 91
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 11 with 19 rules applied. Total rules applied 630 place count 101 transition count 77
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 12 with 15 rules applied. Total rules applied 645 place count 87 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 646 place count 86 transition count 76
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 19 Pre rules applied. Total rules applied 646 place count 86 transition count 57
Renaming transitions due to excessive name length > 1024 char.
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 14 with 38 rules applied. Total rules applied 684 place count 67 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 685 place count 66 transition count 56
Applied a total of 685 rules in 91 ms. Remains 66 /494 variables (removed 428) and now considering 56/448 (removed 392) transitions.
Finished structural reductions, in 1 iterations. Remains : 66/494 places, 56/448 transitions.
Incomplete random walk after 1000000 steps, including 17543 resets, run finished after 1216 ms. (steps per millisecond=822 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6536 resets, run finished after 969 ms. (steps per millisecond=1031 ) properties (out of 1) seen :0
Finished probabilistic random walk after 27965 steps, run visited all 1 properties in 68 ms. (steps per millisecond=411 )
Probabilistic random walk after 27965 steps, saw 6346 distinct states, run finished after 68 ms. (steps per millisecond=411 ) properties seen :1
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 48348 ms.

BK_STOP 1654188047012

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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 3600 -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="HirschbergSinclair-PT-35"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 HirschbergSinclair-PT-35, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-smll-165264477500318"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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