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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5590.060 3600000.00 3686650.00 334.50 FFTFTFFTTTFFTFTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r011-oct2-167813599600022.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-01b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-oct2-167813599600022
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 13:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 13:10 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:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 13:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 13:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 13:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 13:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:28 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 293K 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-01b-ReachabilityCardinality-00
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-01
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-02
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-03
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-04
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-05
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-06
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-07
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-08
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-09
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-10
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-11
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-12
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-13
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-14
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678719095873

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-01b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 14:51:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 14:51:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 14:51:39] [INFO ] Load time of PNML (sax parser for PT used): 212 ms
[2023-03-13 14:51:39] [INFO ] Transformed 846 places.
[2023-03-13 14:51:39] [INFO ] Transformed 1148 transitions.
[2023-03-13 14:51:39] [INFO ] Found NUPN structural information;
[2023-03-13 14:51:39] [INFO ] Parsed PT model containing 846 places and 1148 transitions and 3624 arcs in 397 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-01b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 63 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 12) seen :8
FORMULA ASLink-PT-01b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1148 rows 846 cols
[2023-03-13 14:51:40] [INFO ] Computed 82 place invariants in 89 ms
[2023-03-13 14:51:41] [INFO ] After 803ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 14:51:41] [INFO ] [Nat]Absence check using 19 positive place invariants in 69 ms returned sat
[2023-03-13 14:51:41] [INFO ] [Nat]Absence check using 19 positive and 63 generalized place invariants in 54 ms returned sat
[2023-03-13 14:51:43] [INFO ] After 1815ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-13 14:51:45] [INFO ] Deduced a trap composed of 230 places in 1371 ms of which 22 ms to minimize.
[2023-03-13 14:51:47] [INFO ] Deduced a trap composed of 250 places in 1564 ms of which 2 ms to minimize.
[2023-03-13 14:51:48] [INFO ] Deduced a trap composed of 249 places in 1382 ms of which 1 ms to minimize.
[2023-03-13 14:51:50] [INFO ] Deduced a trap composed of 223 places in 1669 ms of which 2 ms to minimize.
[2023-03-13 14:51:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 6272 ms
[2023-03-13 14:51:59] [INFO ] After 17623ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 430 ms.
[2023-03-13 14:52:00] [INFO ] After 18523ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
FORMULA ASLink-PT-01b-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-01b-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 108 ms.
Support contains 22 out of 846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 846/846 places, 1148/1148 transitions.
Drop transitions removed 174 transitions
Trivial Post-agglo rules discarded 174 transitions
Performed 174 trivial Post agglomeration. Transition count delta: 174
Iterating post reduction 0 with 174 rules applied. Total rules applied 174 place count 846 transition count 974
Reduce places removed 174 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 181 rules applied. Total rules applied 355 place count 672 transition count 967
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 361 place count 671 transition count 962
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 366 place count 666 transition count 962
Performed 181 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 181 Pre rules applied. Total rules applied 366 place count 666 transition count 781
Deduced a syphon composed of 181 places in 2 ms
Ensure Unique test removed 10 places
Reduce places removed 191 places and 0 transitions.
Iterating global reduction 4 with 372 rules applied. Total rules applied 738 place count 475 transition count 781
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 4 with 12 rules applied. Total rules applied 750 place count 471 transition count 773
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 9 rules applied. Total rules applied 759 place count 463 transition count 772
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 760 place count 462 transition count 772
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 760 place count 462 transition count 768
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 11 rules applied. Total rules applied 771 place count 455 transition count 768
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 771 place count 455 transition count 765
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 777 place count 452 transition count 765
Discarding 24 places :
Symmetric choice reduction at 7 with 24 rule applications. Total rules 801 place count 428 transition count 741
Iterating global reduction 7 with 24 rules applied. Total rules applied 825 place count 428 transition count 741
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 826 place count 428 transition count 740
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 9 Pre rules applied. Total rules applied 826 place count 428 transition count 731
Deduced a syphon composed of 9 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 19 rules applied. Total rules applied 845 place count 418 transition count 731
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 845 place count 418 transition count 730
Deduced a syphon composed of 1 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 848 place count 416 transition count 730
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 850 place count 414 transition count 715
Iterating global reduction 8 with 2 rules applied. Total rules applied 852 place count 414 transition count 715
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 853 place count 413 transition count 707
Iterating global reduction 8 with 1 rules applied. Total rules applied 854 place count 413 transition count 707
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 855 place count 412 transition count 699
Iterating global reduction 8 with 1 rules applied. Total rules applied 856 place count 412 transition count 699
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 857 place count 411 transition count 691
Iterating global reduction 8 with 1 rules applied. Total rules applied 858 place count 411 transition count 691
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 859 place count 410 transition count 683
Iterating global reduction 8 with 1 rules applied. Total rules applied 860 place count 410 transition count 683
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 861 place count 409 transition count 675
Iterating global reduction 8 with 1 rules applied. Total rules applied 862 place count 409 transition count 675
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 8 with 80 rules applied. Total rules applied 942 place count 369 transition count 635
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 944 place count 368 transition count 644
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 945 place count 368 transition count 643
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 8 with 1 rules applied. Total rules applied 946 place count 367 transition count 643
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 948 place count 367 transition count 641
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 950 place count 365 transition count 641
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 952 place count 365 transition count 639
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 954 place count 363 transition count 639
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 955 place count 363 transition count 639
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 956 place count 362 transition count 638
Applied a total of 956 rules in 352 ms. Remains 362 /846 variables (removed 484) and now considering 638/1148 (removed 510) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 354 ms. Remains : 362/846 places, 638/1148 transitions.
Incomplete random walk after 10000 steps, including 173 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 2) seen :1
FORMULA ASLink-PT-01b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 638 rows 362 cols
[2023-03-13 14:52:00] [INFO ] Computed 62 place invariants in 15 ms
[2023-03-13 14:52:00] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 14:52:00] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2023-03-13 14:52:00] [INFO ] [Nat]Absence check using 18 positive and 44 generalized place invariants in 18 ms returned sat
[2023-03-13 14:52:01] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 14:52:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 14:52:01] [INFO ] After 75ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 14:52:01] [INFO ] After 175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-13 14:52:01] [INFO ] After 554ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 638/638 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 362 transition count 628
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 352 transition count 628
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 20 place count 352 transition count 623
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 30 place count 347 transition count 623
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 346 transition count 615
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 346 transition count 615
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 345 transition count 607
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 345 transition count 607
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 344 transition count 599
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 344 transition count 599
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 343 transition count 591
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 343 transition count 591
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 342 transition count 583
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 342 transition count 583
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 341 transition count 575
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 341 transition count 575
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 340 transition count 567
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 340 transition count 567
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 339 transition count 559
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 339 transition count 559
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 338 transition count 551
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 338 transition count 551
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 337 transition count 543
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 337 transition count 543
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 336 transition count 535
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 336 transition count 535
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 60 place count 332 transition count 531
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 331 transition count 530
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 330 transition count 530
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 62 place count 330 transition count 528
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 67 place count 327 transition count 528
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 326 transition count 528
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 68 place count 326 transition count 527
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 70 place count 325 transition count 527
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 74 place count 323 transition count 525
Applied a total of 74 rules in 133 ms. Remains 323 /362 variables (removed 39) and now considering 525/638 (removed 113) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 323/362 places, 525/638 transitions.
Incomplete random walk after 10000 steps, including 212 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 13414 steps, run visited all 1 properties in 83 ms. (steps per millisecond=161 )
Probabilistic random walk after 13414 steps, saw 7593 distinct states, run finished after 83 ms. (steps per millisecond=161 ) properties seen :1
FORMULA ASLink-PT-01b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 22312 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ASLink (PT), instance 01b
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: 846 places, 1148 transitions, 3624 arcs.
Final Score: 72227.572
Took : 41 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ASLink-PT-01b-ReachabilityCardinality-00 (reachable &!potential( (! ( ( 1 ) <= (tk(P529)) ))))
PROPERTY: ASLink-PT-01b-ReachabilityCardinality-01 (reachable & potential(( (! ( (! ( ( ( 1 ) <= (tk(P3)) ) | ( (tk(P359)) <= ( 1 ) ) )) & (! ( ( (tk(P186)) <= (tk(P675)) ) | ( (tk(P617)) <= (tk(P269)) ) )) )) & (! ( (tk(P58)) <= ( 1 ) )) )))
PROPERTY: ASLink-PT-01b-ReachabilityCardinality-02 (reachable & potential(( ( ( (tk(P563)) <= ( 0 ) ) | ( (tk(P99)) <= (tk(P733)) ) ) & ( ( 1 ) <= (tk(P31)) ) )))
PROPERTY: ASLink-PT-01b-ReachabilityCardinality-03 (reachable &!potential( ( ( ( (tk(P73)) <= (tk(P365)) ) & ( (tk(P446)) <= (tk(P594)) ) ) | (! ( ( 1 ) <= (tk(P272)) )) )))
PROPERTY: ASLink-PT-01b-ReachabilityCardinality-04 (reachable & potential(( ( ( (! ( ( ( ( ( ( (tk(P523)) <= ( 0 ) ) | ( (tk(P411)) <= ( 1 ) ) ) | ( ( ( 1 ) <= (tk(P552)) ) | ( (tk(P203)) <= (tk(P252)) ) ) ) | ( ( ( 1 ) <= (tk(P727)) ) & ( ( (tk(P251)) <= ( 1 ) ) | ( (tk(P231)) <= (tk(P820)) ) ) ) ) | (! ( ( ( 1 ) <= (tk(P641)) ) & ( (tk(P781)) <= (tk(P424)) ) )) ) | ( (tk(P255)) <= ( 0 ) ) )) | (! ( ( 1 ) <= (tk(P174)) )) ) & ( ( ( ( ( ( ( 1 ) <= (tk(P627)) ) | ( ( ( ( 1 ) <= (tk(P27)) ) & ( (tk(P586)) <= ( 0 ) ) ) & ( (tk(P354)) <= (tk(P333)) ) ) ) & (! ( ( (tk(P51)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P681)) ) )) ) & ( (tk(P293)) <= ( 1 ) ) ) | ( ( 1 ) <= (tk(P516)) ) ) | (! ( (tk(P148)) <= ( 1 ) )) ) ) & (! ( ( (tk(P399)) <= (tk(P812)) ) | (! ( ( ( (tk(P430)) <= (tk(P78)) ) | ( (tk(P719)) <= (tk(P211)) ) ) | (! ( (tk(P778)) <= (tk(P820)) )) )) )) )))
PROPERTY: ASLink-PT-01b-ReachabilityCardinality-05 (reachable & potential(( ( ( ( ( ( 1 ) <= (tk(P718)) ) | (! ( ( (! ( (tk(P32)) <= ( 1 ) )) | ( ( (tk(P744)) <= (tk(P75)) ) & ( ( (tk(P90)) <= (tk(P4)) ) & ( (tk(P398)) <= (tk(P766)) ) ) ) ) | ( (! ( (tk(P643)) <= (tk(P383)) )) | ( ( ( (tk(P105)) <= ( 1 ) ) | ( (tk(P595)) <= (tk(P391)) ) ) & (! ( (tk(P736)) <= ( 1 ) )) ) ) )) ) & ( ( ( ( (! ( ( ( 1 ) <= (tk(P439)) ) | ( (tk(P817)) <= ( 1 ) ) )) & ( (tk(P594)) <= (tk(P558)) ) ) | (! ( ( (tk(P782)) <= (tk(P234)) ) | ( ( 1 ) <= (tk(P649)) ) )) ) & ( ( (! ( ( ( 1 ) <= (tk(P674)) ) & ( ( 1 ) <= (tk(P177)) ) )) | ( (! ( (tk(P332)) <= (tk(P787)) )) & ( ( (tk(P424)) <= (tk(P628)) ) | ( (tk(P5)) <= (tk(P306)) ) ) ) ) & (! ( ( (tk(P222)) <= (tk(P767)) ) | ( (tk(P705)) <= ( 1 ) ) )) ) ) & (! ( ( ( ( (tk(P4)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P1)) ) ) | (! ( ( (tk(P777)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P702)) ) )) ) | (! ( ( 1 ) <= (tk(P628)) )) )) ) ) & ( ( 1 ) <= (tk(P605)) ) ) & ( ( 1 ) <= (tk(P31)) ) )))
PROPERTY: ASLink-PT-01b-ReachabilityCardinality-06 (reachable &!potential( (! ( ( 1 ) <= (tk(P536)) ))))
PROPERTY: ASLink-PT-01b-ReachabilityCardinality-07 (reachable &!potential( ( ( ( (tk(P637)) <= ( 0 ) ) | (! ( ( 1 ) <= (tk(P471)) )) ) | (! ( ( (! ( ( (tk(P750)) <= (tk(P454)) ) & ( (! ( (tk(P427)) <= ( 1 ) )) & ( (tk(P517)) <= ( 0 ) ) ) )) | ( ( ( (tk(P557)) <= ( 0 ) ) & ( ( ( ( (tk(P314)) <= (tk(P118)) ) | ( (tk(P733)) <= (tk(P52)) ) ) | ( (tk(P172)) <= (tk(P250)) ) ) | ( ( ( (tk(P611)) <= (tk(P71)) ) & ( (tk(P494)) <= (tk(P180)) ) ) | (! ( ( 1 ) <= (tk(P481)) )) ) ) ) | ( ( (! ( ( (tk(P84)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P291)) ) )) & (! ( ( (tk(P196)) <= (tk(P733)) ) | ( ( 1 ) <= (tk(P320)) ) )) ) & (! ( ( 1 ) <= (tk(P734)) )) ) ) ) & ( ( 1 ) <= (tk(P605)) ) )) )))
PROPERTY: ASLink-PT-01b-ReachabilityCardinality-08 (reachable &!potential( ( (! ( ( (! ( ( 1 ) <= (tk(P227)) )) & ( ( ( ( (tk(P232)) <= (tk(P531)) ) | ( (tk(P44)) <= (tk(P176)) ) ) & ( ( ( (tk(P56)) <= ( 0 ) ) | ( (tk(P592)) <= ( 1 ) ) ) | ( ( ( 1 ) <= (tk(P199)) ) | ( ( 1 ) <= (tk(P726)) ) ) ) ) | (! ( ( ( 1 ) <= (tk(P460)) ) | ( ( 1 ) <= (tk(P34)) ) )) ) ) & ( ( ( ( ( 1 ) <= (tk(P173)) ) & ( ( ( (tk(P456)) <= ( 0 ) ) & ( (tk(P620)) <= ( 1 ) ) ) & ( ( 1 ) <= (tk(P100)) ) ) ) & ( ( ( ( (tk(P285)) <= (tk(P104)) ) | ( (tk(P553)) <= ( 0 ) ) ) & (! ( (tk(P721)) <= (tk(P79)) )) ) & (! ( (tk(P663)) <= (tk(P32)) )) ) ) | (! ( ( ( (tk(P631)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P422)) ) ) | (! ( (tk(P84)) <= ( 1 ) )) )) ) )) | (! ( (! ( (! ( ( 1 ) <= (tk(P351)) )) | ( (! ( ( ( ( 1 ) <= (tk(P435)) ) & ( (tk(P451)) <= (tk(P649)) ) ) & ( ( ( 1 ) <= (tk(P474)) ) & ( ( 1 ) <= (tk(P617)) ) ) )) & (! ( ( ( 1 ) <= (tk(P431)) ) & ( (tk(P844)) <= (tk(P640)) ) )) ) )) | ( (! ( ( (tk(P541)) <= ( 0 ) ) & ( ( ( 1 ) <= (tk(P819)) ) | (! ( ( ( 1 ) <= (tk(P246)) ) | ( (tk(P733)) <= (tk(P393)) ) )) ) )) | (! ( ( (tk(P234)) <= (tk(P845)) ) & ( (tk(P690)) <= (tk(P835)) ) )) ) )) )))
PROPERTY: ASLink-PT-01b-ReachabilityCardinality-09 (reachable & potential(( ( ( ( ( ( 1 ) <= (tk(P167)) ) & ( ( 1 ) <= (tk(P603)) ) ) & ( ( ( ( (! ( ( ( 1 ) <= (tk(P483)) ) & ( (tk(P248)) <= ( 1 ) ) )) & ( ( ( ( 1 ) <= (tk(P97)) ) & ( (tk(P126)) <= ( 1 ) ) ) | (! ( (tk(P129)) <= ( 0 ) )) ) ) | ( ( 1 ) <= (tk(P18)) ) ) & ( (tk(P364)) <= ( 1 ) ) ) | ( ( (tk(P146)) <= ( 1 ) ) & (! ( (tk(P185)) <= ( 0 ) )) ) ) ) & ( ( 1 ) <= (tk(P428)) ) ) | ( ( ( ( 1 ) <= (tk(P282)) ) & ( (tk(P182)) <= ( 1 ) ) ) & ( ( 1 ) <= (tk(P825)) ) ) )))
PROPERTY: ASLink-PT-01b-ReachabilityCardinality-10 (reachable &!potential( ( (tk(P830)) <= (tk(P192)) )))
PROPERTY: ASLink-PT-01b-ReachabilityCardinality-11 (reachable & potential((! ( (tk(P223)) <= ( 1 ) ))))
PROPERTY: ASLink-PT-01b-ReachabilityCardinality-12 (reachable & potential(( ( ( 1 ) <= (tk(P528)) ) & ( (tk(P538)) <= (tk(P537)) ) )))
PROPERTY: ASLink-PT-01b-ReachabilityCardinality-13 (reachable &!potential( ( ( (tk(P492)) <= ( 0 ) ) & ( ( (tk(P799)) <= (tk(P37)) ) & ( (! ( ( ( ( ( ( 1 ) <= (tk(P844)) ) | ( (tk(P244)) <= (tk(P44)) ) ) | ( ( ( 1 ) <= (tk(P203)) ) | ( ( 1 ) <= (tk(P339)) ) ) ) | (! ( ( (tk(P585)) <= ( 0 ) ) & ( (tk(P310)) <= (tk(P616)) ) )) ) | ( ( ( ( ( 1 ) <= (tk(P834)) ) | ( (tk(P229)) <= (tk(P213)) ) ) & (! ( (tk(P770)) <= ( 1 ) )) ) & (! ( (tk(P403)) <= ( 1 ) )) ) )) | ( ( (! ( (tk(P203)) <= (tk(P818)) )) | ( (! ( ( (tk(P109)) <= (tk(P486)) ) & ( ( ( 1 ) <= (tk(P296)) ) | ( ( 1 ) <= (tk(P338)) ) ) )) | ( (! ( (tk(P807)) <= (tk(P697)) )) | ( ( 1 ) <= (tk(P564)) ) ) ) ) | ( (! ( ( ( ( (tk(P303)) <= (tk(P7)) ) | ( ( 1 ) <= (tk(P805)) ) ) & ( ( ( 1 ) <= (tk(P165)) ) | ( ( 1 ) <= (tk(P211)) ) ) ) | ( ( 1 ) <= (tk(P44)) ) )) | ( (tk(P833)) <= ( 1 ) ) ) ) ) ) )))
PROPERTY: ASLink-PT-01b-ReachabilityCardinality-14 (reachable &!potential( ( (tk(P333)) <= ( 1 ) )))
PROPERTY: ASLink-PT-01b-ReachabilityCardinality-15 (reachable & potential(( ( ( ( ( ( ( ( ( (tk(P260)) <= ( 0 ) ) & ( ( (tk(P721)) <= (tk(P346)) ) & ( ( 1 ) <= (tk(P182)) ) ) ) & (! ( ( 1 ) <= (tk(P234)) )) ) | ( ( (! ( ( 1 ) <= (tk(P480)) )) & ( ( 1 ) <= (tk(P526)) ) ) | ( ( ( (tk(P663)) <= (tk(P694)) ) & ( (tk(P593)) <= (tk(P716)) ) ) | ( (tk(P57)) <= (tk(P347)) ) ) ) ) | (! ( (tk(P412)) <= ( 0 ) )) ) & ( ( (! ( (! ( (tk(P483)) <= ( 0 ) )) & (! ( (tk(P697)) <= (tk(P108)) )) )) & ( ( (tk(P47)) <= (tk(P764)) ) & (! ( ( (tk(P201)) <= ( 0 ) ) | ( (tk(P639)) <= (tk(P451)) ) )) ) ) | ( (! ( ( (tk(P321)) <= (tk(P693)) ) | ( (tk(P720)) <= (tk(P746)) ) )) | ( (tk(P371)) <= ( 1 ) ) ) ) ) | ( ( ( 1 ) <= (tk(P293)) ) & ( ( 1 ) <= (tk(P602)) ) ) ) & ( ( 1 ) <= (tk(P568)) ) ) | (! ( (! ( ( 1 ) <= (tk(P567)) )) & (! ( ( 1 ) <= (tk(P239)) )) )) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 10562392 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16102748 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:
++ 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
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-01b"
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-01b, 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-167813599600022"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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