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-167813597400095.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-06a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597400095
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 13:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 13:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 13:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 13:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 13:09 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 597K 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-06a-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678610027025

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-06a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 08:33:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 08:33:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 08:33:50] [INFO ] Load time of PNML (sax parser for PT used): 278 ms
[2023-03-12 08:33:50] [INFO ] Transformed 1406 places.
[2023-03-12 08:33:50] [INFO ] Transformed 2100 transitions.
[2023-03-12 08:33:50] [INFO ] Found NUPN structural information;
[2023-03-12 08:33:50] [INFO ] Parsed PT model containing 1406 places and 2100 transitions and 7896 arcs in 423 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 22 transitions
Reduce redundant transitions removed 22 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 586 ms. (steps per millisecond=17 ) properties (out of 16) seen :5
FORMULA ASLink-PT-06a-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :1
FORMULA ASLink-PT-06a-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2078 rows 1406 cols
[2023-03-12 08:33:52] [INFO ] Computed 270 place invariants in 100 ms
[2023-03-12 08:33:53] [INFO ] After 926ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 08:33:53] [INFO ] [Nat]Absence check using 66 positive place invariants in 34 ms returned sat
[2023-03-12 08:33:54] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 222 ms returned sat
[2023-03-12 08:34:18] [INFO ] After 23884ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2023-03-12 08:34:18] [INFO ] After 23914ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :5
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-12 08:34:18] [INFO ] After 25101ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :5
FORMULA ASLink-PT-06a-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-06a-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-06a-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 428 ms.
Support contains 58 out of 1406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1406/1406 places, 2078/2078 transitions.
Ensure Unique test removed 24 places
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 153 rules applied. Total rules applied 153 place count 1370 transition count 1961
Reduce places removed 117 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 121 rules applied. Total rules applied 274 place count 1253 transition count 1957
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 278 place count 1249 transition count 1957
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 124 Pre rules applied. Total rules applied 278 place count 1249 transition count 1833
Deduced a syphon composed of 124 places in 7 ms
Ensure Unique test removed 47 places
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 3 with 295 rules applied. Total rules applied 573 place count 1078 transition count 1833
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 1 rules applied. Total rules applied 574 place count 1078 transition count 1832
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 575 place count 1077 transition count 1832
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 583 place count 1069 transition count 1791
Ensure Unique test removed 1 places
Iterating global reduction 5 with 9 rules applied. Total rules applied 592 place count 1068 transition count 1791
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 598 place count 1067 transition count 1786
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 601 place count 1064 transition count 1786
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 602 place count 1063 transition count 1778
Iterating global reduction 7 with 1 rules applied. Total rules applied 603 place count 1063 transition count 1778
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 604 place count 1062 transition count 1770
Iterating global reduction 7 with 1 rules applied. Total rules applied 605 place count 1062 transition count 1770
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 606 place count 1061 transition count 1762
Iterating global reduction 7 with 1 rules applied. Total rules applied 607 place count 1061 transition count 1762
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 608 place count 1060 transition count 1754
Iterating global reduction 7 with 1 rules applied. Total rules applied 609 place count 1060 transition count 1754
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 610 place count 1059 transition count 1746
Iterating global reduction 7 with 1 rules applied. Total rules applied 611 place count 1059 transition count 1746
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 612 place count 1058 transition count 1738
Iterating global reduction 7 with 1 rules applied. Total rules applied 613 place count 1058 transition count 1738
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 614 place count 1057 transition count 1730
Iterating global reduction 7 with 1 rules applied. Total rules applied 615 place count 1057 transition count 1730
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 616 place count 1056 transition count 1722
Iterating global reduction 7 with 1 rules applied. Total rules applied 617 place count 1056 transition count 1722
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 618 place count 1055 transition count 1714
Iterating global reduction 7 with 1 rules applied. Total rules applied 619 place count 1055 transition count 1714
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 80 rules applied. Total rules applied 699 place count 1015 transition count 1674
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 706 place count 1015 transition count 1667
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 713 place count 1008 transition count 1667
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 718 place count 1008 transition count 1667
Applied a total of 718 rules in 907 ms. Remains 1008 /1406 variables (removed 398) and now considering 1667/2078 (removed 411) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 908 ms. Remains : 1008/1406 places, 1667/2078 transitions.
Incomplete random walk after 10000 steps, including 95 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :1
FORMULA ASLink-PT-06a-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 66 ms. (steps per millisecond=151 ) 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 10000 steps, including 15 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1667 rows 1008 cols
[2023-03-12 08:34:20] [INFO ] Computed 185 place invariants in 30 ms
[2023-03-12 08:34:20] [INFO ] [Real]Absence check using 51 positive place invariants in 14 ms returned sat
[2023-03-12 08:34:20] [INFO ] [Real]Absence check using 51 positive and 134 generalized place invariants in 77 ms returned sat
[2023-03-12 08:34:20] [INFO ] After 342ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 08:34:21] [INFO ] [Nat]Absence check using 51 positive place invariants in 12 ms returned sat
[2023-03-12 08:34:21] [INFO ] [Nat]Absence check using 51 positive and 134 generalized place invariants in 46 ms returned sat
[2023-03-12 08:34:27] [INFO ] After 5917ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :3
[2023-03-12 08:34:27] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-12 08:34:29] [INFO ] After 1850ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :3 sat :3
[2023-03-12 08:34:29] [INFO ] Deduced a trap composed of 56 places in 461 ms of which 17 ms to minimize.
[2023-03-12 08:34:30] [INFO ] Deduced a trap composed of 25 places in 339 ms of which 7 ms to minimize.
[2023-03-12 08:34:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 1032 ms
[2023-03-12 08:34:31] [INFO ] After 4233ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :2
Attempting to minimize the solution found.
Minimization took 1312 ms.
[2023-03-12 08:34:32] [INFO ] After 11945ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :2
FORMULA ASLink-PT-06a-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-06a-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-06a-ReachabilityFireability-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-06a-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 131 ms.
Support contains 24 out of 1008 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1008/1008 places, 1667/1667 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 0 with 1 rules applied. Total rules applied 1 place count 1008 transition count 1666
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1007 transition count 1666
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 1007 transition count 1663
Deduced a syphon composed of 3 places in 4 ms
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 11 place count 1001 transition count 1663
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 999 transition count 1649
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 999 transition count 1649
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 998 transition count 1648
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 998 transition count 1648
Applied a total of 19 rules in 522 ms. Remains 998 /1008 variables (removed 10) and now considering 1648/1667 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 522 ms. Remains : 998/1008 places, 1648/1667 transitions.
Incomplete random walk after 10000 steps, including 97 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 145329 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 145329 steps, saw 45189 distinct states, run finished after 3002 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1648 rows 998 cols
[2023-03-12 08:34:36] [INFO ] Computed 182 place invariants in 46 ms
[2023-03-12 08:34:36] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 08:34:37] [INFO ] [Nat]Absence check using 50 positive place invariants in 65 ms returned sat
[2023-03-12 08:34:37] [INFO ] [Nat]Absence check using 50 positive and 132 generalized place invariants in 59 ms returned sat
[2023-03-12 08:34:45] [INFO ] After 8160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 08:34:45] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-12 08:34:55] [INFO ] After 10378ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 08:34:58] [INFO ] After 13477ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2952 ms.
[2023-03-12 08:35:01] [INFO ] After 25011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 127 ms.
Support contains 24 out of 998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 998/998 places, 1648/1648 transitions.
Applied a total of 0 rules in 39 ms. Remains 998 /998 variables (removed 0) and now considering 1648/1648 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 998/998 places, 1648/1648 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 998/998 places, 1648/1648 transitions.
Applied a total of 0 rules in 131 ms. Remains 998 /998 variables (removed 0) and now considering 1648/1648 (removed 0) transitions.
[2023-03-12 08:35:02] [INFO ] Invariant cache hit.
[2023-03-12 08:35:02] [INFO ] Implicit Places using invariants in 733 ms returned [1, 19, 20, 22, 32, 50, 136, 151, 164, 165, 166, 168, 186, 204, 284, 297, 298, 299, 300, 301, 319, 337, 418, 433, 434, 435, 436, 437, 455, 473, 554, 567, 568, 569, 571, 589, 607, 687, 700, 701, 702, 703, 704, 722, 740, 820, 825, 836, 837, 838, 839, 840, 864, 866, 869, 887, 888, 889, 890, 902, 908, 914, 920, 926, 932, 938, 944, 950, 956, 962]
Discarding 70 places :
Implicit Place search using SMT only with invariants took 755 ms to find 70 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 928/998 places, 1648/1648 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 928 transition count 1544
Reduce places removed 104 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 105 rules applied. Total rules applied 209 place count 824 transition count 1543
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 210 place count 823 transition count 1543
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 210 place count 823 transition count 1502
Deduced a syphon composed of 41 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 83 rules applied. Total rules applied 293 place count 781 transition count 1502
Discarding 17 places :
Implicit places reduction removed 17 places
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 3 with 35 rules applied. Total rules applied 328 place count 764 transition count 1484
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 346 place count 746 transition count 1484
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 346 place count 746 transition count 1483
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 348 place count 745 transition count 1483
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 364 place count 729 transition count 1467
Iterating global reduction 5 with 16 rules applied. Total rules applied 380 place count 729 transition count 1467
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 383 place count 729 transition count 1464
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 383 place count 729 transition count 1463
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 385 place count 728 transition count 1463
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 389 place count 724 transition count 1459
Iterating global reduction 6 with 4 rules applied. Total rules applied 393 place count 724 transition count 1459
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 394 place count 723 transition count 1458
Iterating global reduction 6 with 1 rules applied. Total rules applied 395 place count 723 transition count 1458
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 396 place count 722 transition count 1457
Iterating global reduction 6 with 1 rules applied. Total rules applied 397 place count 722 transition count 1457
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 2 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 6 with 122 rules applied. Total rules applied 519 place count 661 transition count 1396
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 524 place count 656 transition count 1391
Iterating global reduction 6 with 5 rules applied. Total rules applied 529 place count 656 transition count 1391
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 534 place count 656 transition count 1386
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 540 place count 656 transition count 1380
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 550 place count 650 transition count 1376
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 8 with 21 rules applied. Total rules applied 571 place count 650 transition count 1355
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 8 with 22 rules applied. Total rules applied 593 place count 628 transition count 1355
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 9 with 19 rules applied. Total rules applied 612 place count 628 transition count 1355
Applied a total of 612 rules in 353 ms. Remains 628 /928 variables (removed 300) and now considering 1355/1648 (removed 293) transitions.
// Phase 1: matrix 1355 rows 628 cols
[2023-03-12 08:35:03] [INFO ] Computed 93 place invariants in 11 ms
[2023-03-12 08:35:03] [INFO ] Implicit Places using invariants in 565 ms returned [74, 107, 117, 118, 171, 188, 194, 197, 199, 200, 205, 206, 258, 276, 282, 285, 287, 288, 293, 294, 346, 378, 384, 389, 390, 443, 460, 466, 469, 471, 472, 477, 478, 530, 547, 553, 556, 558, 559]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 568 ms to find 39 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 589/998 places, 1355/1648 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 577 transition count 1343
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 577 transition count 1343
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 573 transition count 1339
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 573 transition count 1339
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 50 place count 564 transition count 1330
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 62 place count 564 transition count 1318
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 74 place count 552 transition count 1318
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 79 place count 552 transition count 1313
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 84 place count 547 transition count 1313
Applied a total of 84 rules in 157 ms. Remains 547 /589 variables (removed 42) and now considering 1313/1355 (removed 42) transitions.
// Phase 1: matrix 1313 rows 547 cols
[2023-03-12 08:35:04] [INFO ] Computed 54 place invariants in 9 ms
[2023-03-12 08:35:04] [INFO ] Implicit Places using invariants in 396 ms returned []
[2023-03-12 08:35:04] [INFO ] Invariant cache hit.
[2023-03-12 08:35:04] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 08:35:06] [INFO ] Implicit Places using invariants and state equation in 2201 ms returned []
Implicit Place search using SMT with State Equation took 2599 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 547/998 places, 1313/1648 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4563 ms. Remains : 547/998 places, 1313/1648 transitions.
Incomplete random walk after 10000 steps, including 171 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 207215 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 207215 steps, saw 103027 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 08:35:09] [INFO ] Invariant cache hit.
[2023-03-12 08:35:10] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 08:35:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-12 08:35:10] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 25 ms returned sat
[2023-03-12 08:35:20] [INFO ] After 10355ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 08:35:20] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 08:35:20] [INFO ] After 242ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 08:35:21] [INFO ] After 637ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 196 ms.
[2023-03-12 08:35:21] [INFO ] After 11423ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 59 ms.
Support contains 24 out of 547 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 547/547 places, 1313/1313 transitions.
Applied a total of 0 rules in 47 ms. Remains 547 /547 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 547/547 places, 1313/1313 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 547/547 places, 1313/1313 transitions.
Applied a total of 0 rules in 15 ms. Remains 547 /547 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
[2023-03-12 08:35:21] [INFO ] Invariant cache hit.
[2023-03-12 08:35:22] [INFO ] Implicit Places using invariants in 808 ms returned []
[2023-03-12 08:35:22] [INFO ] Invariant cache hit.
[2023-03-12 08:35:23] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 08:35:24] [INFO ] Implicit Places using invariants and state equation in 1827 ms returned []
Implicit Place search using SMT with State Equation took 2652 ms to find 0 implicit places.
[2023-03-12 08:35:24] [INFO ] Redundant transitions in 82 ms returned []
[2023-03-12 08:35:24] [INFO ] Invariant cache hit.
[2023-03-12 08:35:25] [INFO ] Dead Transitions using invariants and state equation in 772 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3546 ms. Remains : 547/547 places, 1313/1313 transitions.
Applied a total of 0 rules in 17 ms. Remains 547 /547 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-12 08:35:25] [INFO ] Invariant cache hit.
[2023-03-12 08:35:25] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 08:35:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-12 08:35:25] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 24 ms returned sat
[2023-03-12 08:35:35] [INFO ] After 9909ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 08:35:35] [INFO ] After 10262ms 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-12 08:35:35] [INFO ] After 10502ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-12 08:35:35] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 20 ms.
[2023-03-12 08:35:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 547 places, 1313 transitions and 5320 arcs took 6 ms.
[2023-03-12 08:35:36] [INFO ] Flatten gal took : 302 ms
Total runtime 106767 ms.
There are residual formulas that ITS could not solve within timeout
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/558/inv_0_ --invariant=/tmp/558/inv_1_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 167024 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16302420 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023

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-06a"
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-06a, 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-167813597400095"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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