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-167813599700070.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-04b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-oct2-167813599700070
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.3K Feb 26 13:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 13:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 13:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 13:12 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.5K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 13:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Feb 26 13:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 13:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 13:12 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 669K 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-04b-ReachabilityCardinality-00
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-01
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-02
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-03
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-04
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-05
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-06
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-07
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-08
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-09
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-10
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-11
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-12
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-13
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-14
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678722804373

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-04b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 15:53:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 15:53:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 15:53:27] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2023-03-13 15:53:27] [INFO ] Transformed 2034 places.
[2023-03-13 15:53:27] [INFO ] Transformed 2567 transitions.
[2023-03-13 15:53:27] [INFO ] Found NUPN structural information;
[2023-03-13 15:53:27] [INFO ] Parsed PT model containing 2034 places and 2567 transitions and 7875 arcs in 323 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-04b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 25 resets, run finished after 487 ms. (steps per millisecond=20 ) properties (out of 13) seen :8
FORMULA ASLink-PT-04b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2567 rows 2034 cols
[2023-03-13 15:53:28] [INFO ] Computed 199 place invariants in 120 ms
[2023-03-13 15:53:29] [INFO ] After 1001ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 15:53:30] [INFO ] [Nat]Absence check using 48 positive place invariants in 52 ms returned sat
[2023-03-13 15:53:30] [INFO ] [Nat]Absence check using 48 positive and 151 generalized place invariants in 115 ms returned sat
[2023-03-13 15:53:54] [INFO ] After 23717ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 15:53:54] [INFO ] After 23744ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-13 15:53:54] [INFO ] After 25069ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 151 out of 2034 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2034/2034 places, 2567/2567 transitions.
Drop transitions removed 362 transitions
Trivial Post-agglo rules discarded 362 transitions
Performed 362 trivial Post agglomeration. Transition count delta: 362
Iterating post reduction 0 with 362 rules applied. Total rules applied 362 place count 2034 transition count 2205
Reduce places removed 362 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 374 rules applied. Total rules applied 736 place count 1672 transition count 2193
Reduce places removed 1 places and 0 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Iterating post reduction 2 with 40 rules applied. Total rules applied 776 place count 1671 transition count 2154
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 43 rules applied. Total rules applied 819 place count 1632 transition count 2150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 820 place count 1631 transition count 2150
Performed 406 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 406 Pre rules applied. Total rules applied 820 place count 1631 transition count 1744
Deduced a syphon composed of 406 places in 3 ms
Ensure Unique test removed 26 places
Reduce places removed 432 places and 0 transitions.
Iterating global reduction 5 with 838 rules applied. Total rules applied 1658 place count 1199 transition count 1744
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 5 with 29 rules applied. Total rules applied 1687 place count 1188 transition count 1726
Reduce places removed 18 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 6 with 21 rules applied. Total rules applied 1708 place count 1170 transition count 1723
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1711 place count 1167 transition count 1723
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 8 Pre rules applied. Total rules applied 1711 place count 1167 transition count 1715
Deduced a syphon composed of 8 places in 8 ms
Ensure Unique test removed 5 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 21 rules applied. Total rules applied 1732 place count 1154 transition count 1715
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 5 Pre rules applied. Total rules applied 1732 place count 1154 transition count 1710
Deduced a syphon composed of 5 places in 8 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 1742 place count 1149 transition count 1710
Discarding 54 places :
Symmetric choice reduction at 8 with 54 rule applications. Total rules 1796 place count 1095 transition count 1656
Iterating global reduction 8 with 54 rules applied. Total rules applied 1850 place count 1095 transition count 1656
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1851 place count 1095 transition count 1655
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 16 Pre rules applied. Total rules applied 1851 place count 1095 transition count 1639
Deduced a syphon composed of 16 places in 6 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 9 with 32 rules applied. Total rules applied 1883 place count 1079 transition count 1639
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1888 place count 1074 transition count 1606
Iterating global reduction 9 with 5 rules applied. Total rules applied 1893 place count 1074 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1894 place count 1073 transition count 1598
Iterating global reduction 9 with 1 rules applied. Total rules applied 1895 place count 1073 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1896 place count 1072 transition count 1590
Iterating global reduction 9 with 1 rules applied. Total rules applied 1897 place count 1072 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1898 place count 1071 transition count 1582
Iterating global reduction 9 with 1 rules applied. Total rules applied 1899 place count 1071 transition count 1582
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1900 place count 1070 transition count 1574
Iterating global reduction 9 with 1 rules applied. Total rules applied 1901 place count 1070 transition count 1574
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1902 place count 1069 transition count 1566
Iterating global reduction 9 with 1 rules applied. Total rules applied 1903 place count 1069 transition count 1566
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1904 place count 1068 transition count 1558
Iterating global reduction 9 with 1 rules applied. Total rules applied 1905 place count 1068 transition count 1558
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1906 place count 1067 transition count 1550
Iterating global reduction 9 with 1 rules applied. Total rules applied 1907 place count 1067 transition count 1550
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1908 place count 1066 transition count 1542
Iterating global reduction 9 with 1 rules applied. Total rules applied 1909 place count 1066 transition count 1542
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1910 place count 1065 transition count 1534
Iterating global reduction 9 with 1 rules applied. Total rules applied 1911 place count 1065 transition count 1534
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 9 with 223 rules applied. Total rules applied 2134 place count 952 transition count 1424
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 9 with 1 rules applied. Total rules applied 2135 place count 951 transition count 1424
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2137 place count 950 transition count 1433
Free-agglomeration rule applied 8 times.
Iterating global reduction 10 with 8 rules applied. Total rules applied 2145 place count 950 transition count 1425
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 2153 place count 942 transition count 1425
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 11 with 8 rules applied. Total rules applied 2161 place count 942 transition count 1417
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 2169 place count 934 transition count 1417
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 12 with 6 rules applied. Total rules applied 2175 place count 934 transition count 1417
Applied a total of 2175 rules in 1053 ms. Remains 934 /2034 variables (removed 1100) and now considering 1417/2567 (removed 1150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1053 ms. Remains : 934/2034 places, 1417/2567 transitions.
Incomplete random walk after 10000 steps, including 74 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 192795 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 192795 steps, saw 45644 distinct states, run finished after 3002 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1417 rows 934 cols
[2023-03-13 15:53:59] [INFO ] Computed 153 place invariants in 62 ms
[2023-03-13 15:53:59] [INFO ] After 313ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 15:53:59] [INFO ] [Nat]Absence check using 41 positive place invariants in 16 ms returned sat
[2023-03-13 15:53:59] [INFO ] [Nat]Absence check using 41 positive and 112 generalized place invariants in 35 ms returned sat
[2023-03-13 15:54:19] [INFO ] After 19211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 15:54:19] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 15:54:24] [INFO ] After 5345ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 15:54:24] [INFO ] After 5346ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-13 15:54:24] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 250 ms.
Support contains 151 out of 934 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 934/934 places, 1417/1417 transitions.
Applied a total of 0 rules in 26 ms. Remains 934 /934 variables (removed 0) and now considering 1417/1417 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 934/934 places, 1417/1417 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 934/934 places, 1417/1417 transitions.
Applied a total of 0 rules in 26 ms. Remains 934 /934 variables (removed 0) and now considering 1417/1417 (removed 0) transitions.
[2023-03-13 15:54:24] [INFO ] Invariant cache hit.
[2023-03-13 15:54:26] [INFO ] Implicit Places using invariants in 1846 ms returned [3, 24, 25, 26, 30, 46, 67, 86, 127, 146, 177, 213, 217, 218, 225, 265, 329, 349, 390, 391, 392, 393, 395, 416, 436, 509, 523, 548, 565, 566, 567, 570, 589, 611, 671, 691, 692, 707, 729, 745, 746, 748, 774, 776, 780, 800, 801, 804, 805, 832, 838, 844, 850, 856, 862, 870, 876, 883, 889, 930, 933]
Discarding 61 places :
Implicit Place search using SMT only with invariants took 1877 ms to find 61 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 873/934 places, 1417/1417 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 873 transition count 1362
Reduce places removed 55 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 75 rules applied. Total rules applied 130 place count 818 transition count 1342
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 150 place count 798 transition count 1342
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 150 place count 798 transition count 1319
Deduced a syphon composed of 23 places in 3 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 197 place count 774 transition count 1319
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 11 rules applied. Total rules applied 208 place count 768 transition count 1314
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 213 place count 763 transition count 1314
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 222 place count 754 transition count 1305
Iterating global reduction 5 with 9 rules applied. Total rules applied 231 place count 754 transition count 1305
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 234 place count 751 transition count 1301
Iterating global reduction 5 with 3 rules applied. Total rules applied 237 place count 751 transition count 1301
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 239 place count 751 transition count 1299
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 291 place count 725 transition count 1273
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 293 place count 724 transition count 1273
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 294 place count 724 transition count 1272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 295 place count 723 transition count 1272
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 7 with 29 rules applied. Total rules applied 324 place count 723 transition count 1243
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 353 place count 694 transition count 1243
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 354 place count 694 transition count 1242
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 364 place count 694 transition count 1242
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 367 place count 694 transition count 1242
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 368 place count 693 transition count 1241
Iterating global reduction 8 with 1 rules applied. Total rules applied 369 place count 693 transition count 1241
Applied a total of 369 rules in 284 ms. Remains 693 /873 variables (removed 180) and now considering 1241/1417 (removed 176) transitions.
// Phase 1: matrix 1241 rows 693 cols
[2023-03-13 15:54:27] [INFO ] Computed 85 place invariants in 10 ms
[2023-03-13 15:54:27] [INFO ] Implicit Places using invariants in 474 ms returned [127, 299, 311, 316, 317, 424, 428, 437, 576, 665, 691]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 488 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 682/934 places, 1241/1417 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 682 transition count 1239
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 680 transition count 1239
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 679 transition count 1238
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 679 transition count 1236
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 677 transition count 1236
Applied a total of 10 rules in 94 ms. Remains 677 /682 variables (removed 5) and now considering 1236/1241 (removed 5) transitions.
// Phase 1: matrix 1236 rows 677 cols
[2023-03-13 15:54:27] [INFO ] Computed 74 place invariants in 10 ms
[2023-03-13 15:54:28] [INFO ] Implicit Places using invariants in 480 ms returned []
[2023-03-13 15:54:28] [INFO ] Invariant cache hit.
[2023-03-13 15:54:28] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-13 15:54:30] [INFO ] Implicit Places using invariants and state equation in 1992 ms returned []
Implicit Place search using SMT with State Equation took 2476 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 677/934 places, 1236/1417 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5246 ms. Remains : 677/934 places, 1236/1417 transitions.
Incomplete random walk after 10000 steps, including 76 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 164713 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 164713 steps, saw 52304 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-13 15:54:33] [INFO ] Invariant cache hit.
[2023-03-13 15:54:33] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 15:54:34] [INFO ] [Nat]Absence check using 22 positive place invariants in 10 ms returned sat
[2023-03-13 15:54:34] [INFO ] [Nat]Absence check using 22 positive and 52 generalized place invariants in 53 ms returned sat
[2023-03-13 15:54:58] [INFO ] After 24055ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 15:54:58] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-13 15:54:59] [INFO ] After 601ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 15:54:59] [INFO ] After 602ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-13 15:54:59] [INFO ] After 25040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 46 ms.
Support contains 151 out of 677 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 677/677 places, 1236/1236 transitions.
Applied a total of 0 rules in 16 ms. Remains 677 /677 variables (removed 0) and now considering 1236/1236 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 677/677 places, 1236/1236 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 677/677 places, 1236/1236 transitions.
Applied a total of 0 rules in 16 ms. Remains 677 /677 variables (removed 0) and now considering 1236/1236 (removed 0) transitions.
[2023-03-13 15:54:59] [INFO ] Invariant cache hit.
[2023-03-13 15:54:59] [INFO ] Implicit Places using invariants in 407 ms returned []
[2023-03-13 15:54:59] [INFO ] Invariant cache hit.
[2023-03-13 15:55:00] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-13 15:55:02] [INFO ] Implicit Places using invariants and state equation in 2847 ms returned []
Implicit Place search using SMT with State Equation took 3286 ms to find 0 implicit places.
[2023-03-13 15:55:02] [INFO ] Redundant transitions in 117 ms returned []
[2023-03-13 15:55:02] [INFO ] Invariant cache hit.
[2023-03-13 15:55:05] [INFO ] Dead Transitions using invariants and state equation in 3322 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6757 ms. Remains : 677/677 places, 1236/1236 transitions.
Graph (complete) has 2764 edges and 677 vertex of which 676 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 676 transition count 1235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 675 transition count 1235
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 675 transition count 1233
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 673 transition count 1233
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 671 transition count 1233
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 13 place count 669 transition count 1231
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 669 transition count 1230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 668 transition count 1230
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 17 place count 668 transition count 1228
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 19 place count 666 transition count 1228
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 20 place count 666 transition count 1227
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 21 place count 666 transition count 1227
Applied a total of 21 rules in 159 ms. Remains 666 /677 variables (removed 11) and now considering 1227/1236 (removed 9) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 1227 rows 666 cols
[2023-03-13 15:55:06] [INFO ] Computed 71 place invariants in 8 ms
[2023-03-13 15:55:06] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 15:55:06] [INFO ] [Nat]Absence check using 19 positive place invariants in 16 ms returned sat
[2023-03-13 15:55:06] [INFO ] [Nat]Absence check using 19 positive and 52 generalized place invariants in 183 ms returned sat
[2023-03-13 15:55:20] [INFO ] After 13538ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 15:55:28] [INFO ] Deduced a trap composed of 29 places in 627 ms of which 43 ms to minimize.
[2023-03-13 15:55:28] [INFO ] Deduced a trap composed of 47 places in 463 ms of which 1 ms to minimize.
[2023-03-13 15:55:29] [INFO ] Deduced a trap composed of 53 places in 304 ms of which 12 ms to minimize.
[2023-03-13 15:55:38] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 10549 ms
[2023-03-13 15:55:38] [INFO ] Deduced a trap composed of 56 places in 286 ms of which 6 ms to minimize.
[2023-03-13 15:55:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 404 ms
[2023-03-13 15:55:39] [INFO ] Deduced a trap composed of 96 places in 236 ms of which 19 ms to minimize.
[2023-03-13 15:55:40] [INFO ] Deduced a trap composed of 73 places in 185 ms of which 1 ms to minimize.
[2023-03-13 15:55:40] [INFO ] Deduced a trap composed of 50 places in 217 ms of which 0 ms to minimize.
[2023-03-13 15:55:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1102 ms
[2023-03-13 15:55:40] [INFO ] After 33640ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 597 ms.
[2023-03-13 15:55:41] [INFO ] After 34824ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-13 15:55:41] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2023-03-13 15:55:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 677 places, 1236 transitions and 4573 arcs took 10 ms.
[2023-03-13 15:55:41] [INFO ] Flatten gal took : 108 ms
Total runtime 134574 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ASLink (PT), instance 04b
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: 677 places, 1236 transitions, 4573 arcs.
Final Score: 46320.087
Took : 56 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ASLink-PT-04b-ReachabilityCardinality-04 (reachable &!potential( ( ( ( ( (tk(P150)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P150)) ) ) | ( ( (tk(P372)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P372)) ) ) ) | ( ( ( (tk(P487)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P487)) ) ) | ( ( ( ( (tk(P142)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P142)) ) ) & ( ( (tk(P574)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P574)) ) ) ) | ( ( ( ( (tk(P128)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P128)) ) ) & ( ( (tk(P438)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P438)) ) ) ) & ( ( ( (tk(P136)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P136)) ) ) & ( ( ( (tk(P113)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P113)) ) ) & ( ( ( (tk(P369)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P369)) ) ) | ( ( ( (tk(P177)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P177)) ) ) | ( ( (tk(P21)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P21)) ) ) ) ) ) ) ) ) ) )))
PROPERTY: ASLink-PT-04b-ReachabilityCardinality-07 (reachable &!potential( ( ( ( ( (tk(P510)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P510)) ) ) | ( ( (tk(P79)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P79)) ) ) ) | ( ( ( (tk(P644)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P644)) ) ) | ( ( ( ( (tk(P291)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P291)) ) ) & ( ( (tk(P335)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P335)) ) ) ) | ( ( ( ( (tk(P288)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P288)) ) ) | ( ( (tk(P527)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P527)) ) ) ) & ( ( ( ( (tk(P385)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P385)) ) ) & ( ( ( (tk(P668)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P668)) ) ) & ( ( ( (tk(P298)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P298)) ) ) | ( ( ( (tk(P110)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P110)) ) ) | ( ( (tk(P646)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P646)) ) ) ) ) ) ) | ( ( ( (tk(P262)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P262)) ) ) & ( ( ( (tk(P538)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P538)) ) ) | ( ( (tk(P554)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P554)) ) ) ) ) ) ) ) ) )))
PROPERTY: ASLink-PT-04b-ReachabilityCardinality-09 (reachable & potential(( ( ( ( (tk(P139)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P139)) ) ) & ( ( ( ( ( (tk(P10)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P10)) ) ) & ( ( (tk(P71)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P71)) ) ) ) | ( ( ( ( (tk(P429)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P429)) ) ) & ( ( (tk(P236)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P236)) ) ) ) & ( ( ( (tk(P563)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P563)) ) ) & ( ( ( (tk(P673)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P673)) ) ) | ( ( ( (tk(P360)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P360)) ) ) & ( ( (tk(P100)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P100)) ) ) ) ) ) ) ) | ( ( ( ( ( (tk(P665)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P665)) ) ) | ( ( ( (tk(P554)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P554)) ) ) & ( ( (tk(P491)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P491)) ) ) ) ) & ( ( ( (tk(P276)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P276)) ) ) | ( ( ( (tk(P373)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P373)) ) ) & ( ( (tk(P44)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P44)) ) ) ) ) ) | ( ( ( (tk(P50)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P50)) ) ) & ( ( ( (tk(P289)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P289)) ) ) & ( ( ( ( (tk(P595)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P595)) ) ) & ( ( (tk(P522)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P522)) ) ) ) | ( ( ( (tk(P615)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P615)) ) ) & ( ( (tk(P414)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P414)) ) ) ) ) ) ) ) ) ) & ( ( ( ( (tk(P203)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P203)) ) ) | ( ( ( (tk(P271)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P271)) ) ) | ( ( (tk(P173)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P173)) ) ) ) ) & ( ( ( ( ( (tk(P87)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P87)) ) ) & ( ( ( (tk(P46)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P46)) ) ) | ( ( ( (tk(P420)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P420)) ) ) | ( ( (tk(P546)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P546)) ) ) ) ) ) & ( ( ( ( (tk(P492)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P492)) ) ) | ( ( ( (tk(P184)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P184)) ) ) & ( ( ( ( (tk(P569)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P569)) ) ) | ( ( (tk(P510)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P510)) ) ) ) & ( ( ( ( (tk(P502)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P502)) ) ) | ( ( (tk(P349)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P349)) ) ) ) | ( ( ( (tk(P520)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P520)) ) ) | ( ( (tk(P404)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P404)) ) ) ) ) ) ) ) & ( ( ( ( (tk(P647)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P647)) ) ) | ( ( (tk(P447)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P447)) ) ) ) | ( ( ( (tk(P301)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P301)) ) ) | ( ( (tk(P25)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P25)) ) ) ) ) ) ) | ( ( ( ( (tk(P290)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P290)) ) ) & ( ( ( (tk(P479)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P479)) ) ) & ( ( (tk(P677)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P677)) ) ) ) ) & ( ( ( ( (tk(P211)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P211)) ) ) & ( ( ( (tk(P492)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P492)) ) ) | ( ( (tk(P409)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P409)) ) ) ) ) & ( ( ( ( ( (tk(P30)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P30)) ) ) | ( ( (tk(P255)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P255)) ) ) ) | ( ( ( (tk(P254)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P254)) ) ) | ( ( (tk(P119)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P119)) ) ) ) ) & ( ( ( ( (tk(P584)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P584)) ) ) | ( ( (tk(P379)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P379)) ) ) ) | ( ( ( (tk(P467)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P467)) ) ) | ( ( ( (tk(P389)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P389)) ) ) & ( ( (tk(P374)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P374)) ) ) ) ) ) ) ) ) ) ) )))
PROPERTY: ASLink-PT-04b-ReachabilityCardinality-12 (reachable &!potential( ( ( ( ( (tk(P235)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P235)) ) ) | ( ( (tk(P539)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P539)) ) ) ) | ( ( ( ( (tk(P186)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P186)) ) ) & ( ( ( (tk(P661)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P661)) ) ) & ( ( (tk(P638)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P638)) ) ) ) ) | ( ( ( (tk(P138)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P138)) ) ) & ( ( ( (tk(P113)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P113)) ) ) & ( ( ( ( (tk(P286)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P286)) ) ) | ( ( ( (tk(P123)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P123)) ) ) | ( ( (tk(P364)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P364)) ) ) ) ) | ( ( ( (tk(P393)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P393)) ) ) | ( ( ( (tk(P583)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P583)) ) ) | ( ( (tk(P370)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P370)) ) ) ) ) ) ) ) ) )))
PROPERTY: ASLink-PT-04b-ReachabilityCardinality-14 (reachable & potential(( ( ( ( ( (tk(P306)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P306)) ) ) & ( ( (tk(P245)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P245)) ) ) ) & ( ( ( ( ( (tk(P643)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P643)) ) ) | ( ( (tk(P223)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P223)) ) ) ) | ( ( ( (tk(P103)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P103)) ) ) | ( ( ( (tk(P382)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P382)) ) ) & ( ( (tk(P464)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P464)) ) ) ) ) ) & ( ( ( (tk(P105)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P105)) ) ) | ( ( ( (tk(P62)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P62)) ) ) | ( ( (tk(P545)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P545)) ) ) ) ) ) ) & ( ( ( ( ( ( (tk(P269)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P269)) ) ) | ( ( (tk(P303)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P303)) ) ) ) | ( ( ( (tk(P168)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P168)) ) ) | ( ( ( ( (tk(P29)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P29)) ) ) | ( ( (tk(P395)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P395)) ) ) ) & ( ( ( (tk(P413)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P413)) ) ) | ( ( ( (tk(P387)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P387)) ) ) & ( ( (tk(P149)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P149)) ) ) ) ) ) ) ) & ( ( ( ( (tk(P651)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P651)) ) ) | ( ( (tk(P555)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P555)) ) ) ) | ( ( ( (tk(P167)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P167)) ) ) | ( ( ( (tk(P20)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P20)) ) ) | ( ( (tk(P376)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P376)) ) ) ) ) ) ) & ( ( ( ( ( ( ( (tk(P676)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P676)) ) ) & ( ( (tk(P151)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P151)) ) ) ) & ( ( ( ( (tk(P371)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P371)) ) ) | ( ( ( (tk(P624)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P624)) ) ) | ( ( ( (tk(P318)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P318)) ) ) & ( ( ( (tk(P170)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P170)) ) ) | ( ( (tk(P635)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P635)) ) ) ) ) ) ) & ( ( ( (tk(P258)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P258)) ) ) | ( ( ( (tk(P475)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P475)) ) ) | ( ( (tk(P500)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P500)) ) ) ) ) ) ) | ( ( ( ( (tk(P425)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P425)) ) ) & ( ( ( (tk(P400)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P400)) ) ) & ( ( (tk(P331)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P331)) ) ) ) ) & ( ( ( (tk(P542)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P542)) ) ) & ( ( ( (tk(P415)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P415)) ) ) & ( ( ( (tk(P143)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P143)) ) ) | ( ( ( (tk(P22)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P22)) ) ) & ( ( (tk(P535)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P535)) ) ) ) ) ) ) ) ) | ( ( ( ( ( (tk(P251)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P251)) ) ) & ( ( ( (tk(P273)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P273)) ) ) & ( ( (tk(P234)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P234)) ) ) ) ) & ( ( ( ( (tk(P499)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P499)) ) ) & ( ( (tk(P451)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P451)) ) ) ) & ( ( ( (tk(P642)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P642)) ) ) & ( ( (tk(P160)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P160)) ) ) ) ) ) | ( ( ( (tk(P634)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P634)) ) ) & ( ( ( (tk(P175)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P175)) ) ) & ( ( (tk(P655)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P655)) ) ) ) ) ) ) & ( ( ( (tk(P90)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P90)) ) ) | ( ( ( (tk(P641)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P641)) ) ) & ( ( ( ( (tk(P130)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P130)) ) ) | ( ( (tk(P552)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P552)) ) ) ) & ( ( ( ( (tk(P535)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P535)) ) ) | ( ( (tk(P580)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P580)) ) ) ) | ( ( ( (tk(P532)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P532)) ) ) | ( ( ( (tk(P569)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P569)) ) ) & ( ( ( (tk(P124)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P124)) ) ) & ( ( ( (tk(P645)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P645)) ) ) | ( ( (tk(P503)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P503)) ) ) ) ) ) ) ) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 4605280 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16105648 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-04b"
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-04b, 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-167813599700070"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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