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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 5.9K Feb 26 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:05 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.4K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 13:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 13:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:30 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 1.3M 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-09b-ReachabilityCardinality-00
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-01
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-02
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-03
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-04
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-05
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-06
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-07
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-08
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-09
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-10
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-11
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-12
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-13
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-14
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678728261004

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-09b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 17:24:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 17:24:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 17:24:24] [INFO ] Load time of PNML (sax parser for PT used): 305 ms
[2023-03-13 17:24:24] [INFO ] Transformed 4014 places.
[2023-03-13 17:24:24] [INFO ] Transformed 4932 transitions.
[2023-03-13 17:24:24] [INFO ] Found NUPN structural information;
[2023-03-13 17:24:24] [INFO ] Parsed PT model containing 4014 places and 4932 transitions and 14960 arcs in 547 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 33 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-09b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 14 resets, run finished after 556 ms. (steps per millisecond=17 ) properties (out of 15) seen :6
FORMULA ASLink-PT-09b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 4932 rows 4014 cols
[2023-03-13 17:24:25] [INFO ] Computed 394 place invariants in 147 ms
[2023-03-13 17:24:27] [INFO ] After 1683ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 17:24:29] [INFO ] [Nat]Absence check using 93 positive place invariants in 115 ms returned sat
[2023-03-13 17:24:29] [INFO ] [Nat]Absence check using 93 positive and 301 generalized place invariants in 371 ms returned sat
[2023-03-13 17:24:52] [INFO ] After 22095ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-13 17:24:52] [INFO ] After 22110ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-13 17:24:52] [INFO ] After 25088ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA ASLink-PT-09b-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 58 out of 4014 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4014/4014 places, 4932/4932 transitions.
Drop transitions removed 906 transitions
Trivial Post-agglo rules discarded 906 transitions
Performed 906 trivial Post agglomeration. Transition count delta: 906
Iterating post reduction 0 with 906 rules applied. Total rules applied 906 place count 4014 transition count 4026
Reduce places removed 906 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 948 rules applied. Total rules applied 1854 place count 3108 transition count 3984
Reduce places removed 11 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 22 rules applied. Total rules applied 1876 place count 3097 transition count 3973
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 1887 place count 3086 transition count 3973
Performed 904 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 904 Pre rules applied. Total rules applied 1887 place count 3086 transition count 3069
Deduced a syphon composed of 904 places in 8 ms
Ensure Unique test removed 86 places
Reduce places removed 990 places and 0 transitions.
Iterating global reduction 4 with 1894 rules applied. Total rules applied 3781 place count 2096 transition count 3069
Discarding 14 places :
Implicit places reduction removed 14 places
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 4 with 71 rules applied. Total rules applied 3852 place count 2082 transition count 3012
Reduce places removed 57 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 5 with 61 rules applied. Total rules applied 3913 place count 2025 transition count 3008
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 3917 place count 2021 transition count 3008
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 29 Pre rules applied. Total rules applied 3917 place count 2021 transition count 2979
Deduced a syphon composed of 29 places in 22 ms
Ensure Unique test removed 22 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 7 with 80 rules applied. Total rules applied 3997 place count 1970 transition count 2979
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 22 Pre rules applied. Total rules applied 3997 place count 1970 transition count 2957
Deduced a syphon composed of 22 places in 21 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 4041 place count 1948 transition count 2957
Discarding 127 places :
Symmetric choice reduction at 7 with 127 rule applications. Total rules 4168 place count 1821 transition count 2830
Iterating global reduction 7 with 127 rules applied. Total rules applied 4295 place count 1821 transition count 2830
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 39 Pre rules applied. Total rules applied 4295 place count 1821 transition count 2791
Deduced a syphon composed of 39 places in 7 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 78 rules applied. Total rules applied 4373 place count 1782 transition count 2791
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 4382 place count 1773 transition count 2734
Iterating global reduction 7 with 9 rules applied. Total rules applied 4391 place count 1773 transition count 2734
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 8 Pre rules applied. Total rules applied 4391 place count 1773 transition count 2726
Deduced a syphon composed of 8 places in 8 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 4407 place count 1765 transition count 2726
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4408 place count 1764 transition count 2718
Iterating global reduction 7 with 1 rules applied. Total rules applied 4409 place count 1764 transition count 2718
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4410 place count 1763 transition count 2710
Iterating global reduction 7 with 1 rules applied. Total rules applied 4411 place count 1763 transition count 2710
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4412 place count 1762 transition count 2702
Iterating global reduction 7 with 1 rules applied. Total rules applied 4413 place count 1762 transition count 2702
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4414 place count 1761 transition count 2694
Iterating global reduction 7 with 1 rules applied. Total rules applied 4415 place count 1761 transition count 2694
Performed 246 Post agglomeration using F-continuation condition.Transition count delta: 246
Deduced a syphon composed of 246 places in 5 ms
Ensure Unique test removed 6 places
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 7 with 498 rules applied. Total rules applied 4913 place count 1509 transition count 2448
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4914 place count 1508 transition count 2447
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 4916 place count 1507 transition count 2447
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4917 place count 1506 transition count 2446
Iterating global reduction 7 with 1 rules applied. Total rules applied 4918 place count 1506 transition count 2446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 4920 place count 1506 transition count 2444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4921 place count 1505 transition count 2444
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 4925 place count 1503 transition count 2456
Free-agglomeration rule applied 14 times.
Iterating global reduction 9 with 14 rules applied. Total rules applied 4939 place count 1503 transition count 2442
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 9 with 14 rules applied. Total rules applied 4953 place count 1489 transition count 2442
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 10 with 9 rules applied. Total rules applied 4962 place count 1489 transition count 2433
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 4971 place count 1480 transition count 2433
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4972 place count 1479 transition count 2432
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 11 with 23 rules applied. Total rules applied 4995 place count 1463 transition count 2425
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 5002 place count 1456 transition count 2425
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 23 Pre rules applied. Total rules applied 5002 place count 1456 transition count 2402
Deduced a syphon composed of 23 places in 4 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 13 with 46 rules applied. Total rules applied 5048 place count 1433 transition count 2402
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 13 with 8 rules applied. Total rules applied 5056 place count 1425 transition count 2402
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 5 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 14 with 34 rules applied. Total rules applied 5090 place count 1408 transition count 2385
Discarding 8 places :
Symmetric choice reduction at 14 with 8 rule applications. Total rules 5098 place count 1400 transition count 2377
Iterating global reduction 14 with 8 rules applied. Total rules applied 5106 place count 1400 transition count 2377
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 5107 place count 1399 transition count 2376
Iterating global reduction 14 with 1 rules applied. Total rules applied 5108 place count 1399 transition count 2376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 5109 place count 1399 transition count 2375
Free-agglomeration rule applied 7 times.
Iterating global reduction 15 with 7 rules applied. Total rules applied 5116 place count 1399 transition count 2368
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 5123 place count 1392 transition count 2368
Applied a total of 5123 rules in 2497 ms. Remains 1392 /4014 variables (removed 2622) and now considering 2368/4932 (removed 2564) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2498 ms. Remains : 1392/4014 places, 2368/4932 transitions.
Incomplete random walk after 10000 steps, including 89 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 8) seen :2
FORMULA ASLink-PT-09b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2368 rows 1392 cols
[2023-03-13 17:24:55] [INFO ] Computed 241 place invariants in 52 ms
[2023-03-13 17:24:56] [INFO ] After 317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 17:24:56] [INFO ] [Nat]Absence check using 60 positive place invariants in 67 ms returned sat
[2023-03-13 17:24:56] [INFO ] [Nat]Absence check using 60 positive and 181 generalized place invariants in 58 ms returned sat
[2023-03-13 17:25:07] [INFO ] After 10858ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-13 17:25:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 17:25:20] [INFO ] After 12938ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-13 17:25:21] [INFO ] After 13494ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-13 17:25:21] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 300 ms.
Support contains 53 out of 1392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1392/1392 places, 2368/2368 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 1392 transition count 2363
Deduced a syphon composed of 5 places in 16 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 1387 transition count 2363
Applied a total of 10 rules in 83 ms. Remains 1387 /1392 variables (removed 5) and now considering 2363/2368 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 1387/1392 places, 2363/2368 transitions.
Incomplete random walk after 10000 steps, including 84 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 127154 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 127154 steps, saw 31882 distinct states, run finished after 3003 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2363 rows 1387 cols
[2023-03-13 17:25:25] [INFO ] Computed 241 place invariants in 29 ms
[2023-03-13 17:25:25] [INFO ] After 404ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 17:25:26] [INFO ] [Nat]Absence check using 60 positive place invariants in 22 ms returned sat
[2023-03-13 17:25:26] [INFO ] [Nat]Absence check using 60 positive and 181 generalized place invariants in 147 ms returned sat
[2023-03-13 17:25:38] [INFO ] After 11946ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 17:25:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 17:25:45] [INFO ] After 7182ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-13 17:25:50] [INFO ] After 12414ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-13 17:25:50] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 405 ms.
Support contains 53 out of 1387 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1387/1387 places, 2363/2363 transitions.
Applied a total of 0 rules in 55 ms. Remains 1387 /1387 variables (removed 0) and now considering 2363/2363 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 1387/1387 places, 2363/2363 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1387/1387 places, 2363/2363 transitions.
Applied a total of 0 rules in 49 ms. Remains 1387 /1387 variables (removed 0) and now considering 2363/2363 (removed 0) transitions.
[2023-03-13 17:25:51] [INFO ] Invariant cache hit.
[2023-03-13 17:25:53] [INFO ] Implicit Places using invariants in 1757 ms returned [1, 18, 19, 49, 67, 119, 143, 147, 160, 161, 164, 182, 200, 253, 266, 281, 286, 300, 301, 303, 320, 338, 408, 413, 414, 425, 426, 466, 485, 519, 543, 544, 549, 550, 561, 562, 564, 582, 600, 640, 675, 677, 681, 682, 693, 694, 696, 713, 732, 772, 786, 814, 829, 830, 832, 849, 867, 902, 929, 946, 950, 951, 962, 963, 965, 982, 1000, 1070, 1074, 1075, 1086, 1087, 1089, 1106, 1124, 1195, 1199, 1200, 1203, 1214, 1216, 1217, 1248, 1250, 1254, 1272, 1273, 1274, 1275, 1287, 1293, 1299, 1305, 1311, 1317, 1323, 1329, 1335, 1342, 1348, 1386]
Discarding 101 places :
Implicit Place search using SMT only with invariants took 1775 ms to find 101 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1286/1387 places, 2363/2363 transitions.
Drop transitions removed 134 transitions
Trivial Post-agglo rules discarded 134 transitions
Performed 134 trivial Post agglomeration. Transition count delta: 134
Iterating post reduction 0 with 134 rules applied. Total rules applied 134 place count 1286 transition count 2229
Reduce places removed 134 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 149 rules applied. Total rules applied 283 place count 1152 transition count 2214
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 296 place count 1139 transition count 2214
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 296 place count 1139 transition count 2172
Deduced a syphon composed of 42 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 85 rules applied. Total rules applied 381 place count 1096 transition count 2172
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 393 place count 1084 transition count 2160
Iterating global reduction 3 with 12 rules applied. Total rules applied 405 place count 1084 transition count 2160
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 409 place count 1080 transition count 2153
Iterating global reduction 3 with 4 rules applied. Total rules applied 413 place count 1080 transition count 2153
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 415 place count 1078 transition count 2151
Iterating global reduction 3 with 2 rules applied. Total rules applied 417 place count 1078 transition count 2151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 418 place count 1078 transition count 2150
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 419 place count 1077 transition count 2148
Iterating global reduction 4 with 1 rules applied. Total rules applied 420 place count 1077 transition count 2148
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 3 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 552 place count 1011 transition count 2082
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 559 place count 1004 transition count 2074
Iterating global reduction 4 with 7 rules applied. Total rules applied 566 place count 1004 transition count 2074
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 571 place count 1004 transition count 2069
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 575 place count 1002 transition count 2070
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 582 place count 1002 transition count 2063
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 584 place count 1002 transition count 2061
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 586 place count 1000 transition count 2061
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 6 with 24 rules applied. Total rules applied 610 place count 1000 transition count 2037
Ensure Unique test removed 5 places
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 639 place count 971 transition count 2037
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 642 place count 968 transition count 2034
Iterating global reduction 7 with 3 rules applied. Total rules applied 645 place count 968 transition count 2034
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 648 place count 968 transition count 2031
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 649 place count 968 transition count 2030
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 8 with 25 rules applied. Total rules applied 674 place count 968 transition count 2030
Applied a total of 674 rules in 916 ms. Remains 968 /1286 variables (removed 318) and now considering 2030/2363 (removed 333) transitions.
// Phase 1: matrix 2030 rows 968 cols
[2023-03-13 17:25:54] [INFO ] Computed 134 place invariants in 17 ms
[2023-03-13 17:25:54] [INFO ] Implicit Places using invariants in 952 ms returned [74, 107, 110, 181, 211, 213, 226, 299, 305, 308, 310, 317, 318, 412, 427, 428, 483, 502, 508, 511, 521, 522, 603, 606, 608, 611, 618, 619, 674, 693, 704, 716, 717, 770, 787, 793, 796, 798, 803, 804, 857, 874, 881, 884, 886]
Discarding 45 places :
Implicit Place search using SMT only with invariants took 955 ms to find 45 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 923/1387 places, 2030/2363 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 909 transition count 2016
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 909 transition count 2016
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 905 transition count 2012
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 905 transition count 2012
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 62 place count 892 transition count 1999
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 63 place count 892 transition count 1998
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 78 place count 892 transition count 1983
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 93 place count 877 transition count 1983
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 877 transition count 1978
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 103 place count 872 transition count 1978
Applied a total of 103 rules in 211 ms. Remains 872 /923 variables (removed 51) and now considering 1978/2030 (removed 52) transitions.
// Phase 1: matrix 1978 rows 872 cols
[2023-03-13 17:25:55] [INFO ] Computed 89 place invariants in 18 ms
[2023-03-13 17:25:55] [INFO ] Implicit Places using invariants in 579 ms returned []
[2023-03-13 17:25:55] [INFO ] Invariant cache hit.
[2023-03-13 17:25:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 17:25:58] [INFO ] Implicit Places using invariants and state equation in 2386 ms returned []
Implicit Place search using SMT with State Equation took 2984 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 872/1387 places, 1978/2363 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6891 ms. Remains : 872/1387 places, 1978/2363 transitions.
Incomplete random walk after 10000 steps, including 126 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 142932 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{5=1}
Probabilistic random walk after 142932 steps, saw 62717 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :1
FORMULA ASLink-PT-09b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 5 properties.
[2023-03-13 17:26:01] [INFO ] Invariant cache hit.
[2023-03-13 17:26:01] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 17:26:01] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-13 17:26:01] [INFO ] [Nat]Absence check using 19 positive and 70 generalized place invariants in 58 ms returned sat
[2023-03-13 17:26:13] [INFO ] After 11245ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 17:26:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 17:26:17] [INFO ] After 3683ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 17:26:17] [INFO ] After 4453ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 355 ms.
[2023-03-13 17:26:18] [INFO ] After 16500ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 164 ms.
Support contains 52 out of 872 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 872/872 places, 1978/1978 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 872 transition count 1977
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 871 transition count 1977
Applied a total of 2 rules in 38 ms. Remains 871 /872 variables (removed 1) and now considering 1977/1978 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 871/872 places, 1977/1978 transitions.
Incomplete random walk after 10000 steps, including 129 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 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 17 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 135459 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 135459 steps, saw 59018 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1977 rows 871 cols
[2023-03-13 17:26:21] [INFO ] Computed 89 place invariants in 17 ms
[2023-03-13 17:26:22] [INFO ] After 443ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 17:26:22] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2023-03-13 17:26:22] [INFO ] [Nat]Absence check using 21 positive and 68 generalized place invariants in 50 ms returned sat
[2023-03-13 17:26:38] [INFO ] After 16035ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 17:26:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 17:26:47] [INFO ] After 8532ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 17:26:47] [INFO ] After 8534ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-13 17:26:47] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 177 ms.
Support contains 52 out of 871 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 871/871 places, 1977/1977 transitions.
Applied a total of 0 rules in 34 ms. Remains 871 /871 variables (removed 0) and now considering 1977/1977 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 871/871 places, 1977/1977 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 871/871 places, 1977/1977 transitions.
Applied a total of 0 rules in 39 ms. Remains 871 /871 variables (removed 0) and now considering 1977/1977 (removed 0) transitions.
[2023-03-13 17:26:47] [INFO ] Invariant cache hit.
[2023-03-13 17:26:48] [INFO ] Implicit Places using invariants in 933 ms returned []
[2023-03-13 17:26:48] [INFO ] Invariant cache hit.
[2023-03-13 17:26:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 17:26:51] [INFO ] Implicit Places using invariants and state equation in 3186 ms returned []
Implicit Place search using SMT with State Equation took 4124 ms to find 0 implicit places.
[2023-03-13 17:26:51] [INFO ] Redundant transitions in 177 ms returned []
[2023-03-13 17:26:51] [INFO ] Invariant cache hit.
[2023-03-13 17:26:52] [INFO ] Dead Transitions using invariants and state equation in 824 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5206 ms. Remains : 871/871 places, 1977/1977 transitions.
Graph (complete) has 4753 edges and 871 vertex of which 870 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 870 transition count 1974
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 867 transition count 1974
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 866 transition count 1974
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 865 transition count 1973
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 865 transition count 1972
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 864 transition count 1972
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 864 transition count 1971
Applied a total of 13 rules in 152 ms. Remains 864 /871 variables (removed 7) and now considering 1971/1977 (removed 6) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 1971 rows 864 cols
[2023-03-13 17:26:52] [INFO ] Computed 87 place invariants in 15 ms
[2023-03-13 17:26:53] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 17:26:53] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-13 17:26:53] [INFO ] [Nat]Absence check using 20 positive and 67 generalized place invariants in 60 ms returned sat
[2023-03-13 17:27:06] [INFO ] After 12484ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 17:27:08] [INFO ] Deduced a trap composed of 10 places in 298 ms of which 1 ms to minimize.
[2023-03-13 17:27:17] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 9357 ms
[2023-03-13 17:27:18] [INFO ] After 24421ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 433 ms.
[2023-03-13 17:27:18] [INFO ] After 25337ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-13 17:27:18] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 14 ms.
[2023-03-13 17:27:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 871 places, 1977 transitions and 7874 arcs took 28 ms.
[2023-03-13 17:27:19] [INFO ] Flatten gal took : 188 ms
Total runtime 175256 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ASLink (PT), instance 09b
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: 871 places, 1977 transitions, 7874 arcs.
Final Score: 45630.395
Took : 90 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ASLink-PT-09b-ReachabilityCardinality-00 (reachable &!potential( ( ( ( ( (tk(P141)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P141)) ) ) | ( ( (tk(P390)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P390)) ) ) ) | ( ( ( ( ( ( (tk(P109)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P109)) ) ) & ( ( (tk(P801)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P801)) ) ) ) & ( ( ( (tk(P352)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P352)) ) ) & ( ( (tk(P200)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P200)) ) ) ) ) & ( ( ( ( ( (tk(P500)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P500)) ) ) | ( ( (tk(P294)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P294)) ) ) ) & ( ( ( (tk(P871)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P871)) ) ) | ( ( (tk(P212)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P212)) ) ) ) ) & ( ( ( ( (tk(P787)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P787)) ) ) | ( ( (tk(P644)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P644)) ) ) ) & ( ( ( ( (tk(P761)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P761)) ) ) | ( ( ( (tk(P542)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P542)) ) ) | ( ( ( (tk(P431)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P431)) ) ) & ( ( ( (tk(P214)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P214)) ) ) & ( ( (tk(P702)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P702)) ) ) ) ) ) ) & ( ( ( ( (tk(P515)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P515)) ) ) | ( ( (tk(P392)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P392)) ) ) ) | ( ( ( (tk(P564)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P564)) ) ) | ( ( ( (tk(P648)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P648)) ) ) | ( ( (tk(P63)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P63)) ) ) ) ) ) ) ) ) ) | ( ( ( ( (tk(P473)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P473)) ) ) & ( ( (tk(P848)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P848)) ) ) ) | ( ( ( (tk(P552)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P552)) ) ) & ( ( ( (tk(P807)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P807)) ) ) & ( ( ( (tk(P107)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P107)) ) ) | ( ( ( (tk(P866)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P866)) ) ) | ( ( ( ( (tk(P269)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P269)) ) ) | ( ( (tk(P287)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P287)) ) ) ) & ( ( ( (tk(P459)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P459)) ) ) | ( ( ( (tk(P746)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P746)) ) ) | ( ( ( (tk(P93)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P93)) ) ) & ( ( ( (tk(P448)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P448)) ) ) | ( ( (tk(P646)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P646)) ) ) ) ) ) ) ) ) ) ) ) ) ) )))
PROPERTY: ASLink-PT-09b-ReachabilityCardinality-02 (reachable &!potential( ( ( (tk(P80)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P80)) ) )))
PROPERTY: ASLink-PT-09b-ReachabilityCardinality-04 (reachable & potential(( ( ( (tk(P266)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P266)) ) ) & ( ( ( (tk(P23)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P23)) ) ) & ( ( ( (tk(P36)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P36)) ) ) | ( ( (tk(P626)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P626)) ) ) ) ) )))
PROPERTY: ASLink-PT-09b-ReachabilityCardinality-05 (reachable & potential(( ( (tk(P320)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P320)) ) )))
PROPERTY: ASLink-PT-09b-ReachabilityCardinality-09 (reachable &!potential( ( ( ( (tk(P358)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P358)) ) ) | ( ( ( (tk(P566)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P566)) ) ) | ( ( ( ( (tk(P192)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P192)) ) ) & ( ( ( (tk(P100)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P100)) ) ) & ( ( (tk(P86)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P86)) ) ) ) ) & ( ( ( (tk(P639)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P639)) ) ) & ( ( ( (tk(P470)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P470)) ) ) & ( ( ( ( (tk(P313)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P313)) ) ) | ( ( (tk(P112)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P112)) ) ) ) | ( ( ( (tk(P377)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P377)) ) ) | ( ( (tk(P362)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P362)) ) ) ) ) ) ) ) ) )))

BK_STOP 1678730219743

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
/home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//smart.sh: line 116: 608 Killed ${SMART}/smart ${INPUT_SM}

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-09b"
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-09b, 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-167813599800150"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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