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.r222-tall-165286025000286.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 ShieldIIPt-PT-020B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025000286
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 8.7K Apr 29 18:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 29 18:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 29 18:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 29 18:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 29 18:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 29 18:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 29 18:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 29 18:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 338K 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 ShieldIIPt-PT-020B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654268821530

Running Version 202205111006
[2022-06-03 15:07:02] [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-03 15:07:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 15:07:02] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2022-06-03 15:07:02] [INFO ] Transformed 1403 places.
[2022-06-03 15:07:02] [INFO ] Transformed 1303 transitions.
[2022-06-03 15:07:02] [INFO ] Found NUPN structural information;
[2022-06-03 15:07:02] [INFO ] Parsed PT model containing 1403 places and 1303 transitions in 284 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 506 ms. (steps per millisecond=19 ) properties (out of 16) seen :4
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :1
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1303 rows 1403 cols
[2022-06-03 15:07:03] [INFO ] Computed 181 place invariants in 21 ms
[2022-06-03 15:07:04] [INFO ] After 661ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-06-03 15:07:05] [INFO ] [Nat]Absence check using 181 positive place invariants in 61 ms returned sat
[2022-06-03 15:07:06] [INFO ] After 990ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :5
[2022-06-03 15:07:06] [INFO ] Deduced a trap composed of 26 places in 314 ms of which 5 ms to minimize.
[2022-06-03 15:07:07] [INFO ] Deduced a trap composed of 27 places in 302 ms of which 2 ms to minimize.
[2022-06-03 15:07:07] [INFO ] Deduced a trap composed of 18 places in 316 ms of which 2 ms to minimize.
[2022-06-03 15:07:07] [INFO ] Deduced a trap composed of 26 places in 275 ms of which 2 ms to minimize.
[2022-06-03 15:07:08] [INFO ] Deduced a trap composed of 25 places in 262 ms of which 1 ms to minimize.
[2022-06-03 15:07:08] [INFO ] Deduced a trap composed of 28 places in 261 ms of which 1 ms to minimize.
[2022-06-03 15:07:08] [INFO ] Deduced a trap composed of 22 places in 269 ms of which 1 ms to minimize.
[2022-06-03 15:07:09] [INFO ] Deduced a trap composed of 18 places in 260 ms of which 1 ms to minimize.
[2022-06-03 15:07:09] [INFO ] Deduced a trap composed of 24 places in 261 ms of which 1 ms to minimize.
[2022-06-03 15:07:09] [INFO ] Deduced a trap composed of 32 places in 273 ms of which 2 ms to minimize.
[2022-06-03 15:07:10] [INFO ] Deduced a trap composed of 25 places in 253 ms of which 0 ms to minimize.
[2022-06-03 15:07:10] [INFO ] Deduced a trap composed of 27 places in 241 ms of which 1 ms to minimize.
[2022-06-03 15:07:10] [INFO ] Deduced a trap composed of 45 places in 238 ms of which 1 ms to minimize.
[2022-06-03 15:07:10] [INFO ] Deduced a trap composed of 36 places in 232 ms of which 1 ms to minimize.
[2022-06-03 15:07:11] [INFO ] Deduced a trap composed of 33 places in 240 ms of which 0 ms to minimize.
[2022-06-03 15:07:11] [INFO ] Deduced a trap composed of 38 places in 230 ms of which 1 ms to minimize.
[2022-06-03 15:07:11] [INFO ] Deduced a trap composed of 29 places in 220 ms of which 0 ms to minimize.
[2022-06-03 15:07:12] [INFO ] Deduced a trap composed of 30 places in 221 ms of which 1 ms to minimize.
[2022-06-03 15:07:12] [INFO ] Deduced a trap composed of 38 places in 224 ms of which 1 ms to minimize.
[2022-06-03 15:07:12] [INFO ] Deduced a trap composed of 35 places in 212 ms of which 1 ms to minimize.
[2022-06-03 15:07:12] [INFO ] Deduced a trap composed of 30 places in 210 ms of which 0 ms to minimize.
[2022-06-03 15:07:13] [INFO ] Deduced a trap composed of 35 places in 206 ms of which 0 ms to minimize.
[2022-06-03 15:07:13] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 1 ms to minimize.
[2022-06-03 15:07:13] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 1 ms to minimize.
[2022-06-03 15:07:13] [INFO ] Deduced a trap composed of 38 places in 191 ms of which 1 ms to minimize.
[2022-06-03 15:07:14] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 1 ms to minimize.
[2022-06-03 15:07:14] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 1 ms to minimize.
[2022-06-03 15:07:14] [INFO ] Deduced a trap composed of 45 places in 182 ms of which 1 ms to minimize.
[2022-06-03 15:07:14] [INFO ] Deduced a trap composed of 40 places in 179 ms of which 0 ms to minimize.
[2022-06-03 15:07:15] [INFO ] Deduced a trap composed of 33 places in 196 ms of which 1 ms to minimize.
[2022-06-03 15:07:15] [INFO ] Deduced a trap composed of 39 places in 186 ms of which 1 ms to minimize.
[2022-06-03 15:07:15] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 1 ms to minimize.
[2022-06-03 15:07:15] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 9404 ms
[2022-06-03 15:07:16] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 1 ms to minimize.
[2022-06-03 15:07:16] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 3 ms to minimize.
[2022-06-03 15:07:16] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 1 ms to minimize.
[2022-06-03 15:07:16] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 1 ms to minimize.
[2022-06-03 15:07:17] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 1 ms to minimize.
[2022-06-03 15:07:17] [INFO ] Deduced a trap composed of 22 places in 183 ms of which 0 ms to minimize.
[2022-06-03 15:07:17] [INFO ] Deduced a trap composed of 24 places in 179 ms of which 1 ms to minimize.
[2022-06-03 15:07:17] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 2 ms to minimize.
[2022-06-03 15:07:18] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 1 ms to minimize.
[2022-06-03 15:07:18] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 1 ms to minimize.
[2022-06-03 15:07:18] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 0 ms to minimize.
[2022-06-03 15:07:18] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 1 ms to minimize.
[2022-06-03 15:07:19] [INFO ] Deduced a trap composed of 36 places in 152 ms of which 0 ms to minimize.
[2022-06-03 15:07:19] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 1 ms to minimize.
[2022-06-03 15:07:19] [INFO ] Deduced a trap composed of 36 places in 152 ms of which 1 ms to minimize.
[2022-06-03 15:07:19] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 0 ms to minimize.
[2022-06-03 15:07:19] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 0 ms to minimize.
[2022-06-03 15:07:20] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 1 ms to minimize.
[2022-06-03 15:07:20] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 1 ms to minimize.
[2022-06-03 15:07:21] [INFO ] Deduced a trap composed of 26 places in 233 ms of which 1 ms to minimize.
[2022-06-03 15:07:21] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 1 ms to minimize.
[2022-06-03 15:07:21] [INFO ] Deduced a trap composed of 18 places in 239 ms of which 1 ms to minimize.
[2022-06-03 15:07:21] [INFO ] Deduced a trap composed of 26 places in 220 ms of which 0 ms to minimize.
[2022-06-03 15:07:22] [INFO ] Deduced a trap composed of 19 places in 216 ms of which 2 ms to minimize.
[2022-06-03 15:07:22] [INFO ] Deduced a trap composed of 25 places in 205 ms of which 1 ms to minimize.
[2022-06-03 15:07:22] [INFO ] Deduced a trap composed of 34 places in 198 ms of which 1 ms to minimize.
[2022-06-03 15:07:23] [INFO ] Deduced a trap composed of 28 places in 202 ms of which 1 ms to minimize.
[2022-06-03 15:07:23] [INFO ] Deduced a trap composed of 35 places in 204 ms of which 1 ms to minimize.
[2022-06-03 15:07:23] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 0 ms to minimize.
[2022-06-03 15:07:23] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 1 ms to minimize.
[2022-06-03 15:07:23] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 1 ms to minimize.
[2022-06-03 15:07:24] [INFO ] Deduced a trap composed of 33 places in 207 ms of which 1 ms to minimize.
[2022-06-03 15:07:24] [INFO ] Deduced a trap composed of 22 places in 200 ms of which 0 ms to minimize.
[2022-06-03 15:07:24] [INFO ] Deduced a trap composed of 30 places in 196 ms of which 2 ms to minimize.
[2022-06-03 15:07:25] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 1 ms to minimize.
[2022-06-03 15:07:25] [INFO ] Deduced a trap composed of 27 places in 195 ms of which 3 ms to minimize.
[2022-06-03 15:07:25] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 1 ms to minimize.
[2022-06-03 15:07:25] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 1 ms to minimize.
[2022-06-03 15:07:26] [INFO ] Deduced a trap composed of 28 places in 180 ms of which 0 ms to minimize.
[2022-06-03 15:07:26] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 1 ms to minimize.
[2022-06-03 15:07:26] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 0 ms to minimize.
[2022-06-03 15:07:26] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 0 ms to minimize.
[2022-06-03 15:07:26] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 1 ms to minimize.
[2022-06-03 15:07:27] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 1 ms to minimize.
[2022-06-03 15:07:27] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 1 ms to minimize.
[2022-06-03 15:07:27] [INFO ] Deduced a trap composed of 36 places in 149 ms of which 1 ms to minimize.
[2022-06-03 15:07:27] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 0 ms to minimize.
[2022-06-03 15:07:27] [INFO ] Deduced a trap composed of 46 places in 133 ms of which 1 ms to minimize.
[2022-06-03 15:07:28] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 1 ms to minimize.
[2022-06-03 15:07:28] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 1 ms to minimize.
[2022-06-03 15:07:28] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 0 ms to minimize.
[2022-06-03 15:07:28] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 1 ms to minimize.
[2022-06-03 15:07:28] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 12780 ms
[2022-06-03 15:07:28] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 1 ms to minimize.
[2022-06-03 15:07:29] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 1 ms to minimize.
[2022-06-03 15:07:29] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 1 ms to minimize.
[2022-06-03 15:07:29] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 1 ms to minimize.
[2022-06-03 15:07:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 823 ms
[2022-06-03 15:07:29] [INFO ] After 24507ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :4
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-06-03 15:07:29] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :4
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 7009 ms.
Support contains 47 out of 1403 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Drop transitions removed 310 transitions
Trivial Post-agglo rules discarded 310 transitions
Performed 310 trivial Post agglomeration. Transition count delta: 310
Iterating post reduction 0 with 310 rules applied. Total rules applied 310 place count 1403 transition count 993
Reduce places removed 310 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 320 rules applied. Total rules applied 630 place count 1093 transition count 983
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 639 place count 1084 transition count 983
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 82 Pre rules applied. Total rules applied 639 place count 1084 transition count 901
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 803 place count 1002 transition count 901
Discarding 130 places :
Symmetric choice reduction at 3 with 130 rule applications. Total rules 933 place count 872 transition count 771
Iterating global reduction 3 with 130 rules applied. Total rules applied 1063 place count 872 transition count 771
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 1063 place count 872 transition count 717
Deduced a syphon composed of 54 places in 3 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 1171 place count 818 transition count 717
Performed 321 Post agglomeration using F-continuation condition.Transition count delta: 321
Deduced a syphon composed of 321 places in 1 ms
Reduce places removed 321 places and 0 transitions.
Iterating global reduction 3 with 642 rules applied. Total rules applied 1813 place count 497 transition count 396
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 1915 place count 446 transition count 425
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1917 place count 446 transition count 423
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1919 place count 444 transition count 423
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 1937 place count 444 transition count 423
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1938 place count 443 transition count 422
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1939 place count 442 transition count 422
Applied a total of 1939 rules in 376 ms. Remains 442 /1403 variables (removed 961) and now considering 422/1303 (removed 881) transitions.
Finished structural reductions, in 1 iterations. Remains : 442/1403 places, 422/1303 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6441 ms. (steps per millisecond=155 ) properties (out of 5) seen :4
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2919 ms. (steps per millisecond=342 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 422 rows 442 cols
[2022-06-03 15:07:46] [INFO ] Computed 180 place invariants in 7 ms
[2022-06-03 15:07:46] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 15:07:46] [INFO ] [Nat]Absence check using 180 positive place invariants in 28 ms returned sat
[2022-06-03 15:07:46] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 15:07:46] [INFO ] State equation strengthened by 105 read => feed constraints.
[2022-06-03 15:07:46] [INFO ] After 126ms SMT Verify possible using 105 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 15:07:47] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2022-06-03 15:07:47] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2022-06-03 15:07:47] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2022-06-03 15:07:47] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2022-06-03 15:07:47] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2022-06-03 15:07:47] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2022-06-03 15:07:47] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2022-06-03 15:07:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 480 ms
[2022-06-03 15:07:47] [INFO ] After 671ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2022-06-03 15:07:47] [INFO ] After 993ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 143 ms.
Support contains 20 out of 442 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 442/442 places, 422/422 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 442 transition count 414
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 434 transition count 414
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 16 place count 434 transition count 411
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 431 transition count 411
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 59 place count 412 transition count 393
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 59 place count 412 transition count 392
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 411 transition count 392
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 67 place count 408 transition count 396
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 408 transition count 396
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 72 place count 405 transition count 393
Applied a total of 72 rules in 87 ms. Remains 405 /442 variables (removed 37) and now considering 393/422 (removed 29) transitions.
Finished structural reductions, in 1 iterations. Remains : 405/442 places, 393/422 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4158 ms. (steps per millisecond=240 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2905 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3953534 steps, run timeout after 21001 ms. (steps per millisecond=188 ) properties seen :{}
Probabilistic random walk after 3953534 steps, saw 2624502 distinct states, run finished after 21002 ms. (steps per millisecond=188 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 393 rows 405 cols
[2022-06-03 15:08:15] [INFO ] Computed 179 place invariants in 4 ms
[2022-06-03 15:08:15] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 15:08:15] [INFO ] [Nat]Absence check using 179 positive place invariants in 21 ms returned sat
[2022-06-03 15:08:16] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 15:08:16] [INFO ] State equation strengthened by 90 read => feed constraints.
[2022-06-03 15:08:16] [INFO ] After 285ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 15:08:16] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2022-06-03 15:08:16] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2022-06-03 15:08:16] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-06-03 15:08:16] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2022-06-03 15:08:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 340 ms
[2022-06-03 15:08:16] [INFO ] After 715ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2022-06-03 15:08:16] [INFO ] After 1030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 100 ms.
Support contains 20 out of 405 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 405/405 places, 393/393 transitions.
Applied a total of 0 rules in 19 ms. Remains 405 /405 variables (removed 0) and now considering 393/393 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 405/405 places, 393/393 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 405/405 places, 393/393 transitions.
Applied a total of 0 rules in 10 ms. Remains 405 /405 variables (removed 0) and now considering 393/393 (removed 0) transitions.
// Phase 1: matrix 393 rows 405 cols
[2022-06-03 15:08:17] [INFO ] Computed 179 place invariants in 1 ms
[2022-06-03 15:08:17] [INFO ] Implicit Places using invariants in 195 ms returned [392]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 197 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 404/405 places, 393/393 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 403 transition count 392
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 403 transition count 392
Applied a total of 2 rules in 13 ms. Remains 403 /404 variables (removed 1) and now considering 392/393 (removed 1) transitions.
// Phase 1: matrix 392 rows 403 cols
[2022-06-03 15:08:17] [INFO ] Computed 178 place invariants in 3 ms
[2022-06-03 15:08:17] [INFO ] Implicit Places using invariants in 178 ms returned []
// Phase 1: matrix 392 rows 403 cols
[2022-06-03 15:08:17] [INFO ] Computed 178 place invariants in 6 ms
[2022-06-03 15:08:17] [INFO ] State equation strengthened by 89 read => feed constraints.
[2022-06-03 15:08:18] [INFO ] Implicit Places using invariants and state equation in 711 ms returned []
Implicit Place search using SMT with State Equation took 891 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 403/405 places, 392/393 transitions.
Finished structural reductions, in 2 iterations. Remains : 403/405 places, 392/393 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4124 ms. (steps per millisecond=242 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2864 ms. (steps per millisecond=349 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3634951 steps, run timeout after 18001 ms. (steps per millisecond=201 ) properties seen :{}
Probabilistic random walk after 3634951 steps, saw 2422142 distinct states, run finished after 18001 ms. (steps per millisecond=201 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 392 rows 403 cols
[2022-06-03 15:08:43] [INFO ] Computed 178 place invariants in 2 ms
[2022-06-03 15:08:43] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 15:08:43] [INFO ] [Nat]Absence check using 178 positive place invariants in 20 ms returned sat
[2022-06-03 15:08:43] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 15:08:43] [INFO ] State equation strengthened by 89 read => feed constraints.
[2022-06-03 15:08:43] [INFO ] After 90ms SMT Verify possible using 89 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 15:08:43] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2022-06-03 15:08:43] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-06-03 15:08:43] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2022-06-03 15:08:43] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2022-06-03 15:08:43] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2022-06-03 15:08:44] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2022-06-03 15:08:44] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2022-06-03 15:08:44] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 528 ms
[2022-06-03 15:08:44] [INFO ] After 689ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 76 ms.
[2022-06-03 15:08:44] [INFO ] After 996ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 267 ms.
Support contains 20 out of 403 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 403/403 places, 392/392 transitions.
Applied a total of 0 rules in 14 ms. Remains 403 /403 variables (removed 0) and now considering 392/392 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 403/403 places, 392/392 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 403/403 places, 392/392 transitions.
Applied a total of 0 rules in 15 ms. Remains 403 /403 variables (removed 0) and now considering 392/392 (removed 0) transitions.
// Phase 1: matrix 392 rows 403 cols
[2022-06-03 15:08:44] [INFO ] Computed 178 place invariants in 2 ms
[2022-06-03 15:08:44] [INFO ] Implicit Places using invariants in 179 ms returned []
// Phase 1: matrix 392 rows 403 cols
[2022-06-03 15:08:44] [INFO ] Computed 178 place invariants in 3 ms
[2022-06-03 15:08:44] [INFO ] State equation strengthened by 89 read => feed constraints.
[2022-06-03 15:08:45] [INFO ] Implicit Places using invariants and state equation in 703 ms returned []
Implicit Place search using SMT with State Equation took 884 ms to find 0 implicit places.
[2022-06-03 15:08:45] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 392 rows 403 cols
[2022-06-03 15:08:45] [INFO ] Computed 178 place invariants in 2 ms
[2022-06-03 15:08:45] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 403/403 places, 392/392 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4128 ms. (steps per millisecond=242 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2892 ms. (steps per millisecond=345 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4165503 steps, run timeout after 21001 ms. (steps per millisecond=198 ) properties seen :{}
Probabilistic random walk after 4165503 steps, saw 2773454 distinct states, run finished after 21001 ms. (steps per millisecond=198 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 392 rows 403 cols
[2022-06-03 15:09:13] [INFO ] Computed 178 place invariants in 3 ms
[2022-06-03 15:09:13] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 15:09:13] [INFO ] [Nat]Absence check using 178 positive place invariants in 27 ms returned sat
[2022-06-03 15:09:13] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 15:09:13] [INFO ] State equation strengthened by 89 read => feed constraints.
[2022-06-03 15:09:14] [INFO ] After 91ms SMT Verify possible using 89 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 15:09:14] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 0 ms to minimize.
[2022-06-03 15:09:14] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2022-06-03 15:09:14] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2022-06-03 15:09:14] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 0 ms to minimize.
[2022-06-03 15:09:14] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2022-06-03 15:09:14] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2022-06-03 15:09:14] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2022-06-03 15:09:14] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 508 ms
[2022-06-03 15:09:14] [INFO ] After 673ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2022-06-03 15:09:14] [INFO ] After 997ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 265 ms.
Support contains 20 out of 403 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 403/403 places, 392/392 transitions.
Applied a total of 0 rules in 7 ms. Remains 403 /403 variables (removed 0) and now considering 392/392 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 403/403 places, 392/392 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 403/403 places, 392/392 transitions.
Applied a total of 0 rules in 7 ms. Remains 403 /403 variables (removed 0) and now considering 392/392 (removed 0) transitions.
// Phase 1: matrix 392 rows 403 cols
[2022-06-03 15:09:14] [INFO ] Computed 178 place invariants in 2 ms
[2022-06-03 15:09:15] [INFO ] Implicit Places using invariants in 186 ms returned []
// Phase 1: matrix 392 rows 403 cols
[2022-06-03 15:09:15] [INFO ] Computed 178 place invariants in 1 ms
[2022-06-03 15:09:15] [INFO ] State equation strengthened by 89 read => feed constraints.
[2022-06-03 15:09:15] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 881 ms to find 0 implicit places.
[2022-06-03 15:09:15] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 392 rows 403 cols
[2022-06-03 15:09:15] [INFO ] Computed 178 place invariants in 2 ms
[2022-06-03 15:09:16] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 403/403 places, 392/392 transitions.
Graph (trivial) has 89 edges and 403 vertex of which 2 / 403 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Partial Free-agglomeration rule applied 63 times.
Drop transitions removed 63 transitions
Iterating global reduction 0 with 63 rules applied. Total rules applied 64 place count 402 transition count 390
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 65 place count 402 transition count 389
Applied a total of 65 rules in 23 ms. Remains 402 /403 variables (removed 1) and now considering 389/392 (removed 3) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 389 rows 402 cols
[2022-06-03 15:09:16] [INFO ] Computed 178 place invariants in 2 ms
[2022-06-03 15:09:16] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 15:09:16] [INFO ] [Nat]Absence check using 178 positive place invariants in 20 ms returned sat
[2022-06-03 15:09:16] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 15:09:16] [INFO ] State equation strengthened by 62 read => feed constraints.
[2022-06-03 15:09:16] [INFO ] After 78ms SMT Verify possible using 62 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 15:09:16] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2022-06-03 15:09:16] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
[2022-06-03 15:09:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 180 ms
[2022-06-03 15:09:16] [INFO ] After 314ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2022-06-03 15:09:16] [INFO ] After 609ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-03 15:09:16] [INFO ] Flatten gal took : 76 ms
[2022-06-03 15:09:17] [INFO ] Flatten gal took : 34 ms
[2022-06-03 15:09:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4942681988456664417.gal : 19 ms
[2022-06-03 15:09:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14018748188215178565.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4942681988456664417.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14018748188215178565.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality14018748188215178565.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 109
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :109 after 651
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :651 after 26849
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :26849 after 27184
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :27184 after 28666
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :28666 after 65575
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :65575 after 167212
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :167212 after 1.76418e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.76418e+06 after 7.73362e+07
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :7.73362e+07 after 5.44147e+08
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :5.44147e+08 after 6.08798e+10
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :6.08798e+10 after 2.76147e+14
Detected timeout of ITS tools.
[2022-06-03 15:09:32] [INFO ] Flatten gal took : 30 ms
[2022-06-03 15:09:32] [INFO ] Applying decomposition
[2022-06-03 15:09:32] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13895359000638870630.txt' '-o' '/tmp/graph13895359000638870630.bin' '-w' '/tmp/graph13895359000638870630.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13895359000638870630.bin' '-l' '-1' '-v' '-w' '/tmp/graph13895359000638870630.weights' '-q' '0' '-e' '0.001'
[2022-06-03 15:09:32] [INFO ] Decomposing Gal with order
[2022-06-03 15:09:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 15:09:32] [INFO ] Removed a total of 227 redundant transitions.
[2022-06-03 15:09:32] [INFO ] Flatten gal took : 75 ms
[2022-06-03 15:09:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 43 ms.
[2022-06-03 15:09:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11081121638677389764.gal : 10 ms
[2022-06-03 15:09:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4893920488550133875.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11081121638677389764.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4893920488550133875.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality4893920488550133875.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 7
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :7 after 109
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :109 after 651
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :651 after 6.00482e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3.00606e+07 after 2.66208e+11
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.66208e+11 after 1.68122e+21
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin298211593989124888
[2022-06-03 15:09:47] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin298211593989124888
Running compilation step : cd /tmp/ltsmin298211593989124888;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 730 ms.
Running link step : cd /tmp/ltsmin298211593989124888;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin298211593989124888;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'ShieldIIPtPT020BReachabilityCardinality00==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-03 15:10:02] [INFO ] Flatten gal took : 23 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2589706589650507720
[2022-06-03 15:10:02] [INFO ] Computing symmetric may disable matrix : 392 transitions.
[2022-06-03 15:10:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 15:10:02] [INFO ] Computing symmetric may enable matrix : 392 transitions.
[2022-06-03 15:10:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 15:10:02] [INFO ] Flatten gal took : 22 ms
[2022-06-03 15:10:02] [INFO ] Applying decomposition
[2022-06-03 15:10:02] [INFO ] Input system was already deterministic with 392 transitions.
[2022-06-03 15:10:02] [INFO ] Flatten gal took : 44 ms
[2022-06-03 15:10:02] [INFO ] Computing Do-Not-Accords matrix : 392 transitions.
[2022-06-03 15:10:02] [INFO ] Computation of Completed DNA matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 15:10:02] [INFO ] Built C files in 125ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2589706589650507720
Running compilation step : cd /tmp/ltsmin2589706589650507720;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8490952504786900087.txt' '-o' '/tmp/graph8490952504786900087.bin' '-w' '/tmp/graph8490952504786900087.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8490952504786900087.bin' '-l' '-1' '-v' '-w' '/tmp/graph8490952504786900087.weights' '-q' '0' '-e' '0.001'
[2022-06-03 15:10:02] [INFO ] Decomposing Gal with order
[2022-06-03 15:10:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 15:10:02] [INFO ] Removed a total of 378 redundant transitions.
[2022-06-03 15:10:02] [INFO ] Flatten gal took : 63 ms
[2022-06-03 15:10:02] [INFO ] Ran tautology test, simplified 0 / 1 in 272 ms.
[2022-06-03 15:10:03] [INFO ] BMC solution for property ShieldIIPt-PT-020B-ReachabilityCardinality-00(UNSAT) depth K=0 took 19 ms
[2022-06-03 15:10:03] [INFO ] BMC solution for property ShieldIIPt-PT-020B-ReachabilityCardinality-00(UNSAT) depth K=1 took 15 ms
[2022-06-03 15:10:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 170 labels/synchronizations in 52 ms.
[2022-06-03 15:10:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10529903239449478341.gal : 18 ms
[2022-06-03 15:10:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17730026570719399152.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10529903239449478341.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17730026570719399152.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 392 rows 403 cols
[2022-06-03 15:10:03] [INFO ] Computed 178 place invariants in 1 ms
[2022-06-03 15:10:03] [INFO ] Computed 178 place invariants in 1 ms
Loading property file /tmp/ReachabilityCardinality17730026570719399152.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 37
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :166656 after 7.10708e+11
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :7.10708e+11 after 1.67974e+26
Compilation finished in 1051 ms.
Running link step : cd /tmp/ltsmin2589706589650507720;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin2589706589650507720;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPtPT020BReachabilityCardinality00==true'
[2022-06-03 15:10:04] [INFO ] Proved 403 variables to be positive in 813 ms
[2022-06-03 15:10:04] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-020B-ReachabilityCardinality-00
[2022-06-03 15:10:04] [INFO ] KInduction solution for property ShieldIIPt-PT-020B-ReachabilityCardinality-00(SAT) depth K=0 took 23 ms
[2022-06-03 15:10:04] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-020B-ReachabilityCardinality-00
[2022-06-03 15:10:04] [INFO ] KInduction solution for property ShieldIIPt-PT-020B-ReachabilityCardinality-00(SAT) depth K=1 took 424 ms
[2022-06-03 15:10:06] [INFO ] BMC solution for property ShieldIIPt-PT-020B-ReachabilityCardinality-00(UNSAT) depth K=2 took 3180 ms
[2022-06-03 15:10:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-020B-ReachabilityCardinality-00
[2022-06-03 15:10:20] [INFO ] KInduction solution for property ShieldIIPt-PT-020B-ReachabilityCardinality-00(SAT) depth K=2 took 15599 ms
[2022-06-03 15:11:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-020B-ReachabilityCardinality-00
[2022-06-03 15:11:08] [INFO ] KInduction solution for property ShieldIIPt-PT-020B-ReachabilityCardinality-00(SAT) depth K=3 took 48000 ms
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.67974e+26 after 2.76581e+42
[2022-06-03 15:12:58] [INFO ] BMC solution for property ShieldIIPt-PT-020B-ReachabilityCardinality-00(UNSAT) depth K=3 took 171856 ms
[2022-06-03 15:13:27] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-020B-ReachabilityCardinality-00
[2022-06-03 15:13:27] [INFO ] KInduction solution for property ShieldIIPt-PT-020B-ReachabilityCardinality-00(SAT) depth K=4 took 139761 ms
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.26175e+58,107.687,1055384,640,56,1.68937e+06,1092,859,6.13258e+06,116,11461,0
Total reachable state count : 1.261754643370490237400883876027962874901e+58

Verifying 1 reachability properties.
Invariant property ShieldIIPt-PT-020B-ReachabilityCardinality-00 is true.
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-020B-ReachabilityCardinality-00,0,107.73,1055384,1,0,1.68937e+06,1092,895,6.13258e+06,124,11461,807
[2022-06-03 15:14:59] [WARNING] Interrupting SMT solver.
[2022-06-03 15:14:59] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-03 15:14:59] [WARNING] Unexpected error occurred while running SMT. Was verifying ShieldIIPt-PT-020B-ReachabilityCardinality-00 SMT depth 4
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:411)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
... 2 more
[2022-06-03 15:14:59] [INFO ] During BMC, SMT solver timed out at depth 4
[2022-06-03 15:14:59] [INFO ] BMC solving timed out (3600000 secs) at depth 4
[2022-06-03 15:14:59] [WARNING] Unexpected error occurred while running SMT. Was verifying ShieldIIPt-PT-020B-ReachabilityCardinality-00 K-induction depth 5
Exception in thread "Thread-10" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:344)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
... 2 more
[2022-06-03 15:14:59] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 477268 ms.

BK_STOP 1654269299960

--------------------
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="ShieldIIPt-PT-020B"
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 ShieldIIPt-PT-020B, 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 r222-tall-165286025000286"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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