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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 768K
-rw-r--r-- 1 mcc users 8.3K Feb 26 13:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 13:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 13:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 13:02 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 26K 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.2K Feb 26 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 13:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 13:03 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 357K 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-03a-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678602919692

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-03a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 06:35:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 06:35:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 06:35:22] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2023-03-12 06:35:22] [INFO ] Transformed 821 places.
[2023-03-12 06:35:22] [INFO ] Transformed 1281 transitions.
[2023-03-12 06:35:22] [INFO ] Found NUPN structural information;
[2023-03-12 06:35:22] [INFO ] Parsed PT model containing 821 places and 1281 transitions and 4839 arcs in 250 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 13 transitions
Reduce redundant transitions removed 13 transitions.
Incomplete random walk after 10000 steps, including 91 resets, run finished after 577 ms. (steps per millisecond=17 ) properties (out of 16) seen :5
FORMULA ASLink-PT-03a-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :1
FORMULA ASLink-PT-03a-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 1268 rows 821 cols
[2023-03-12 06:35:24] [INFO ] Computed 156 place invariants in 53 ms
[2023-03-12 06:35:24] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2023-03-12 06:35:24] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 38 ms returned sat
[2023-03-12 06:35:24] [INFO ] After 556ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 06:35:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 9 ms returned sat
[2023-03-12 06:35:25] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 35 ms returned sat
[2023-03-12 06:35:40] [INFO ] After 15417ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :3
[2023-03-12 06:35:41] [INFO ] Deduced a trap composed of 38 places in 428 ms of which 8 ms to minimize.
[2023-03-12 06:35:41] [INFO ] Deduced a trap composed of 25 places in 221 ms of which 12 ms to minimize.
[2023-03-12 06:35:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 820 ms
[2023-03-12 06:35:42] [INFO ] After 17285ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :3
Attempting to minimize the solution found.
Minimization took 421 ms.
[2023-03-12 06:35:43] [INFO ] After 18250ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :3
FORMULA ASLink-PT-03a-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-03a-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-03a-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-03a-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-03a-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-03a-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 90 ms.
Support contains 7 out of 821 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 821/821 places, 1268/1268 transitions.
Ensure Unique test removed 12 places
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 803 transition count 1201
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 152 place count 736 transition count 1201
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 152 place count 736 transition count 1132
Deduced a syphon composed of 69 places in 4 ms
Ensure Unique test removed 27 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 165 rules applied. Total rules applied 317 place count 640 transition count 1132
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 318 place count 640 transition count 1131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 319 place count 639 transition count 1131
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 325 place count 633 transition count 1102
Ensure Unique test removed 1 places
Iterating global reduction 4 with 7 rules applied. Total rules applied 332 place count 632 transition count 1102
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 4 with 6 rules applied. Total rules applied 338 place count 631 transition count 1097
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 341 place count 628 transition count 1097
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 342 place count 627 transition count 1089
Iterating global reduction 6 with 1 rules applied. Total rules applied 343 place count 627 transition count 1089
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 344 place count 626 transition count 1081
Iterating global reduction 6 with 1 rules applied. Total rules applied 345 place count 626 transition count 1081
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 346 place count 625 transition count 1073
Iterating global reduction 6 with 1 rules applied. Total rules applied 347 place count 625 transition count 1073
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 348 place count 624 transition count 1065
Iterating global reduction 6 with 1 rules applied. Total rules applied 349 place count 624 transition count 1065
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 350 place count 623 transition count 1057
Iterating global reduction 6 with 1 rules applied. Total rules applied 351 place count 623 transition count 1057
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 352 place count 622 transition count 1049
Iterating global reduction 6 with 1 rules applied. Total rules applied 353 place count 622 transition count 1049
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 354 place count 621 transition count 1041
Iterating global reduction 6 with 1 rules applied. Total rules applied 355 place count 621 transition count 1041
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 356 place count 620 transition count 1033
Iterating global reduction 6 with 1 rules applied. Total rules applied 357 place count 620 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 358 place count 619 transition count 1025
Iterating global reduction 6 with 1 rules applied. Total rules applied 359 place count 619 transition count 1025
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 360 place count 618 transition count 1017
Iterating global reduction 6 with 1 rules applied. Total rules applied 361 place count 618 transition count 1017
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 362 place count 617 transition count 1009
Iterating global reduction 6 with 1 rules applied. Total rules applied 363 place count 617 transition count 1009
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 364 place count 616 transition count 1001
Iterating global reduction 6 with 1 rules applied. Total rules applied 365 place count 616 transition count 1001
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 366 place count 615 transition count 993
Iterating global reduction 6 with 1 rules applied. Total rules applied 367 place count 615 transition count 993
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 368 place count 614 transition count 985
Iterating global reduction 6 with 1 rules applied. Total rules applied 369 place count 614 transition count 985
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 370 place count 613 transition count 977
Iterating global reduction 6 with 1 rules applied. Total rules applied 371 place count 613 transition count 977
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 372 place count 612 transition count 969
Iterating global reduction 6 with 1 rules applied. Total rules applied 373 place count 612 transition count 969
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 415 place count 591 transition count 948
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 419 place count 591 transition count 944
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 423 place count 587 transition count 944
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 426 place count 587 transition count 944
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 427 place count 586 transition count 943
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 433 place count 580 transition count 943
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 10 Pre rules applied. Total rules applied 433 place count 580 transition count 933
Deduced a syphon composed of 10 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 21 rules applied. Total rules applied 454 place count 569 transition count 933
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 8 with 3 rules applied. Total rules applied 457 place count 566 transition count 933
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 457 place count 566 transition count 932
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 459 place count 565 transition count 932
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 465 place count 562 transition count 929
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 467 place count 560 transition count 927
Iterating global reduction 9 with 2 rules applied. Total rules applied 469 place count 560 transition count 927
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 471 place count 560 transition count 925
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 473 place count 558 transition count 925
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 476 place count 558 transition count 925
Applied a total of 476 rules in 701 ms. Remains 558 /821 variables (removed 263) and now considering 925/1268 (removed 343) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 701 ms. Remains : 558/821 places, 925/1268 transitions.
Incomplete random walk after 10000 steps, including 128 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 4) seen :1
FORMULA ASLink-PT-03a-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 925 rows 558 cols
[2023-03-12 06:35:44] [INFO ] Computed 99 place invariants in 34 ms
[2023-03-12 06:35:44] [INFO ] [Real]Absence check using 25 positive place invariants in 6 ms returned sat
[2023-03-12 06:35:44] [INFO ] [Real]Absence check using 25 positive and 74 generalized place invariants in 20 ms returned sat
[2023-03-12 06:35:44] [INFO ] After 436ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 06:35:44] [INFO ] [Nat]Absence check using 25 positive place invariants in 7 ms returned sat
[2023-03-12 06:35:44] [INFO ] [Nat]Absence check using 25 positive and 74 generalized place invariants in 38 ms returned sat
[2023-03-12 06:35:51] [INFO ] After 6276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 06:35:51] [INFO ] After 6683ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 226 ms.
[2023-03-12 06:35:51] [INFO ] After 7163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7 ms.
Support contains 5 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 925/925 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 558 transition count 924
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 557 transition count 924
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 556 transition count 924
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 555 transition count 923
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 554 transition count 922
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 554 transition count 922
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 554 transition count 921
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 553 transition count 921
Applied a total of 9 rules in 96 ms. Remains 553 /558 variables (removed 5) and now considering 921/925 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 553/558 places, 921/925 transitions.
Incomplete random walk after 10000 steps, including 141 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 238973 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 238973 steps, saw 102284 distinct states, run finished after 3006 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 921 rows 553 cols
[2023-03-12 06:35:55] [INFO ] Computed 98 place invariants in 12 ms
[2023-03-12 06:35:55] [INFO ] [Real]Absence check using 25 positive place invariants in 13 ms returned sat
[2023-03-12 06:35:55] [INFO ] [Real]Absence check using 25 positive and 73 generalized place invariants in 21 ms returned sat
[2023-03-12 06:35:55] [INFO ] After 666ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 06:35:56] [INFO ] [Nat]Absence check using 25 positive place invariants in 7 ms returned sat
[2023-03-12 06:35:56] [INFO ] [Nat]Absence check using 25 positive and 73 generalized place invariants in 20 ms returned sat
[2023-03-12 06:35:56] [INFO ] After 391ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 06:36:03] [INFO ] After 7133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 178 ms.
[2023-03-12 06:36:03] [INFO ] After 7487ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 31 ms.
Support contains 5 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 921/921 transitions.
Applied a total of 0 rules in 41 ms. Remains 553 /553 variables (removed 0) and now considering 921/921 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 553/553 places, 921/921 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 921/921 transitions.
Applied a total of 0 rules in 27 ms. Remains 553 /553 variables (removed 0) and now considering 921/921 (removed 0) transitions.
[2023-03-12 06:36:03] [INFO ] Invariant cache hit.
[2023-03-12 06:36:04] [INFO ] Implicit Places using invariants in 934 ms returned [0, 18, 19, 30, 48, 66, 141, 150, 151, 152, 170, 188, 257, 261, 262, 273, 274, 275, 293, 311, 380, 384, 385, 388, 399, 400, 401, 419, 421, 424, 442, 443, 444, 445, 457, 463, 469, 475, 481, 487, 493, 499, 505, 511, 517]
Discarding 45 places :
Implicit Place search using SMT only with invariants took 949 ms to find 45 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 508/553 places, 921/921 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 508 transition count 851
Reduce places removed 70 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 73 rules applied. Total rules applied 143 place count 438 transition count 848
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 146 place count 435 transition count 848
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 146 place count 435 transition count 829
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 39 rules applied. Total rules applied 185 place count 415 transition count 829
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 197 place count 411 transition count 821
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 205 place count 403 transition count 821
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 220 place count 388 transition count 806
Iterating global reduction 5 with 15 rules applied. Total rules applied 235 place count 388 transition count 806
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 238 place count 388 transition count 803
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 238 place count 388 transition count 802
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 240 place count 387 transition count 802
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 243 place count 384 transition count 799
Iterating global reduction 6 with 3 rules applied. Total rules applied 246 place count 384 transition count 799
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 247 place count 383 transition count 798
Iterating global reduction 6 with 1 rules applied. Total rules applied 248 place count 383 transition count 798
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 249 place count 382 transition count 797
Iterating global reduction 6 with 1 rules applied. Total rules applied 250 place count 382 transition count 797
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 316 place count 349 transition count 764
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 318 place count 349 transition count 762
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 320 place count 347 transition count 760
Iterating global reduction 7 with 2 rules applied. Total rules applied 322 place count 347 transition count 760
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 324 place count 347 transition count 758
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 330 place count 347 transition count 752
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 337 place count 340 transition count 752
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 347 place count 340 transition count 752
Applied a total of 347 rules in 197 ms. Remains 340 /508 variables (removed 168) and now considering 752/921 (removed 169) transitions.
// Phase 1: matrix 752 rows 340 cols
[2023-03-12 06:36:04] [INFO ] Computed 47 place invariants in 5 ms
[2023-03-12 06:36:04] [INFO ] Implicit Places using invariants in 327 ms returned [90, 96, 99, 101, 110, 111, 163, 180, 186, 189, 191, 196, 197, 249, 266, 272, 275, 277]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 329 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 322/553 places, 752/921 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 313 transition count 743
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 313 transition count 743
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 310 transition count 740
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 310 transition count 740
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 34 place count 305 transition count 735
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 43 place count 305 transition count 726
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 52 place count 296 transition count 726
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 296 transition count 724
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 56 place count 294 transition count 724
Applied a total of 56 rules in 47 ms. Remains 294 /322 variables (removed 28) and now considering 724/752 (removed 28) transitions.
// Phase 1: matrix 724 rows 294 cols
[2023-03-12 06:36:05] [INFO ] Computed 29 place invariants in 4 ms
[2023-03-12 06:36:05] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-12 06:36:05] [INFO ] Invariant cache hit.
[2023-03-12 06:36:06] [INFO ] Implicit Places using invariants and state equation in 754 ms returned []
Implicit Place search using SMT with State Equation took 1088 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 294/553 places, 724/921 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2637 ms. Remains : 294/553 places, 724/921 transitions.
Incomplete random walk after 10000 steps, including 221 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 75 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 291632 steps, run timeout after 3006 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 291632 steps, saw 214090 distinct states, run finished after 3006 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 06:36:09] [INFO ] Invariant cache hit.
[2023-03-12 06:36:09] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 06:36:09] [INFO ] [Real]Absence check using 8 positive and 21 generalized place invariants in 13 ms returned sat
[2023-03-12 06:36:09] [INFO ] After 324ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 06:36:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 38 ms returned sat
[2023-03-12 06:36:09] [INFO ] [Nat]Absence check using 8 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-12 06:36:15] [INFO ] After 5341ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 06:36:15] [INFO ] After 5662ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 206 ms.
[2023-03-12 06:36:15] [INFO ] After 6045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 28 ms.
Support contains 5 out of 294 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 294/294 places, 724/724 transitions.
Applied a total of 0 rules in 14 ms. Remains 294 /294 variables (removed 0) and now considering 724/724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 294/294 places, 724/724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 294/294 places, 724/724 transitions.
Applied a total of 0 rules in 12 ms. Remains 294 /294 variables (removed 0) and now considering 724/724 (removed 0) transitions.
[2023-03-12 06:36:15] [INFO ] Invariant cache hit.
[2023-03-12 06:36:15] [INFO ] Implicit Places using invariants in 247 ms returned []
[2023-03-12 06:36:15] [INFO ] Invariant cache hit.
[2023-03-12 06:36:16] [INFO ] Implicit Places using invariants and state equation in 616 ms returned []
Implicit Place search using SMT with State Equation took 880 ms to find 0 implicit places.
[2023-03-12 06:36:16] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-12 06:36:16] [INFO ] Invariant cache hit.
[2023-03-12 06:36:16] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1251 ms. Remains : 294/294 places, 724/724 transitions.
Applied a total of 0 rules in 8 ms. Remains 294 /294 variables (removed 0) and now considering 724/724 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-12 06:36:16] [INFO ] Invariant cache hit.
[2023-03-12 06:36:17] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 06:36:17] [INFO ] [Real]Absence check using 8 positive and 21 generalized place invariants in 6 ms returned sat
[2023-03-12 06:36:17] [INFO ] After 405ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 06:36:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-12 06:36:17] [INFO ] [Nat]Absence check using 8 positive and 21 generalized place invariants in 16 ms returned sat
[2023-03-12 06:36:23] [INFO ] After 5578ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 06:36:23] [INFO ] After 5857ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 316 ms.
[2023-03-12 06:36:23] [INFO ] After 6402ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-12 06:36:23] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 19 ms.
[2023-03-12 06:36:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 294 places, 724 transitions and 2930 arcs took 14 ms.
[2023-03-12 06:36:24] [INFO ] Flatten gal took : 172 ms
Total runtime 62263 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/550/inv_0_ --invariant=/tmp/550/inv_1_ --invariant=/tmp/550/inv_2_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 13887256 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16100272 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-03a"
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-03a, 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-167813597300047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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