Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r267-smll-167863541600302.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is NoC3x3-PT-5B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-167863541600302
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 980K
-rw-r--r-- 1 mcc users 5.5K Feb 26 10:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 10:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 10:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 10:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 10:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Feb 26 10:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 10:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 10:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 525K Mar 5 18:23 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 NoC3x3-PT-5B-ReachabilityCardinality-00
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-01
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-02
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-03
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-04
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-05
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-06
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-07
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-08
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-09
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-10
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-11
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-12
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-13
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-14
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678840717824

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-5B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-15 00:38:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 00:38:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 00:38:41] [INFO ] Load time of PNML (sax parser for PT used): 364 ms
[2023-03-15 00:38:41] [INFO ] Transformed 1571 places.
[2023-03-15 00:38:41] [INFO ] Transformed 2173 transitions.
[2023-03-15 00:38:41] [INFO ] Found NUPN structural information;
[2023-03-15 00:38:41] [INFO ] Parsed PT model containing 1571 places and 2173 transitions and 6109 arcs in 554 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 41 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 16 resets, run finished after 708 ms. (steps per millisecond=14 ) properties (out of 14) seen :10
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2173 rows 1571 cols
[2023-03-15 00:38:43] [INFO ] Computed 66 place invariants in 39 ms
[2023-03-15 00:38:44] [INFO ] After 1028ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-15 00:38:45] [INFO ] [Nat]Absence check using 66 positive place invariants in 108 ms returned sat
[2023-03-15 00:39:09] [INFO ] After 23697ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 00:39:09] [INFO ] After 23710ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-15 00:39:09] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 79 out of 1571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1571/1571 places, 2173/2173 transitions.
Drop transitions removed 283 transitions
Trivial Post-agglo rules discarded 283 transitions
Performed 283 trivial Post agglomeration. Transition count delta: 283
Iterating post reduction 0 with 283 rules applied. Total rules applied 283 place count 1571 transition count 1890
Reduce places removed 283 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 305 rules applied. Total rules applied 588 place count 1288 transition count 1868
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 610 place count 1266 transition count 1868
Discarding 257 places :
Symmetric choice reduction at 3 with 257 rule applications. Total rules 867 place count 1009 transition count 1611
Iterating global reduction 3 with 257 rules applied. Total rules applied 1124 place count 1009 transition count 1611
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 1124 place count 1009 transition count 1580
Deduced a syphon composed of 31 places in 6 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 1186 place count 978 transition count 1580
Discarding 96 places :
Symmetric choice reduction at 3 with 96 rule applications. Total rules 1282 place count 882 transition count 1416
Iterating global reduction 3 with 96 rules applied. Total rules applied 1378 place count 882 transition count 1416
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 1425 place count 835 transition count 1317
Iterating global reduction 3 with 47 rules applied. Total rules applied 1472 place count 835 transition count 1317
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1487 place count 820 transition count 1287
Iterating global reduction 3 with 15 rules applied. Total rules applied 1502 place count 820 transition count 1287
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1505 place count 817 transition count 1281
Iterating global reduction 3 with 3 rules applied. Total rules applied 1508 place count 817 transition count 1281
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1510 place count 815 transition count 1277
Iterating global reduction 3 with 2 rules applied. Total rules applied 1512 place count 815 transition count 1277
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1513 place count 814 transition count 1274
Iterating global reduction 3 with 1 rules applied. Total rules applied 1514 place count 814 transition count 1274
Performed 158 Post agglomeration using F-continuation condition.Transition count delta: 158
Deduced a syphon composed of 158 places in 1 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 3 with 316 rules applied. Total rules applied 1830 place count 656 transition count 1116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1831 place count 656 transition count 1115
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1832 place count 655 transition count 1111
Iterating global reduction 4 with 1 rules applied. Total rules applied 1833 place count 655 transition count 1111
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2035 place count 554 transition count 1140
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2041 place count 554 transition count 1134
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 2083 place count 533 transition count 1137
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 5 with 58 rules applied. Total rules applied 2141 place count 533 transition count 1079
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 2147 place count 527 transition count 1079
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 2147 place count 527 transition count 1076
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 2153 place count 524 transition count 1076
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 2167 place count 517 transition count 1069
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 2177 place count 512 transition count 1071
Free-agglomeration rule applied 21 times.
Iterating global reduction 6 with 21 rules applied. Total rules applied 2198 place count 512 transition count 1050
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 2227 place count 491 transition count 1042
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 2237 place count 491 transition count 1032
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2239 place count 491 transition count 1030
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 2241 place count 489 transition count 1030
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 2243 place count 489 transition count 1028
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 2255 place count 489 transition count 1028
Applied a total of 2255 rules in 1518 ms. Remains 489 /1571 variables (removed 1082) and now considering 1028/2173 (removed 1145) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1519 ms. Remains : 489/1571 places, 1028/2173 transitions.
Incomplete random walk after 10000 steps, including 37 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 4) seen :1
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-15 00:39:11] [INFO ] Flow matrix only has 1018 transitions (discarded 10 similar events)
// Phase 1: matrix 1018 rows 489 cols
[2023-03-15 00:39:11] [INFO ] Computed 60 place invariants in 11 ms
[2023-03-15 00:39:11] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 00:39:11] [INFO ] [Nat]Absence check using 60 positive place invariants in 26 ms returned sat
[2023-03-15 00:39:12] [INFO ] After 1075ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 00:39:12] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-15 00:39:13] [INFO ] After 506ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 00:39:20] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 6 ms to minimize.
[2023-03-15 00:39:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2023-03-15 00:39:20] [INFO ] After 7504ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 468 ms.
[2023-03-15 00:39:20] [INFO ] After 9237ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 27 ms.
Support contains 65 out of 489 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 1028/1028 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 489 transition count 1025
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 486 transition count 1024
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 485 transition count 1024
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 9 place count 484 transition count 1021
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 484 transition count 1021
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 22 place count 478 transition count 1015
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 26 place count 474 transition count 1003
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 474 transition count 1003
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 40 place count 469 transition count 1015
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 469 transition count 1013
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 44 place count 469 transition count 1011
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 46 place count 467 transition count 1011
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 47 place count 466 transition count 1010
Applied a total of 47 rules in 170 ms. Remains 466 /489 variables (removed 23) and now considering 1010/1028 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 466/489 places, 1010/1028 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 126741 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 126741 steps, saw 87645 distinct states, run finished after 3003 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-15 00:39:24] [INFO ] Flow matrix only has 997 transitions (discarded 13 similar events)
// Phase 1: matrix 997 rows 466 cols
[2023-03-15 00:39:24] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-15 00:39:24] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 00:39:24] [INFO ] [Nat]Absence check using 60 positive place invariants in 23 ms returned sat
[2023-03-15 00:39:25] [INFO ] After 954ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 00:39:25] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-15 00:39:27] [INFO ] After 1777ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 00:39:28] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2023-03-15 00:39:28] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2023-03-15 00:39:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 390 ms
[2023-03-15 00:39:29] [INFO ] After 3461ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 481 ms.
[2023-03-15 00:39:29] [INFO ] After 5081ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 28 ms.
Support contains 65 out of 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 1010/1010 transitions.
Applied a total of 0 rules in 17 ms. Remains 466 /466 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 466/466 places, 1010/1010 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 1010/1010 transitions.
Applied a total of 0 rules in 15 ms. Remains 466 /466 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
[2023-03-15 00:39:29] [INFO ] Flow matrix only has 997 transitions (discarded 13 similar events)
[2023-03-15 00:39:29] [INFO ] Invariant cache hit.
[2023-03-15 00:39:30] [INFO ] Implicit Places using invariants in 653 ms returned [98]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 657 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 465/466 places, 1010/1010 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 465 transition count 1009
Applied a total of 1 rules in 39 ms. Remains 465 /465 variables (removed 0) and now considering 1009/1010 (removed 1) transitions.
[2023-03-15 00:39:30] [INFO ] Flow matrix only has 996 transitions (discarded 13 similar events)
// Phase 1: matrix 996 rows 465 cols
[2023-03-15 00:39:30] [INFO ] Computed 59 place invariants in 8 ms
[2023-03-15 00:39:30] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-15 00:39:30] [INFO ] Flow matrix only has 996 transitions (discarded 13 similar events)
[2023-03-15 00:39:30] [INFO ] Invariant cache hit.
[2023-03-15 00:39:31] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-15 00:39:31] [INFO ] Implicit Places using invariants and state equation in 1109 ms returned []
Implicit Place search using SMT with State Equation took 1503 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 465/466 places, 1009/1010 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2216 ms. Remains : 465/466 places, 1009/1010 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 146485 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 146485 steps, saw 104787 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-15 00:39:35] [INFO ] Flow matrix only has 996 transitions (discarded 13 similar events)
[2023-03-15 00:39:35] [INFO ] Invariant cache hit.
[2023-03-15 00:39:35] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 00:39:35] [INFO ] [Nat]Absence check using 59 positive place invariants in 25 ms returned sat
[2023-03-15 00:39:36] [INFO ] After 1188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 00:39:36] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-15 00:39:37] [INFO ] After 690ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 00:39:37] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2023-03-15 00:39:38] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2023-03-15 00:39:38] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2023-03-15 00:39:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 340 ms
[2023-03-15 00:39:38] [INFO ] After 1468ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 393 ms.
[2023-03-15 00:39:38] [INFO ] After 3263ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 38 ms.
Support contains 65 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1009/1009 transitions.
Applied a total of 0 rules in 21 ms. Remains 465 /465 variables (removed 0) and now considering 1009/1009 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 465/465 places, 1009/1009 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1009/1009 transitions.
Applied a total of 0 rules in 20 ms. Remains 465 /465 variables (removed 0) and now considering 1009/1009 (removed 0) transitions.
[2023-03-15 00:39:38] [INFO ] Flow matrix only has 996 transitions (discarded 13 similar events)
[2023-03-15 00:39:38] [INFO ] Invariant cache hit.
[2023-03-15 00:39:39] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-03-15 00:39:39] [INFO ] Flow matrix only has 996 transitions (discarded 13 similar events)
[2023-03-15 00:39:39] [INFO ] Invariant cache hit.
[2023-03-15 00:39:39] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-15 00:39:40] [INFO ] Implicit Places using invariants and state equation in 1168 ms returned []
Implicit Place search using SMT with State Equation took 1527 ms to find 0 implicit places.
[2023-03-15 00:39:40] [INFO ] Redundant transitions in 90 ms returned []
[2023-03-15 00:39:40] [INFO ] Flow matrix only has 996 transitions (discarded 13 similar events)
[2023-03-15 00:39:40] [INFO ] Invariant cache hit.
[2023-03-15 00:39:41] [INFO ] Dead Transitions using invariants and state equation in 1013 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2670 ms. Remains : 465/465 places, 1009/1009 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 465 transition count 996
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 31 place count 465 transition count 978
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 463 transition count 972
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 463 transition count 972
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 463 transition count 972
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 463 transition count 971
Applied a total of 40 rules in 53 ms. Remains 463 /465 variables (removed 2) and now considering 971/1009 (removed 38) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 971 rows 463 cols
[2023-03-15 00:39:41] [INFO ] Computed 59 place invariants in 14 ms
[2023-03-15 00:39:41] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 00:39:41] [INFO ] [Nat]Absence check using 59 positive place invariants in 19 ms returned sat
[2023-03-15 00:39:42] [INFO ] After 758ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 00:39:42] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 3 ms to minimize.
[2023-03-15 00:39:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2023-03-15 00:39:43] [INFO ] After 1568ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 364 ms.
[2023-03-15 00:39:43] [INFO ] After 2080ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-15 00:39:43] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 9 ms.
[2023-03-15 00:39:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 465 places, 1009 transitions and 3796 arcs took 10 ms.
[2023-03-15 00:39:44] [INFO ] Flatten gal took : 194 ms
Total runtime 62850 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running NoC3x3 (PT), instance 5B
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 465 places, 1009 transitions, 3796 arcs.
Final Score: 25062.992
Took : 54 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: NoC3x3-PT-5B-ReachabilityCardinality-01 (reachable &!potential( ( ( ( ( ( (tk(P209)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P209)) ) ) | ( ( (tk(P366)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P366)) ) ) ) | ( ( ( (tk(P407)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P407)) ) ) | ( ( (tk(P298)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P298)) ) ) ) ) | ( ( ( ( (tk(P104)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P104)) ) ) | ( ( ( (tk(P356)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P356)) ) ) & ( ( (tk(P443)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P443)) ) ) ) ) | ( ( ( ( ( (tk(P341)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P341)) ) ) & ( ( (tk(P194)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P194)) ) ) ) & ( ( ( ( (tk(P111)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P111)) ) ) | ( ( (tk(P454)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P454)) ) ) ) & ( ( ( (tk(P110)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P110)) ) ) | ( ( (tk(P51)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P51)) ) ) ) ) ) | ( ( ( ( (tk(P2)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2)) ) ) & ( ( (tk(P324)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P324)) ) ) ) | ( ( ( (tk(P402)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P402)) ) ) & ( ( ( (tk(P75)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P75)) ) ) & ( ( (tk(P312)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P312)) ) ) ) ) ) ) ) )))
PROPERTY: NoC3x3-PT-5B-ReachabilityCardinality-04 (reachable &!potential( ( ( ( (tk(P200)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P200)) ) ) | ( ( ( (tk(P259)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P259)) ) ) | ( ( ( (tk(P65)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P65)) ) ) & ( ( ( (tk(P205)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P205)) ) ) | ( ( ( (tk(P146)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P146)) ) ) | ( ( ( (tk(P136)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P136)) ) ) & ( ( ( (tk(P239)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P239)) ) ) & ( ( ( (tk(P44)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P44)) ) ) | ( ( ( (tk(P452)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P452)) ) ) | ( ( (tk(P100)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P100)) ) ) ) ) ) ) ) ) ) ) )))
PROPERTY: NoC3x3-PT-5B-ReachabilityCardinality-12 (reachable &!potential( ( ( ( ( ( (tk(P109)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P109)) ) ) | ( ( (tk(P88)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P88)) ) ) ) | ( ( ( (tk(P211)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P211)) ) ) | ( ( (tk(P192)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P192)) ) ) ) ) | ( ( ( ( (tk(P349)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P349)) ) ) | ( ( (tk(P231)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P231)) ) ) ) | ( ( ( ( ( ( (tk(P327)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P327)) ) ) & ( ( (tk(P311)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P311)) ) ) ) & ( ( ( (tk(P14)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P14)) ) ) & ( ( (tk(P291)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P291)) ) ) ) ) & ( ( ( ( (tk(P132)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P132)) ) ) & ( ( (tk(P116)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P116)) ) ) ) & ( ( ( ( (tk(P243)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P243)) ) ) | ( ( (tk(P208)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P208)) ) ) ) & ( ( ( (tk(P365)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P365)) ) ) | ( ( ( (tk(P320)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P320)) ) ) | ( ( ( (tk(P260)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P260)) ) ) & ( ( ( (tk(P219)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P219)) ) ) | ( ( ( ( (tk(P7)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P7)) ) ) & ( ( (tk(P154)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P154)) ) ) ) | ( ( ( (tk(P224)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P224)) ) ) & ( ( (tk(P5)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P5)) ) ) ) ) ) ) ) ) ) ) ) | ( ( ( ( (tk(P237)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P237)) ) ) & ( ( ( (tk(P250)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P250)) ) ) & ( ( ( (tk(P374)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P374)) ) ) | ( ( ( (tk(P299)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P299)) ) ) & ( ( ( (tk(P59)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P59)) ) ) | ( ( (tk(P359)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P359)) ) ) ) ) ) ) ) | ( ( ( ( ( (tk(P151)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P151)) ) ) | ( ( (tk(P54)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P54)) ) ) ) | ( ( ( (tk(P368)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P368)) ) ) | ( ( ( (tk(P309)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P309)) ) ) | ( ( ( (tk(P333)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P333)) ) ) & ( ( (tk(P352)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P352)) ) ) ) ) ) ) & ( ( ( (tk(P416)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P416)) ) ) | ( ( ( (tk(P202)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P202)) ) ) & ( ( (tk(P168)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P168)) ) ) ) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 1549068 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16102688 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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="NoC3x3-PT-5B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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-5348"
echo " Executing tool smartxred"
echo " Input is NoC3x3-PT-5B, 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 r267-smll-167863541600302"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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