fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r373-tall-171683788800219
Last Updated
July 7, 2024

About the Execution of 2023-gold for ShieldIIPt-PT-100B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1754.575 131008.00 168641.00 657.80 TTTFFFFTTTTTFTTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r373-tall-171683788800219.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldIIPt-PT-100B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683788800219
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 20:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 12 20:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 12 20:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 20:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.7M May 18 16:43 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-100B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716959256410

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-100B
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-29 05:07:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 05:07:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 05:07:38] [INFO ] Load time of PNML (sax parser for PT used): 267 ms
[2024-05-29 05:07:38] [INFO ] Transformed 7003 places.
[2024-05-29 05:07:38] [INFO ] Transformed 6503 transitions.
[2024-05-29 05:07:38] [INFO ] Found NUPN structural information;
[2024-05-29 05:07:38] [INFO ] Parsed PT model containing 7003 places and 6503 transitions and 16206 arcs in 588 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 695 ms. (steps per millisecond=14 ) properties (out of 13) seen :3
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 6503 rows 7003 cols
[2024-05-29 05:07:40] [INFO ] Computed 901 invariants in 65 ms
[2024-05-29 05:07:42] [INFO ] After 2130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-29 05:07:45] [INFO ] [Nat]Absence check using 901 positive place invariants in 647 ms returned sat
[2024-05-29 05:08:07] [INFO ] After 21398ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-29 05:08:07] [INFO ] After 21414ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-29 05:08:07] [INFO ] After 25060ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 129 out of 7003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7003/7003 places, 6503/6503 transitions.
Drop transitions removed 1614 transitions
Trivial Post-agglo rules discarded 1614 transitions
Performed 1614 trivial Post agglomeration. Transition count delta: 1614
Iterating post reduction 0 with 1614 rules applied. Total rules applied 1614 place count 7003 transition count 4889
Reduce places removed 1614 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1616 rules applied. Total rules applied 3230 place count 5389 transition count 4887
Reduce places removed 1 places and 0 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 2 with 24 rules applied. Total rules applied 3254 place count 5388 transition count 4864
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 3277 place count 5365 transition count 4864
Performed 414 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 414 Pre rules applied. Total rules applied 3277 place count 5365 transition count 4450
Deduced a syphon composed of 414 places in 23 ms
Reduce places removed 414 places and 0 transitions.
Iterating global reduction 4 with 828 rules applied. Total rules applied 4105 place count 4951 transition count 4450
Discarding 673 places :
Symmetric choice reduction at 4 with 673 rule applications. Total rules 4778 place count 4278 transition count 3777
Iterating global reduction 4 with 673 rules applied. Total rules applied 5451 place count 4278 transition count 3777
Performed 280 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 280 Pre rules applied. Total rules applied 5451 place count 4278 transition count 3497
Deduced a syphon composed of 280 places in 19 ms
Reduce places removed 280 places and 0 transitions.
Iterating global reduction 4 with 560 rules applied. Total rules applied 6011 place count 3998 transition count 3497
Performed 1636 Post agglomeration using F-continuation condition.Transition count delta: 1636
Deduced a syphon composed of 1636 places in 16 ms
Reduce places removed 1636 places and 0 transitions.
Iterating global reduction 4 with 3272 rules applied. Total rules applied 9283 place count 2362 transition count 1861
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 9485 place count 2261 transition count 1920
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 9687 place count 2160 transition count 1980
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 81 places in 5 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 4 with 162 rules applied. Total rules applied 9849 place count 2079 transition count 2029
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 9850 place count 2079 transition count 2028
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 9855 place count 2079 transition count 2023
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 9860 place count 2074 transition count 2023
Partial Free-agglomeration rule applied 95 times.
Drop transitions removed 95 transitions
Iterating global reduction 6 with 95 rules applied. Total rules applied 9955 place count 2074 transition count 2023
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 9956 place count 2073 transition count 2022
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 9958 place count 2071 transition count 2022
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 9958 place count 2071 transition count 2021
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 9960 place count 2070 transition count 2021
Applied a total of 9960 rules in 2644 ms. Remains 2070 /7003 variables (removed 4933) and now considering 2021/6503 (removed 4482) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2646 ms. Remains : 2070/7003 places, 2021/6503 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 10) seen :1
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2021 rows 2070 cols
[2024-05-29 05:08:11] [INFO ] Computed 899 invariants in 11 ms
[2024-05-29 05:08:12] [INFO ] After 439ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-29 05:08:12] [INFO ] [Nat]Absence check using 899 positive place invariants in 180 ms returned sat
[2024-05-29 05:08:14] [INFO ] After 1748ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-29 05:08:14] [INFO ] State equation strengthened by 635 read => feed constraints.
[2024-05-29 05:08:18] [INFO ] After 3577ms SMT Verify possible using 635 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-05-29 05:08:18] [INFO ] Deduced a trap composed of 5 places in 261 ms of which 8 ms to minimize.
[2024-05-29 05:08:19] [INFO ] Deduced a trap composed of 7 places in 246 ms of which 2 ms to minimize.
[2024-05-29 05:08:19] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 2 ms to minimize.
[2024-05-29 05:08:19] [INFO ] Deduced a trap composed of 4 places in 235 ms of which 0 ms to minimize.
[2024-05-29 05:08:20] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 2 ms to minimize.
[2024-05-29 05:08:20] [INFO ] Deduced a trap composed of 9 places in 242 ms of which 1 ms to minimize.
[2024-05-29 05:08:20] [INFO ] Deduced a trap composed of 8 places in 247 ms of which 2 ms to minimize.
[2024-05-29 05:08:21] [INFO ] Deduced a trap composed of 5 places in 231 ms of which 0 ms to minimize.
[2024-05-29 05:08:21] [INFO ] Deduced a trap composed of 7 places in 226 ms of which 0 ms to minimize.
[2024-05-29 05:08:21] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3009 ms
[2024-05-29 05:08:22] [INFO ] Deduced a trap composed of 6 places in 236 ms of which 1 ms to minimize.
[2024-05-29 05:08:22] [INFO ] Deduced a trap composed of 8 places in 229 ms of which 0 ms to minimize.
[2024-05-29 05:08:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 721 ms
[2024-05-29 05:08:22] [INFO ] Deduced a trap composed of 7 places in 218 ms of which 1 ms to minimize.
[2024-05-29 05:08:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 366 ms
[2024-05-29 05:08:23] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 1 ms to minimize.
[2024-05-29 05:08:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 360 ms
[2024-05-29 05:08:24] [INFO ] Deduced a trap composed of 5 places in 289 ms of which 1 ms to minimize.
[2024-05-29 05:08:24] [INFO ] Deduced a trap composed of 5 places in 313 ms of which 1 ms to minimize.
[2024-05-29 05:08:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 840 ms
[2024-05-29 05:08:25] [INFO ] Deduced a trap composed of 3 places in 284 ms of which 1 ms to minimize.
[2024-05-29 05:08:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 428 ms
[2024-05-29 05:08:27] [INFO ] Deduced a trap composed of 8 places in 231 ms of which 1 ms to minimize.
[2024-05-29 05:08:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 403 ms
[2024-05-29 05:08:28] [INFO ] Deduced a trap composed of 3 places in 225 ms of which 1 ms to minimize.
[2024-05-29 05:08:28] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 1 ms to minimize.
[2024-05-29 05:08:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 688 ms
[2024-05-29 05:08:28] [INFO ] After 13613ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 3546 ms.
[2024-05-29 05:08:32] [INFO ] After 19875ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 431 ms.
Support contains 80 out of 2070 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2070/2070 places, 2021/2021 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 2070 transition count 2008
Reduce places removed 13 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 15 rules applied. Total rules applied 28 place count 2057 transition count 2006
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 30 place count 2055 transition count 2006
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 30 place count 2055 transition count 2001
Deduced a syphon composed of 5 places in 6 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 40 place count 2050 transition count 2001
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 2049 transition count 2000
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 2049 transition count 2000
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 5 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 108 place count 2016 transition count 1967
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 118 place count 2011 transition count 1969
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 2011 transition count 1968
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 120 place count 2010 transition count 1968
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 125 place count 2010 transition count 1968
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 129 place count 2006 transition count 1964
Applied a total of 129 rules in 414 ms. Remains 2006 /2070 variables (removed 64) and now considering 1964/2021 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 414 ms. Remains : 2006/2070 places, 1964/2021 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 73261 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73261 steps, saw 66754 distinct states, run finished after 3002 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1964 rows 2006 cols
[2024-05-29 05:08:37] [INFO ] Computed 899 invariants in 6 ms
[2024-05-29 05:08:37] [INFO ] After 434ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-29 05:08:38] [INFO ] [Nat]Absence check using 899 positive place invariants in 166 ms returned sat
[2024-05-29 05:08:40] [INFO ] After 1633ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-29 05:08:40] [INFO ] State equation strengthened by 257 read => feed constraints.
[2024-05-29 05:08:41] [INFO ] After 1583ms SMT Verify possible using 257 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-05-29 05:08:42] [INFO ] Deduced a trap composed of 3 places in 198 ms of which 0 ms to minimize.
[2024-05-29 05:08:42] [INFO ] Deduced a trap composed of 5 places in 176 ms of which 1 ms to minimize.
[2024-05-29 05:08:42] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 1 ms to minimize.
[2024-05-29 05:08:42] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 0 ms to minimize.
[2024-05-29 05:08:43] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 0 ms to minimize.
[2024-05-29 05:08:43] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 1 ms to minimize.
[2024-05-29 05:08:43] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 1 ms to minimize.
[2024-05-29 05:08:43] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 0 ms to minimize.
[2024-05-29 05:08:43] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2054 ms
[2024-05-29 05:08:44] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 1 ms to minimize.
[2024-05-29 05:08:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 310 ms
[2024-05-29 05:08:45] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 1 ms to minimize.
[2024-05-29 05:08:46] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 0 ms to minimize.
[2024-05-29 05:08:46] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 0 ms to minimize.
[2024-05-29 05:08:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1365 ms
[2024-05-29 05:08:47] [INFO ] After 6986ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1721 ms.
[2024-05-29 05:08:49] [INFO ] After 11311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 608 ms.
Support contains 80 out of 2006 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2006/2006 places, 1964/1964 transitions.
Applied a total of 0 rules in 56 ms. Remains 2006 /2006 variables (removed 0) and now considering 1964/1964 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 2006/2006 places, 1964/1964 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2006/2006 places, 1964/1964 transitions.
Applied a total of 0 rules in 53 ms. Remains 2006 /2006 variables (removed 0) and now considering 1964/1964 (removed 0) transitions.
[2024-05-29 05:08:49] [INFO ] Invariant cache hit.
[2024-05-29 05:08:51] [INFO ] Implicit Places using invariants in 1473 ms returned [1995]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1483 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2005/2006 places, 1964/1964 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 2004 transition count 1963
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2004 transition count 1963
Applied a total of 2 rules in 107 ms. Remains 2004 /2005 variables (removed 1) and now considering 1963/1964 (removed 1) transitions.
// Phase 1: matrix 1963 rows 2004 cols
[2024-05-29 05:08:51] [INFO ] Computed 898 invariants in 14 ms
[2024-05-29 05:08:52] [INFO ] Implicit Places using invariants in 1627 ms returned []
[2024-05-29 05:08:52] [INFO ] Invariant cache hit.
[2024-05-29 05:08:54] [INFO ] State equation strengthened by 256 read => feed constraints.
[2024-05-29 05:08:59] [INFO ] Implicit Places using invariants and state equation in 6807 ms returned []
Implicit Place search using SMT with State Equation took 8450 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2004/2006 places, 1963/1964 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 10101 ms. Remains : 2004/2006 places, 1963/1964 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 92022 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92022 steps, saw 85377 distinct states, run finished after 3002 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 9 properties.
[2024-05-29 05:09:04] [INFO ] Invariant cache hit.
[2024-05-29 05:09:04] [INFO ] After 557ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-29 05:09:05] [INFO ] [Nat]Absence check using 898 positive place invariants in 180 ms returned sat
[2024-05-29 05:09:07] [INFO ] After 1751ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-29 05:09:07] [INFO ] State equation strengthened by 256 read => feed constraints.
[2024-05-29 05:09:09] [INFO ] After 2151ms SMT Verify possible using 256 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-05-29 05:09:10] [INFO ] Deduced a trap composed of 6 places in 195 ms of which 1 ms to minimize.
[2024-05-29 05:09:10] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 0 ms to minimize.
[2024-05-29 05:09:10] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 0 ms to minimize.
[2024-05-29 05:09:10] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 1 ms to minimize.
[2024-05-29 05:09:11] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 0 ms to minimize.
[2024-05-29 05:09:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1429 ms
[2024-05-29 05:09:12] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 1 ms to minimize.
[2024-05-29 05:09:12] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 1 ms to minimize.
[2024-05-29 05:09:12] [INFO ] Deduced a trap composed of 7 places in 206 ms of which 0 ms to minimize.
[2024-05-29 05:09:12] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 1 ms to minimize.
[2024-05-29 05:09:13] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2024-05-29 05:09:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1401 ms
[2024-05-29 05:09:13] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 0 ms to minimize.
[2024-05-29 05:09:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 361 ms
[2024-05-29 05:09:14] [INFO ] Deduced a trap composed of 6 places in 203 ms of which 1 ms to minimize.
[2024-05-29 05:09:14] [INFO ] Deduced a trap composed of 7 places in 212 ms of which 1 ms to minimize.
[2024-05-29 05:09:15] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 1 ms to minimize.
[2024-05-29 05:09:15] [INFO ] Deduced a trap composed of 7 places in 201 ms of which 0 ms to minimize.
[2024-05-29 05:09:15] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 0 ms to minimize.
[2024-05-29 05:09:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1486 ms
[2024-05-29 05:09:16] [INFO ] After 8411ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 2295 ms.
[2024-05-29 05:09:18] [INFO ] After 13465ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 475 ms.
Support contains 80 out of 2004 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2004/2004 places, 1963/1963 transitions.
Applied a total of 0 rules in 54 ms. Remains 2004 /2004 variables (removed 0) and now considering 1963/1963 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 2004/2004 places, 1963/1963 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2004/2004 places, 1963/1963 transitions.
Applied a total of 0 rules in 52 ms. Remains 2004 /2004 variables (removed 0) and now considering 1963/1963 (removed 0) transitions.
[2024-05-29 05:09:19] [INFO ] Invariant cache hit.
[2024-05-29 05:09:20] [INFO ] Implicit Places using invariants in 1609 ms returned []
[2024-05-29 05:09:20] [INFO ] Invariant cache hit.
[2024-05-29 05:09:21] [INFO ] State equation strengthened by 256 read => feed constraints.
[2024-05-29 05:09:27] [INFO ] Implicit Places using invariants and state equation in 6927 ms returned []
Implicit Place search using SMT with State Equation took 8543 ms to find 0 implicit places.
[2024-05-29 05:09:27] [INFO ] Redundant transitions in 129 ms returned []
[2024-05-29 05:09:27] [INFO ] Invariant cache hit.
[2024-05-29 05:09:29] [INFO ] Dead Transitions using invariants and state equation in 1351 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10107 ms. Remains : 2004/2004 places, 1963/1963 transitions.
Partial Free-agglomeration rule applied 269 times.
Drop transitions removed 269 transitions
Iterating global reduction 0 with 269 rules applied. Total rules applied 269 place count 2004 transition count 1963
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 272 place count 2004 transition count 1960
Applied a total of 272 rules in 156 ms. Remains 2004 /2004 variables (removed 0) and now considering 1960/1963 (removed 3) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 1960 rows 2004 cols
[2024-05-29 05:09:29] [INFO ] Computed 898 invariants in 14 ms
[2024-05-29 05:09:29] [INFO ] After 623ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-29 05:09:30] [INFO ] [Nat]Absence check using 898 positive place invariants in 161 ms returned sat
[2024-05-29 05:09:32] [INFO ] After 1514ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-29 05:09:32] [INFO ] State equation strengthened by 249 read => feed constraints.
[2024-05-29 05:09:33] [INFO ] After 1040ms SMT Verify possible using 249 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-05-29 05:09:33] [INFO ] Deduced a trap composed of 3 places in 309 ms of which 3 ms to minimize.
[2024-05-29 05:09:34] [INFO ] Deduced a trap composed of 4 places in 280 ms of which 1 ms to minimize.
[2024-05-29 05:09:34] [INFO ] Deduced a trap composed of 5 places in 277 ms of which 1 ms to minimize.
[2024-05-29 05:09:34] [INFO ] Deduced a trap composed of 7 places in 271 ms of which 0 ms to minimize.
[2024-05-29 05:09:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1489 ms
[2024-05-29 05:09:35] [INFO ] Deduced a trap composed of 3 places in 336 ms of which 1 ms to minimize.
[2024-05-29 05:09:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 487 ms
[2024-05-29 05:09:36] [INFO ] Deduced a trap composed of 5 places in 295 ms of which 9 ms to minimize.
[2024-05-29 05:09:36] [INFO ] Deduced a trap composed of 4 places in 294 ms of which 1 ms to minimize.
[2024-05-29 05:09:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 796 ms
[2024-05-29 05:09:37] [INFO ] Deduced a trap composed of 5 places in 223 ms of which 0 ms to minimize.
[2024-05-29 05:09:37] [INFO ] Deduced a trap composed of 8 places in 251 ms of which 0 ms to minimize.
[2024-05-29 05:09:38] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 0 ms to minimize.
[2024-05-29 05:09:38] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 1 ms to minimize.
[2024-05-29 05:09:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1379 ms
[2024-05-29 05:09:38] [INFO ] Deduced a trap composed of 5 places in 231 ms of which 1 ms to minimize.
[2024-05-29 05:09:39] [INFO ] Deduced a trap composed of 8 places in 233 ms of which 1 ms to minimize.
[2024-05-29 05:09:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 677 ms
[2024-05-29 05:09:39] [INFO ] After 7124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1351 ms.
[2024-05-29 05:09:40] [INFO ] After 10886ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
[2024-05-29 05:09:40] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2024-05-29 05:09:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2004 places, 1963 transitions and 9588 arcs took 12 ms.
[2024-05-29 05:09:41] [INFO ] Flatten gal took : 217 ms
Total runtime 122862 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPt-PT-100B
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
ReachabilityCardinality

FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2024-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2024-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2024-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2024-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716959387418

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 32 (type EXCL) for 6 ShieldIIPt-PT-100B-ReachabilityCardinality-2024-06
lola: time limit : 399 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 28 (type FNDP) for 6 ShieldIIPt-PT-100B-ReachabilityCardinality-2024-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 29 (type EQUN) for 6 ShieldIIPt-PT-100B-ReachabilityCardinality-2024-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 31 (type SRCH) for 6 ShieldIIPt-PT-100B-ReachabilityCardinality-2024-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 31 (type SRCH) for ShieldIIPt-PT-100B-ReachabilityCardinality-2024-06
lola: result : true
lola: markings : 109
lola: fired transitions : 108
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 28 (type FNDP) for ShieldIIPt-PT-100B-ReachabilityCardinality-2024-06 (obsolete)
lola: CANCELED task # 29 (type EQUN) for ShieldIIPt-PT-100B-ReachabilityCardinality-2024-06 (obsolete)
lola: CANCELED task # 32 (type EXCL) for ShieldIIPt-PT-100B-ReachabilityCardinality-2024-06 (obsolete)
lola: FINISHED task # 28 (type FNDP) for ShieldIIPt-PT-100B-ReachabilityCardinality-2024-06
lola: result : true
lola: fired transitions : 107
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 38 (type EXCL) for 9 ShieldIIPt-PT-100B-ReachabilityCardinality-2024-07
lola: time limit : 449 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 34 (type FNDP) for 9 ShieldIIPt-PT-100B-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 35 (type EQUN) for 9 ShieldIIPt-PT-100B-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 37 (type SRCH) for 9 ShieldIIPt-PT-100B-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 37 (type SRCH) for ShieldIIPt-PT-100B-ReachabilityCardinality-2024-07
lola: result : true
lola: markings : 149
lola: fired transitions : 148
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 34 (type FNDP) for ShieldIIPt-PT-100B-ReachabilityCardinality-2024-07 (obsolete)
lola: CANCELED task # 35 (type EQUN) for ShieldIIPt-PT-100B-ReachabilityCardinality-2024-07 (obsolete)
lola: CANCELED task # 38 (type EXCL) for ShieldIIPt-PT-100B-ReachabilityCardinality-2024-07 (obsolete)
lola: LAUNCH task # 51 (type EXCL) for 3 ShieldIIPt-PT-100B-ReachabilityCardinality-2024-05
lola: time limit : 513 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 53 (type FNDP) for 24 ShieldIIPt-PT-100B-ReachabilityCardinality-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 54 (type EQUN) for 24 ShieldIIPt-PT-100B-ReachabilityCardinality-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 56 (type SRCH) for 24 ShieldIIPt-PT-100B-ReachabilityCardinality-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/374/ReachabilityCardinality-29.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 34 (type FNDP) for ShieldIIPt-PT-100B-ReachabilityCardinality-2024-07
lola: result : true
lola: fired transitions : 147
lola: tried executions : 1
lola: time used : 1.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/374/ReachabilityCardinality-35.sara.
lola: FINISHED task # 53 (type FNDP) for ShieldIIPt-PT-100B-ReachabilityCardinality-2024-15
lola: result : true
lola: fired transitions : 135
lola: tried executions : 1
lola: time used : 1.000000
lola: memory pages used : 0
lola: CANCELED task # 54 (type EQUN) for ShieldIIPt-PT-100B-ReachabilityCardinality-2024-15 (obsolete)
lola: CANCELED task # 56 (type SRCH) for ShieldIIPt-PT-100B-ReachabilityCardinality-2024-15 (obsolete)
lola: LAUNCH task # 40 (type FNDP) for 15 ShieldIIPt-PT-100B-ReachabilityCardinality-2024-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 41 (type EQUN) for 15 ShieldIIPt-PT-100B-ReachabilityCardinality-2024-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 43 (type SRCH) for 15 ShieldIIPt-PT-100B-ReachabilityCardinality-2024-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 40 (type FNDP) for ShieldIIPt-PT-100B-ReachabilityCardinality-2024-11
lola: result : true
lola: fired transitions : 157
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 41 (type EQUN) for ShieldIIPt-PT-100B-ReachabilityCardinality-2024-11 (obsolete)
lola: CANCELED task # 43 (type SRCH) for ShieldIIPt-PT-100B-ReachabilityCardinality-2024-11 (obsolete)
lola: LAUNCH task # 66 (type FNDP) for 21 ShieldIIPt-PT-100B-ReachabilityCardinality-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 67 (type EQUN) for 21 ShieldIIPt-PT-100B-ReachabilityCardinality-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 69 (type SRCH) for 21 ShieldIIPt-PT-100B-ReachabilityCardinality-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 69 (type SRCH) for ShieldIIPt-PT-100B-ReachabilityCardinality-2024-13
lola: result : true
lola: markings : 107
lola: fired transitions : 106
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 66 (type FNDP) for ShieldIIPt-PT-100B-ReachabilityCardinality-2024-13 (obsolete)
lola: CANCELED task # 67 (type EQUN) for ShieldIIPt-PT-100B-ReachabilityCardinality-2024-13 (obsolete)
lola: LAUNCH task # 72 (type FNDP) for 12 ShieldIIPt-PT-100B-ReachabilityCardinality-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 73 (type EQUN) for 12 ShieldIIPt-PT-100B-ReachabilityCardinality-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 75 (type SRCH) for 12 ShieldIIPt-PT-100B-ReachabilityCardinality-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 66 (type FNDP) for ShieldIIPt-PT-100B-ReachabilityCardinality-2024-13
lola: result : true
lola: fired transitions : 105
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 72 (type FNDP) for ShieldIIPt-PT-100B-ReachabilityCardinality-2024-08
lola: result : true
lola: fired transitions : 62
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 73 (type EQUN) for ShieldIIPt-PT-100B-ReachabilityCardinality-2024-08 (obsolete)
lola: CANCELED task # 75 (type SRCH) for ShieldIIPt-PT-100B-ReachabilityCardinality-2024-08 (obsolete)
lola: LAUNCH task # 60 (type FNDP) for 18 ShieldIIPt-PT-100B-ReachabilityCardinality-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 61 (type EQUN) for 18 ShieldIIPt-PT-100B-ReachabilityCardinality-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 63 (type SRCH) for 18 ShieldIIPt-PT-100B-ReachabilityCardinality-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 60 (type FNDP) for ShieldIIPt-PT-100B-ReachabilityCardinality-2024-12
lola: result : true
lola: fired transitions : 107
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 61 (type EQUN) for ShieldIIPt-PT-100B-ReachabilityCardinality-2024-12 (obsolete)
lola: CANCELED task # 63 (type SRCH) for ShieldIIPt-PT-100B-ReachabilityCardinality-2024-12 (obsolete)
lola: LAUNCH task # 79 (type FNDP) for 0 ShieldIIPt-PT-100B-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 80 (type EQUN) for 0 ShieldIIPt-PT-100B-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 82 (type SRCH) for 0 ShieldIIPt-PT-100B-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
sara: try reading problem file /home/mcc/execution/374/ReachabilityCardinality-54.sara.
lola: FINISHED task # 79 (type FNDP) for ShieldIIPt-PT-100B-ReachabilityCardinality-2024-03
lola: result : true
lola: fired transitions : 174
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 80 (type EQUN) for ShieldIIPt-PT-100B-ReachabilityCardinality-2024-03 (obsolete)
lola: CANCELED task # 82 (type SRCH) for ShieldIIPt-PT-100B-ReachabilityCardinality-2024-03 (obsolete)
lola: LAUNCH task # 47 (type FNDP) for 3 ShieldIIPt-PT-100B-ReachabilityCardinality-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 48 (type EQUN) for 3 ShieldIIPt-PT-100B-ReachabilityCardinality-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 50 (type SRCH) for 3 ShieldIIPt-PT-100B-ReachabilityCardinality-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 50 (type SRCH) for ShieldIIPt-PT-100B-ReachabilityCardinality-2024-05
lola: result : true
lola: markings : 51
lola: fired transitions : 50
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 47 (type FNDP) for ShieldIIPt-PT-100B-ReachabilityCardinality-2024-05 (obsolete)
lola: CANCELED task # 48 (type EQUN) for ShieldIIPt-PT-100B-ReachabilityCardinality-2024-05 (obsolete)
lola: CANCELED task # 51 (type EXCL) for ShieldIIPt-PT-100B-ReachabilityCardinality-2024-05 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-100B-ReachabilityCardinality-2024-03: AG false findpath
ShieldIIPt-PT-100B-ReachabilityCardinality-2024-05: AG false tandem / insertion
ShieldIIPt-PT-100B-ReachabilityCardinality-2024-06: AG false tandem / insertion
ShieldIIPt-PT-100B-ReachabilityCardinality-2024-07: EF true tandem / insertion
ShieldIIPt-PT-100B-ReachabilityCardinality-2024-08: EF true findpath
ShieldIIPt-PT-100B-ReachabilityCardinality-2024-11: EF true findpath
ShieldIIPt-PT-100B-ReachabilityCardinality-2024-12: AG false findpath
ShieldIIPt-PT-100B-ReachabilityCardinality-2024-13: EF true tandem / insertion
ShieldIIPt-PT-100B-ReachabilityCardinality-2024-15: EF true findpath


Time elapsed: 5 secs. Pages in use: 3

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-100B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ShieldIIPt-PT-100B, 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 r373-tall-171683788800219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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