fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r011-oct2-167813599700054
Last Updated
May 14, 2023

About the Execution of Smart+red for ASLink-PT-03b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5123.964 3600000.00 3675859.00 117.90 FF?FTFTFFTF??FTT normal

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.r011-oct2-167813599700054.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ASLink-PT-03b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-oct2-167813599700054
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 952K
-rw-r--r-- 1 mcc users 6.5K Feb 26 13:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 13:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 13:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 13:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 13:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 13:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 13:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 13:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 544K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678720024659

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=ASLink-PT-03b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 15:07:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 15:07:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 15:07:07] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2023-03-13 15:07:07] [INFO ] Transformed 1638 places.
[2023-03-13 15:07:07] [INFO ] Transformed 2094 transitions.
[2023-03-13 15:07:07] [INFO ] Found NUPN structural information;
[2023-03-13 15:07:07] [INFO ] Parsed PT model containing 1638 places and 2094 transitions and 6458 arcs in 304 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-03b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 28 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 11) seen :8
FORMULA ASLink-PT-03b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2094 rows 1638 cols
[2023-03-13 15:07:08] [INFO ] Computed 160 place invariants in 125 ms
[2023-03-13 15:07:08] [INFO ] After 563ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 15:07:09] [INFO ] [Nat]Absence check using 37 positive place invariants in 148 ms returned sat
[2023-03-13 15:07:09] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 104 ms returned sat
[2023-03-13 15:07:32] [INFO ] After 23198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 15:07:33] [INFO ] After 24116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-13 15:07:33] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 61 ms.
Support contains 31 out of 1638 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1638/1638 places, 2094/2094 transitions.
Drop transitions removed 357 transitions
Trivial Post-agglo rules discarded 357 transitions
Performed 357 trivial Post agglomeration. Transition count delta: 357
Iterating post reduction 0 with 357 rules applied. Total rules applied 357 place count 1638 transition count 1737
Reduce places removed 357 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 373 rules applied. Total rules applied 730 place count 1281 transition count 1721
Reduce places removed 4 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 11 rules applied. Total rules applied 741 place count 1277 transition count 1714
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 748 place count 1270 transition count 1714
Performed 363 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 363 Pre rules applied. Total rules applied 748 place count 1270 transition count 1351
Deduced a syphon composed of 363 places in 4 ms
Ensure Unique test removed 29 places
Reduce places removed 392 places and 0 transitions.
Iterating global reduction 4 with 755 rules applied. Total rules applied 1503 place count 878 transition count 1351
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 4 with 24 rules applied. Total rules applied 1527 place count 874 transition count 1331
Reduce places removed 20 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 22 rules applied. Total rules applied 1549 place count 854 transition count 1329
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1551 place count 852 transition count 1329
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 1551 place count 852 transition count 1320
Deduced a syphon composed of 9 places in 5 ms
Ensure Unique test removed 8 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1577 place count 835 transition count 1320
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 8 Pre rules applied. Total rules applied 1577 place count 835 transition count 1312
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 1593 place count 827 transition count 1312
Discarding 49 places :
Symmetric choice reduction at 7 with 49 rule applications. Total rules 1642 place count 778 transition count 1263
Iterating global reduction 7 with 49 rules applied. Total rules applied 1691 place count 778 transition count 1263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1692 place count 778 transition count 1262
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 17 Pre rules applied. Total rules applied 1692 place count 778 transition count 1245
Deduced a syphon composed of 17 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 8 with 35 rules applied. Total rules applied 1727 place count 760 transition count 1245
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1727 place count 760 transition count 1244
Deduced a syphon composed of 1 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 1730 place count 758 transition count 1244
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1732 place count 756 transition count 1229
Iterating global reduction 8 with 2 rules applied. Total rules applied 1734 place count 756 transition count 1229
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1735 place count 755 transition count 1221
Iterating global reduction 8 with 1 rules applied. Total rules applied 1736 place count 755 transition count 1221
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1737 place count 754 transition count 1213
Iterating global reduction 8 with 1 rules applied. Total rules applied 1738 place count 754 transition count 1213
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1739 place count 753 transition count 1205
Iterating global reduction 8 with 1 rules applied. Total rules applied 1740 place count 753 transition count 1205
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 8 with 191 rules applied. Total rules applied 1931 place count 657 transition count 1110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1933 place count 656 transition count 1119
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1934 place count 656 transition count 1118
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 1936 place count 655 transition count 1117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1937 place count 654 transition count 1117
Free-agglomeration rule applied 5 times.
Iterating global reduction 10 with 5 rules applied. Total rules applied 1942 place count 654 transition count 1112
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1947 place count 649 transition count 1112
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1949 place count 649 transition count 1110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1951 place count 647 transition count 1110
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1952 place count 647 transition count 1110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1953 place count 646 transition count 1109
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 7 rules applied. Total rules applied 1960 place count 641 transition count 1107
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1962 place count 639 transition count 1107
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 8 Pre rules applied. Total rules applied 1962 place count 639 transition count 1099
Deduced a syphon composed of 8 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 14 with 17 rules applied. Total rules applied 1979 place count 630 transition count 1099
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 14 with 3 rules applied. Total rules applied 1982 place count 627 transition count 1099
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 1982 place count 627 transition count 1098
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 1984 place count 626 transition count 1098
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 15 with 12 rules applied. Total rules applied 1996 place count 620 transition count 1092
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 1998 place count 618 transition count 1090
Iterating global reduction 15 with 2 rules applied. Total rules applied 2000 place count 618 transition count 1090
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 2002 place count 616 transition count 1088
Iterating global reduction 15 with 2 rules applied. Total rules applied 2004 place count 616 transition count 1088
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 2006 place count 616 transition count 1086
Applied a total of 2006 rules in 871 ms. Remains 616 /1638 variables (removed 1022) and now considering 1086/2094 (removed 1008) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 871 ms. Remains : 616/1638 places, 1086/2094 transitions.
Incomplete random walk after 10000 steps, including 130 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 353209 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :{}
Probabilistic random walk after 353209 steps, saw 68782 distinct states, run finished after 3002 ms. (steps per millisecond=117 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1086 rows 616 cols
[2023-03-13 15:07:38] [INFO ] Computed 106 place invariants in 62 ms
[2023-03-13 15:07:38] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 15:07:38] [INFO ] [Nat]Absence check using 26 positive place invariants in 31 ms returned sat
[2023-03-13 15:07:38] [INFO ] [Nat]Absence check using 26 positive and 80 generalized place invariants in 34 ms returned sat
[2023-03-13 15:07:48] [INFO ] After 9706ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 15:07:48] [INFO ] Deduced a trap composed of 72 places in 474 ms of which 5 ms to minimize.
[2023-03-13 15:07:49] [INFO ] Deduced a trap composed of 78 places in 339 ms of which 1 ms to minimize.
[2023-03-13 15:07:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 955 ms
[2023-03-13 15:07:49] [INFO ] After 10897ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 238 ms.
[2023-03-13 15:07:49] [INFO ] After 11459ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 26 ms.
Support contains 31 out of 616 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 616/616 places, 1086/1086 transitions.
Applied a total of 0 rules in 24 ms. Remains 616 /616 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 616/616 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 616/616 places, 1086/1086 transitions.
Applied a total of 0 rules in 17 ms. Remains 616 /616 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2023-03-13 15:07:49] [INFO ] Invariant cache hit.
[2023-03-13 15:07:51] [INFO ] Implicit Places using invariants in 1315 ms returned [1, 18, 19, 20, 55, 73, 92, 139, 149, 154, 163, 164, 166, 184, 203, 280, 289, 294, 295, 308, 309, 330, 348, 367, 386, 387, 423, 428, 429, 432, 444, 445, 446, 478, 480, 484, 503, 504, 505, 519, 525, 531, 537, 543, 549, 555, 561, 567, 573, 579]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 1320 ms to find 50 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 566/616 places, 1086/1086 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 566 transition count 1032
Reduce places removed 54 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 57 rules applied. Total rules applied 111 place count 512 transition count 1029
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 114 place count 509 transition count 1029
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 114 place count 509 transition count 1006
Deduced a syphon composed of 23 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 161 place count 485 transition count 1006
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 11 rules applied. Total rules applied 172 place count 481 transition count 999
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 8 rules applied. Total rules applied 180 place count 474 transition count 998
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 181 place count 473 transition count 998
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 195 place count 459 transition count 984
Iterating global reduction 6 with 14 rules applied. Total rules applied 209 place count 459 transition count 984
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 211 place count 459 transition count 982
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 211 place count 459 transition count 981
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 213 place count 458 transition count 981
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 216 place count 455 transition count 975
Iterating global reduction 7 with 3 rules applied. Total rules applied 219 place count 455 transition count 975
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 220 place count 454 transition count 974
Iterating global reduction 7 with 1 rules applied. Total rules applied 221 place count 454 transition count 974
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 222 place count 453 transition count 972
Iterating global reduction 7 with 1 rules applied. Total rules applied 223 place count 453 transition count 972
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 7 with 54 rules applied. Total rules applied 277 place count 426 transition count 945
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 279 place count 424 transition count 941
Iterating global reduction 7 with 2 rules applied. Total rules applied 281 place count 424 transition count 941
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 285 place count 422 transition count 942
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 287 place count 422 transition count 940
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 289 place count 420 transition count 940
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 8 with 15 rules applied. Total rules applied 304 place count 420 transition count 925
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 320 place count 404 transition count 925
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 321 place count 404 transition count 924
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 329 place count 404 transition count 924
Applied a total of 329 rules in 147 ms. Remains 404 /566 variables (removed 162) and now considering 924/1086 (removed 162) transitions.
// Phase 1: matrix 924 rows 404 cols
[2023-03-13 15:07:51] [INFO ] Computed 50 place invariants in 8 ms
[2023-03-13 15:07:51] [INFO ] Implicit Places using invariants in 426 ms returned [98, 110, 113, 117, 118, 191, 197, 200, 220, 221, 303, 316, 319]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 429 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 391/616 places, 924/1086 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 387 transition count 920
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 387 transition count 920
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 386 transition count 919
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 386 transition count 919
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 16 place count 383 transition count 916
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 21 place count 383 transition count 911
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 26 place count 378 transition count 911
Applied a total of 26 rules in 53 ms. Remains 378 /391 variables (removed 13) and now considering 911/924 (removed 13) transitions.
// Phase 1: matrix 911 rows 378 cols
[2023-03-13 15:07:51] [INFO ] Computed 37 place invariants in 6 ms
[2023-03-13 15:07:51] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-13 15:07:51] [INFO ] Invariant cache hit.
[2023-03-13 15:07:52] [INFO ] Implicit Places using invariants and state equation in 926 ms returned []
Implicit Place search using SMT with State Equation took 1282 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 378/616 places, 911/1086 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3248 ms. Remains : 378/616 places, 911/1086 transitions.
Incomplete random walk after 10000 steps, including 140 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 240751 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 240751 steps, saw 106057 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-13 15:07:56] [INFO ] Invariant cache hit.
[2023-03-13 15:07:56] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 15:07:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-13 15:07:56] [INFO ] [Nat]Absence check using 10 positive and 27 generalized place invariants in 10 ms returned sat
[2023-03-13 15:08:01] [INFO ] After 5160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 15:08:01] [INFO ] Deduced a trap composed of 32 places in 332 ms of which 6 ms to minimize.
[2023-03-13 15:08:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 411 ms
[2023-03-13 15:08:02] [INFO ] Deduced a trap composed of 29 places in 286 ms of which 1 ms to minimize.
[2023-03-13 15:08:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 401 ms
[2023-03-13 15:08:02] [INFO ] After 6226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1688 ms.
[2023-03-13 15:08:04] [INFO ] After 8046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 135 ms.
Support contains 31 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 911/911 transitions.
Applied a total of 0 rules in 12 ms. Remains 378 /378 variables (removed 0) and now considering 911/911 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 378/378 places, 911/911 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 911/911 transitions.
Applied a total of 0 rules in 10 ms. Remains 378 /378 variables (removed 0) and now considering 911/911 (removed 0) transitions.
[2023-03-13 15:08:04] [INFO ] Invariant cache hit.
[2023-03-13 15:08:04] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-13 15:08:04] [INFO ] Invariant cache hit.
[2023-03-13 15:08:05] [INFO ] Implicit Places using invariants and state equation in 847 ms returned []
Implicit Place search using SMT with State Equation took 1119 ms to find 0 implicit places.
[2023-03-13 15:08:05] [INFO ] Redundant transitions in 63 ms returned []
[2023-03-13 15:08:05] [INFO ] Invariant cache hit.
[2023-03-13 15:08:06] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1641 ms. Remains : 378/378 places, 911/911 transitions.
Applied a total of 0 rules in 10 ms. Remains 378 /378 variables (removed 0) and now considering 911/911 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-13 15:08:06] [INFO ] Invariant cache hit.
[2023-03-13 15:08:06] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 15:08:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-13 15:08:06] [INFO ] [Nat]Absence check using 10 positive and 27 generalized place invariants in 20 ms returned sat
[2023-03-13 15:08:11] [INFO ] After 4980ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 15:08:11] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 1 ms to minimize.
[2023-03-13 15:08:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2023-03-13 15:08:18] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 13 ms to minimize.
[2023-03-13 15:08:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2023-03-13 15:08:18] [INFO ] After 11926ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 982 ms.
[2023-03-13 15:08:19] [INFO ] After 13057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-13 15:08:19] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 24 ms.
[2023-03-13 15:08:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 378 places, 911 transitions and 3573 arcs took 5 ms.
[2023-03-13 15:08:19] [INFO ] Flatten gal took : 104 ms
Total runtime 72542 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ASLink (PT), instance 03b
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: 378 places, 911 transitions, 3573 arcs.
Final Score: 15265.828
Took : 42 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ASLink-PT-03b-ReachabilityCardinality-02 (reachable &!potential( ( ( (tk(P87)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P87)) ) )))
PROPERTY: ASLink-PT-03b-ReachabilityCardinality-11 (reachable & potential(( ( ( ( (tk(P137)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P137)) ) ) & ( ( ( (tk(P317)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P317)) ) ) & ( ( (tk(P208)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P208)) ) ) ) ) & ( ( ( ( (tk(P158)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P158)) ) ) & ( ( (tk(P19)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P19)) ) ) ) & ( ( ( ( (tk(P94)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P94)) ) ) | ( ( (tk(P284)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P284)) ) ) ) & ( ( ( (tk(P191)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P191)) ) ) | ( ( ( (tk(P242)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P242)) ) ) & ( ( (tk(P193)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P193)) ) ) ) ) ) ) )))
PROPERTY: ASLink-PT-03b-ReachabilityCardinality-12 (reachable &!potential( ( ( ( ( (tk(P25)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P25)) ) ) | ( ( (tk(P277)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P277)) ) ) ) & ( ( ( ( (tk(P109)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P109)) ) ) | ( ( (tk(P198)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P198)) ) ) ) & ( ( ( ( (tk(P99)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P99)) ) ) | ( ( (tk(P348)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P348)) ) ) ) | ( ( ( ( (tk(P325)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P325)) ) ) & ( ( ( ( (tk(P359)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P359)) ) ) | ( ( (tk(P298)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P298)) ) ) ) & ( ( ( (tk(P377)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P377)) ) ) | ( ( ( (tk(P106)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P106)) ) ) | ( ( ( (tk(P166)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P166)) ) ) & ( ( ( (tk(P205)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P205)) ) ) | ( ( ( (tk(P274)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P274)) ) ) & ( ( (tk(P187)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P187)) ) ) ) ) ) ) ) ) ) | ( ( ( (tk(P122)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P122)) ) ) & ( ( ( ( (tk(P105)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P105)) ) ) | ( ( (tk(P216)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P216)) ) ) ) & ( ( ( (tk(P292)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P292)) ) ) | ( ( (tk(P164)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P164)) ) ) ) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 11028064 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16106024 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="ASLink-PT-03b"
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 ASLink-PT-03b, 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 r011-oct2-167813599700054"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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