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.r006-tajo-165245688800111.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 ASLink-PT-07a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245688800111
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.8K Apr 30 07:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 30 07:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 30 07:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 07:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Apr 30 07:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 30 07:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 30 07:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 30 07:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 677K May 10 09:33 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 ASLink-PT-07a-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654264852763

Running Version 202205111006
[2022-06-03 14:00:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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-03 14:00:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 14:00:54] [INFO ] Load time of PNML (sax parser for PT used): 212 ms
[2022-06-03 14:00:54] [INFO ] Transformed 1601 places.
[2022-06-03 14:00:54] [INFO ] Transformed 2373 transitions.
[2022-06-03 14:00:54] [INFO ] Found NUPN structural information;
[2022-06-03 14:00:54] [INFO ] Parsed PT model containing 1601 places and 2373 transitions in 353 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
Incomplete random walk after 10000 steps, including 39 resets, run finished after 580 ms. (steps per millisecond=17 ) properties (out of 16) seen :6
FORMULA ASLink-PT-07a-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07a-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07a-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07a-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07a-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07a-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2348 rows 1601 cols
[2022-06-03 14:00:56] [INFO ] Computed 308 place invariants in 153 ms
[2022-06-03 14:00:57] [INFO ] [Real]Absence check using 75 positive place invariants in 25 ms returned sat
[2022-06-03 14:00:57] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 83 ms returned sat
[2022-06-03 14:00:57] [INFO ] After 883ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-03 14:00:57] [INFO ] [Nat]Absence check using 75 positive place invariants in 19 ms returned sat
[2022-06-03 14:00:57] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 62 ms returned sat
[2022-06-03 14:01:22] [INFO ] After 24192ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :3
[2022-06-03 14:01:22] [INFO ] After 24203ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :3
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-06-03 14:01:22] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :3
FORMULA ASLink-PT-07a-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-07a-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-07a-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-07a-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-07a-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 2 different solutions.
FORMULA ASLink-PT-07a-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-07a-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 11697 ms.
Support contains 12 out of 1601 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1601/1601 places, 2348/2348 transitions.
Ensure Unique test removed 28 places
Discarding 14 places :
Implicit places reduction removed 14 places
Drop transitions removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 186 rules applied. Total rules applied 186 place count 1559 transition count 2204
Reduce places removed 144 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 145 rules applied. Total rules applied 331 place count 1415 transition count 2203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 332 place count 1414 transition count 2203
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 148 Pre rules applied. Total rules applied 332 place count 1414 transition count 2055
Deduced a syphon composed of 148 places in 6 ms
Ensure Unique test removed 58 places
Reduce places removed 206 places and 0 transitions.
Iterating global reduction 3 with 354 rules applied. Total rules applied 686 place count 1208 transition count 2055
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 687 place count 1208 transition count 2054
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 688 place count 1207 transition count 2054
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 698 place count 1197 transition count 2001
Ensure Unique test removed 1 places
Iterating global reduction 5 with 11 rules applied. Total rules applied 709 place count 1196 transition count 2001
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 715 place count 1195 transition count 1996
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 718 place count 1192 transition count 1996
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 719 place count 1191 transition count 1988
Iterating global reduction 7 with 1 rules applied. Total rules applied 720 place count 1191 transition count 1988
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 721 place count 1190 transition count 1980
Iterating global reduction 7 with 1 rules applied. Total rules applied 722 place count 1190 transition count 1980
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 723 place count 1189 transition count 1972
Iterating global reduction 7 with 1 rules applied. Total rules applied 724 place count 1189 transition count 1972
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 725 place count 1188 transition count 1964
Iterating global reduction 7 with 1 rules applied. Total rules applied 726 place count 1188 transition count 1964
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 727 place count 1187 transition count 1956
Iterating global reduction 7 with 1 rules applied. Total rules applied 728 place count 1187 transition count 1956
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 729 place count 1186 transition count 1948
Iterating global reduction 7 with 1 rules applied. Total rules applied 730 place count 1186 transition count 1948
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 731 place count 1185 transition count 1940
Iterating global reduction 7 with 1 rules applied. Total rules applied 732 place count 1185 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 733 place count 1184 transition count 1932
Iterating global reduction 7 with 1 rules applied. Total rules applied 734 place count 1184 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 735 place count 1183 transition count 1924
Iterating global reduction 7 with 1 rules applied. Total rules applied 736 place count 1183 transition count 1924
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 737 place count 1182 transition count 1916
Iterating global reduction 7 with 1 rules applied. Total rules applied 738 place count 1182 transition count 1916
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 739 place count 1181 transition count 1908
Iterating global reduction 7 with 1 rules applied. Total rules applied 740 place count 1181 transition count 1908
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 741 place count 1180 transition count 1900
Iterating global reduction 7 with 1 rules applied. Total rules applied 742 place count 1180 transition count 1900
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 743 place count 1179 transition count 1892
Iterating global reduction 7 with 1 rules applied. Total rules applied 744 place count 1179 transition count 1892
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 745 place count 1178 transition count 1884
Iterating global reduction 7 with 1 rules applied. Total rules applied 746 place count 1178 transition count 1884
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 747 place count 1177 transition count 1876
Iterating global reduction 7 with 1 rules applied. Total rules applied 748 place count 1177 transition count 1876
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 749 place count 1176 transition count 1868
Iterating global reduction 7 with 1 rules applied. Total rules applied 750 place count 1176 transition count 1868
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 7 with 94 rules applied. Total rules applied 844 place count 1129 transition count 1821
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 850 place count 1129 transition count 1815
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 856 place count 1123 transition count 1815
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 864 place count 1123 transition count 1815
Applied a total of 864 rules in 1512 ms. Remains 1123 /1601 variables (removed 478) and now considering 1815/2348 (removed 533) transitions.
Finished structural reductions, in 1 iterations. Remains : 1123/1601 places, 1815/2348 transitions.
Incomplete random walk after 1000000 steps, including 8876 resets, run finished after 13545 ms. (steps per millisecond=73 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1302 resets, run finished after 2959 ms. (steps per millisecond=337 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1286 resets, run finished after 3355 ms. (steps per millisecond=298 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1338 resets, run finished after 3641 ms. (steps per millisecond=274 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 5767358 steps, run timeout after 69001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 5767358 steps, saw 1482560 distinct states, run finished after 69004 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1815 rows 1123 cols
[2022-06-03 14:03:08] [INFO ] Computed 206 place invariants in 78 ms
[2022-06-03 14:03:08] [INFO ] [Real]Absence check using 53 positive place invariants in 8 ms returned sat
[2022-06-03 14:03:08] [INFO ] [Real]Absence check using 53 positive and 153 generalized place invariants in 33 ms returned sat
[2022-06-03 14:03:08] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-03 14:03:08] [INFO ] [Nat]Absence check using 53 positive place invariants in 19 ms returned sat
[2022-06-03 14:03:08] [INFO ] [Nat]Absence check using 53 positive and 153 generalized place invariants in 34 ms returned sat
[2022-06-03 14:03:16] [INFO ] After 8129ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2022-06-03 14:03:16] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-03 14:03:25] [INFO ] After 9006ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :2 sat :0
[2022-06-03 14:03:25] [INFO ] After 17389ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
FORMULA ASLink-PT-07a-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-07a-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 30001 ms.
Support contains 2 out of 1123 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1123/1123 places, 1815/1815 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1123 transition count 1814
Deduced a syphon composed of 1 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1121 transition count 1814
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 1119 transition count 1812
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1119 transition count 1811
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 1118 transition count 1811
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 1117 transition count 1810
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 24 place count 1103 transition count 1810
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 24 place count 1103 transition count 1782
Deduced a syphon composed of 28 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 57 rules applied. Total rules applied 81 place count 1074 transition count 1782
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 2 with 8 rules applied. Total rules applied 89 place count 1066 transition count 1782
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 89 place count 1066 transition count 1781
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 1065 transition count 1781
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 107 place count 1057 transition count 1773
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 114 place count 1050 transition count 1766
Iterating global reduction 3 with 7 rules applied. Total rules applied 121 place count 1050 transition count 1766
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 128 place count 1050 transition count 1759
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 135 place count 1043 transition count 1759
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 142 place count 1043 transition count 1759
Applied a total of 142 rules in 812 ms. Remains 1043 /1123 variables (removed 80) and now considering 1759/1815 (removed 56) transitions.
Finished structural reductions, in 1 iterations. Remains : 1043/1123 places, 1759/1815 transitions.
Incomplete random walk after 1000000 steps, including 10839 resets, run finished after 3528 ms. (steps per millisecond=283 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1527 resets, run finished after 1572 ms. (steps per millisecond=636 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1499021 steps, run timeout after 15001 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 1499021 steps, saw 471990 distinct states, run finished after 15001 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1759 rows 1043 cols
[2022-06-03 14:04:16] [INFO ] Computed 182 place invariants in 41 ms
[2022-06-03 14:04:16] [INFO ] [Real]Absence check using 44 positive place invariants in 24 ms returned sat
[2022-06-03 14:04:16] [INFO ] [Real]Absence check using 44 positive and 138 generalized place invariants in 44 ms returned sat
[2022-06-03 14:04:17] [INFO ] After 890ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 14:04:17] [INFO ] [Nat]Absence check using 44 positive place invariants in 12 ms returned sat
[2022-06-03 14:04:17] [INFO ] [Nat]Absence check using 44 positive and 138 generalized place invariants in 40 ms returned sat
[2022-06-03 14:04:25] [INFO ] After 7791ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 14:04:34] [INFO ] After 16800ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-06-03 14:04:34] [INFO ] After 17014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Finished Parikh walk after 18487 steps, including 915 resets, run visited all 1 properties in 55 ms. (steps per millisecond=336 )
FORMULA ASLink-PT-07a-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 55 ms.
All properties solved without resorting to model-checking.
Total runtime 220697 ms.

BK_STOP 1654265074843

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="ASLink-PT-07a"
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"
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 ASLink-PT-07a, 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 r006-tajo-165245688800111"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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