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

About the Execution of LTSMin+red for ASLink-PT-02a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2016.188 307018.00 1098218.00 57.90 FFFTTFFFFFFTFFFF 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.r009-oct2-167813597300031.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 ltsminxred
Input is ASLink-PT-02a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597300031
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 672K
-rw-r--r-- 1 mcc users 7.9K Feb 26 13:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 13:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 13:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 13:11 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.6K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 13:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 13:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 13:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 13:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 279K 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-02a-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678602315752

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=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-02a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 06:25:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 06:25:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 06:25:18] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2023-03-12 06:25:18] [INFO ] Transformed 626 places.
[2023-03-12 06:25:18] [INFO ] Transformed 1008 transitions.
[2023-03-12 06:25:18] [INFO ] Found NUPN structural information;
[2023-03-12 06:25:18] [INFO ] Parsed PT model containing 626 places and 1008 transitions and 3820 arcs in 255 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
Incomplete random walk after 10000 steps, including 124 resets, run finished after 437 ms. (steps per millisecond=22 ) properties (out of 16) seen :7
FORMULA ASLink-PT-02a-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 998 rows 626 cols
[2023-03-12 06:25:20] [INFO ] Computed 118 place invariants in 34 ms
[2023-03-12 06:25:20] [INFO ] [Real]Absence check using 28 positive place invariants in 19 ms returned sat
[2023-03-12 06:25:20] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 41 ms returned sat
[2023-03-12 06:25:20] [INFO ] After 669ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 06:25:21] [INFO ] [Nat]Absence check using 28 positive place invariants in 8 ms returned sat
[2023-03-12 06:25:21] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 27 ms returned sat
[2023-03-12 06:25:45] [INFO ] After 24593ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :4
[2023-03-12 06:25:45] [INFO ] After 24601ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-12 06:25:45] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
FORMULA ASLink-PT-02a-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02a-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02a-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 164 ms.
Support contains 133 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 998/998 transitions.
Ensure Unique test removed 7 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 615 transition count 964
Reduce places removed 34 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 81 place count 581 transition count 962
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 83 place count 579 transition count 962
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 83 place count 579 transition count 924
Deduced a syphon composed of 38 places in 3 ms
Ensure Unique test removed 12 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 171 place count 529 transition count 924
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 173 place count 527 transition count 922
Iterating global reduction 3 with 2 rules applied. Total rules applied 175 place count 527 transition count 922
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 178 place count 526 transition count 920
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 180 place count 525 transition count 919
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 181 place count 524 transition count 919
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 205 place count 512 transition count 907
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 211 place count 512 transition count 901
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 217 place count 506 transition count 901
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 219 place count 506 transition count 901
Applied a total of 219 rules in 187 ms. Remains 506 /626 variables (removed 120) and now considering 901/998 (removed 97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 506/626 places, 901/998 transitions.
Incomplete random walk after 10000 steps, including 145 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 48 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 6) seen :1
FORMULA ASLink-PT-02a-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 901 rows 506 cols
[2023-03-12 06:25:47] [INFO ] Computed 94 place invariants in 17 ms
[2023-03-12 06:25:47] [INFO ] [Real]Absence check using 21 positive place invariants in 6 ms returned sat
[2023-03-12 06:25:47] [INFO ] [Real]Absence check using 21 positive and 73 generalized place invariants in 24 ms returned sat
[2023-03-12 06:25:47] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 06:25:47] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-12 06:25:47] [INFO ] [Nat]Absence check using 21 positive and 73 generalized place invariants in 20 ms returned sat
[2023-03-12 06:25:58] [INFO ] After 11594ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
FORMULA ASLink-PT-02a-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02a-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02a-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02a-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 506/506 places, 901/901 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 505 transition count 894
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 498 transition count 894
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 15 place count 498 transition count 881
Deduced a syphon composed of 13 places in 2 ms
Ensure Unique test removed 7 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 33 rules applied. Total rules applied 48 place count 478 transition count 881
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 478 transition count 880
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 477 transition count 880
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 54 place count 473 transition count 858
Ensure Unique test removed 1 places
Iterating global reduction 4 with 5 rules applied. Total rules applied 59 place count 472 transition count 858
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 4 with 2 rules applied. Total rules applied 61 place count 472 transition count 856
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 62 place count 471 transition count 856
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 63 place count 470 transition count 848
Iterating global reduction 6 with 1 rules applied. Total rules applied 64 place count 470 transition count 848
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 65 place count 469 transition count 840
Iterating global reduction 6 with 1 rules applied. Total rules applied 66 place count 469 transition count 840
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 67 place count 468 transition count 832
Iterating global reduction 6 with 1 rules applied. Total rules applied 68 place count 468 transition count 832
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 69 place count 467 transition count 824
Iterating global reduction 6 with 1 rules applied. Total rules applied 70 place count 467 transition count 824
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 71 place count 466 transition count 816
Iterating global reduction 6 with 1 rules applied. Total rules applied 72 place count 466 transition count 816
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 73 place count 465 transition count 808
Iterating global reduction 6 with 1 rules applied. Total rules applied 74 place count 465 transition count 808
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 75 place count 464 transition count 800
Iterating global reduction 6 with 1 rules applied. Total rules applied 76 place count 464 transition count 800
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 77 place count 463 transition count 792
Iterating global reduction 6 with 1 rules applied. Total rules applied 78 place count 463 transition count 792
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 79 place count 462 transition count 784
Iterating global reduction 6 with 1 rules applied. Total rules applied 80 place count 462 transition count 784
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 81 place count 461 transition count 776
Iterating global reduction 6 with 1 rules applied. Total rules applied 82 place count 461 transition count 776
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 83 place count 460 transition count 768
Iterating global reduction 6 with 1 rules applied. Total rules applied 84 place count 460 transition count 768
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 85 place count 459 transition count 760
Iterating global reduction 6 with 1 rules applied. Total rules applied 86 place count 459 transition count 760
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 87 place count 458 transition count 752
Iterating global reduction 6 with 1 rules applied. Total rules applied 88 place count 458 transition count 752
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 89 place count 457 transition count 744
Iterating global reduction 6 with 1 rules applied. Total rules applied 90 place count 457 transition count 744
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 91 place count 456 transition count 736
Iterating global reduction 6 with 1 rules applied. Total rules applied 92 place count 456 transition count 736
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 93 place count 455 transition count 728
Iterating global reduction 6 with 1 rules applied. Total rules applied 94 place count 455 transition count 728
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 96 place count 454 transition count 727
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 97 place count 454 transition count 726
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 98 place count 453 transition count 726
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 100 place count 453 transition count 726
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 101 place count 452 transition count 725
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 105 place count 448 transition count 725
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 8 Pre rules applied. Total rules applied 105 place count 448 transition count 717
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 17 rules applied. Total rules applied 122 place count 439 transition count 717
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 8 with 3 rules applied. Total rules applied 125 place count 436 transition count 717
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 125 place count 436 transition count 716
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 127 place count 435 transition count 716
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 133 place count 432 transition count 713
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 135 place count 430 transition count 711
Iterating global reduction 9 with 2 rules applied. Total rules applied 137 place count 430 transition count 711
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 139 place count 430 transition count 709
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 141 place count 428 transition count 709
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 143 place count 428 transition count 709
Applied a total of 143 rules in 566 ms. Remains 428 /506 variables (removed 78) and now considering 709/901 (removed 192) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 566 ms. Remains : 428/506 places, 709/901 transitions.
Incomplete random walk after 10000 steps, including 159 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 55 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 605434 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :{}
Probabilistic random walk after 605434 steps, saw 208362 distinct states, run finished after 3002 ms. (steps per millisecond=201 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 709 rows 428 cols
[2023-03-12 06:26:02] [INFO ] Computed 77 place invariants in 16 ms
[2023-03-12 06:26:02] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2023-03-12 06:26:02] [INFO ] [Real]Absence check using 20 positive and 57 generalized place invariants in 30 ms returned sat
[2023-03-12 06:26:02] [INFO ] After 456ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 06:26:03] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-12 06:26:03] [INFO ] [Nat]Absence check using 20 positive and 57 generalized place invariants in 33 ms returned sat
[2023-03-12 06:26:03] [INFO ] After 619ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
FORMULA ASLink-PT-02a-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 45242 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/498/inv_0_ --invariant=/tmp/498/inv_1_ --invariant=/tmp/498/inv_2_ --invariant=/tmp/498/inv_3_ --invariant=/tmp/498/inv_4_ --invariant=/tmp/498/inv_5_ --invariant=/tmp/498/inv_6_ --invariant=/tmp/498/inv_7_ --invariant=/tmp/498/inv_8_ --invariant=/tmp/498/inv_9_ --invariant=/tmp/498/inv_10_ --invariant=/tmp/498/inv_11_ --invariant=/tmp/498/inv_12_ --invariant=/tmp/498/inv_13_ --invariant=/tmp/498/inv_14_ --invariant=/tmp/498/inv_15_ --inv-par
FORMULA ASLink-PT-02a-ReachabilityFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ASLink-PT-02a-ReachabilityFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ASLink-PT-02a-ReachabilityFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ASLink-PT-02a-ReachabilityFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ASLink-PT-02a-ReachabilityFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ASLink-PT-02a-ReachabilityFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ASLink-PT-02a-ReachabilityFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ASLink-PT-02a-ReachabilityFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ASLink-PT-02a-ReachabilityFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ASLink-PT-02a-ReachabilityFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ASLink-PT-02a-ReachabilityFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ASLink-PT-02a-ReachabilityFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ASLink-PT-02a-ReachabilityFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ASLink-PT-02a-ReachabilityFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ASLink-PT-02a-ReachabilityFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ASLink-PT-02a-ReachabilityFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678602622770

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name ASLink-PT-02a-ReachabilityFireability-00
rfs formula type EF
rfs formula formula --invariant=/tmp/498/inv_0_
rfs formula name ASLink-PT-02a-ReachabilityFireability-01
rfs formula type AG
rfs formula formula --invariant=/tmp/498/inv_1_
rfs formula name ASLink-PT-02a-ReachabilityFireability-02
rfs formula type EF
rfs formula formula --invariant=/tmp/498/inv_2_
rfs formula name ASLink-PT-02a-ReachabilityFireability-03
rfs formula type EF
rfs formula formula --invariant=/tmp/498/inv_3_
rfs formula name ASLink-PT-02a-ReachabilityFireability-04
rfs formula type EF
rfs formula formula --invariant=/tmp/498/inv_4_
rfs formula name ASLink-PT-02a-ReachabilityFireability-05
rfs formula type EF
rfs formula formula --invariant=/tmp/498/inv_5_
rfs formula name ASLink-PT-02a-ReachabilityFireability-06
rfs formula type EF
rfs formula formula --invariant=/tmp/498/inv_6_
rfs formula name ASLink-PT-02a-ReachabilityFireability-07
rfs formula type EF
rfs formula formula --invariant=/tmp/498/inv_7_
rfs formula name ASLink-PT-02a-ReachabilityFireability-08
rfs formula type AG
rfs formula formula --invariant=/tmp/498/inv_8_
rfs formula name ASLink-PT-02a-ReachabilityFireability-09
rfs formula type EF
rfs formula formula --invariant=/tmp/498/inv_9_
rfs formula name ASLink-PT-02a-ReachabilityFireability-10
rfs formula type AG
rfs formula formula --invariant=/tmp/498/inv_10_
rfs formula name ASLink-PT-02a-ReachabilityFireability-11
rfs formula type EF
rfs formula formula --invariant=/tmp/498/inv_11_
rfs formula name ASLink-PT-02a-ReachabilityFireability-12
rfs formula type AG
rfs formula formula --invariant=/tmp/498/inv_12_
rfs formula name ASLink-PT-02a-ReachabilityFireability-13
rfs formula type EF
rfs formula formula --invariant=/tmp/498/inv_13_
rfs formula name ASLink-PT-02a-ReachabilityFireability-14
rfs formula type AG
rfs formula formula --invariant=/tmp/498/inv_14_
rfs formula name ASLink-PT-02a-ReachabilityFireability-15
rfs formula type EF
rfs formula formula --invariant=/tmp/498/inv_15_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 626 places, 1008 transitions and 3820 arcs
pnml2lts-sym: Petri net ASLink-PT-02a analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 1008->998 groups
pnml2lts-sym: Regrouping took 0.320 real 0.330 user 0.000 sys
pnml2lts-sym: state vector length is 626; there are 998 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/498/inv_4_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/498/inv_8_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/498/inv_14_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/498/inv_10_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/498/inv_12_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/498/inv_11_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/498/inv_3_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/498/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 31288396 group checks and 0 next state calls
pnml2lts-sym: reachability took 257.350 real 1025.150 user 3.500 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.060 real 0.240 user 0.000 sys
pnml2lts-sym: state space has 8867298448856 states, 520491 nodes
pnml2lts-sym: group_next: 3413 nodes total
pnml2lts-sym: group_explored: 4327 nodes, 3103 short vectors total
pnml2lts-sym: max token count: 1

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-02a"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ASLink-PT-02a, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r009-oct2-167813597300031"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-02a.tgz
mv ASLink-PT-02a execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;