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.r010-oct2-167813598500063.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 marciexred
Input is ASLink-PT-04a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813598500063
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 988K
-rw-r--r-- 1 mcc users 6.5K Feb 26 13:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 13:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 13:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 13:03 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.2K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Feb 26 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Feb 26 13:04 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 436K 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-04a-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678659325993

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=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-04a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 22:15:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 22:15:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 22:15:28] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2023-03-12 22:15:28] [INFO ] Transformed 1016 places.
[2023-03-12 22:15:28] [INFO ] Transformed 1554 transitions.
[2023-03-12 22:15:28] [INFO ] Found NUPN structural information;
[2023-03-12 22:15:28] [INFO ] Parsed PT model containing 1016 places and 1554 transitions and 5858 arcs in 247 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 16 transitions
Reduce redundant transitions removed 16 transitions.
Incomplete random walk after 10000 steps, including 69 resets, run finished after 461 ms. (steps per millisecond=21 ) properties (out of 16) seen :5
FORMULA ASLink-PT-04a-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04a-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04a-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04a-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04a-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 13 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 11 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1538 rows 1016 cols
[2023-03-12 22:15:30] [INFO ] Computed 194 place invariants in 58 ms
[2023-03-12 22:15:31] [INFO ] [Real]Absence check using 46 positive place invariants in 19 ms returned sat
[2023-03-12 22:15:31] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 128 ms returned sat
[2023-03-12 22:15:31] [INFO ] After 926ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-12 22:15:32] [INFO ] [Nat]Absence check using 46 positive place invariants in 17 ms returned sat
[2023-03-12 22:15:32] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 69 ms returned sat
[2023-03-12 22:15:57] [INFO ] After 24050ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :2
[2023-03-12 22:15:57] [INFO ] After 24055ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :2
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-12 22:15:57] [INFO ] After 25065ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :2
FORMULA ASLink-PT-04a-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-04a-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-04a-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-04a-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-04a-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-04a-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 177 ms.
Support contains 288 out of 1016 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1016/1016 places, 1538/1538 transitions.
Ensure Unique test removed 15 places
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 996 transition count 1493
Reduce places removed 45 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 52 rules applied. Total rules applied 117 place count 951 transition count 1486
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 124 place count 944 transition count 1486
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 124 place count 944 transition count 1419
Deduced a syphon composed of 67 places in 3 ms
Ensure Unique test removed 17 places
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 151 rules applied. Total rules applied 275 place count 860 transition count 1419
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 280 place count 855 transition count 1399
Iterating global reduction 3 with 5 rules applied. Total rules applied 285 place count 855 transition count 1399
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 288 place count 854 transition count 1397
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 289 place count 853 transition count 1397
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 325 place count 835 transition count 1379
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 327 place count 835 transition count 1377
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 329 place count 833 transition count 1377
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 334 place count 833 transition count 1377
Applied a total of 334 rules in 335 ms. Remains 833 /1016 variables (removed 183) and now considering 1377/1538 (removed 161) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 336 ms. Remains : 833/1016 places, 1377/1538 transitions.
Incomplete random walk after 10000 steps, including 85 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 127606 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{3=1}
Probabilistic random walk after 127606 steps, saw 59656 distinct states, run finished after 3002 ms. (steps per millisecond=42 ) properties seen :1
FORMULA ASLink-PT-04a-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 4 properties.
// Phase 1: matrix 1377 rows 833 cols
[2023-03-12 22:16:01] [INFO ] Computed 156 place invariants in 44 ms
[2023-03-12 22:16:01] [INFO ] After 308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 22:16:01] [INFO ] [Nat]Absence check using 42 positive place invariants in 9 ms returned sat
[2023-03-12 22:16:01] [INFO ] [Nat]Absence check using 42 positive and 114 generalized place invariants in 47 ms returned sat
[2023-03-12 22:16:16] [INFO ] After 14833ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-12 22:16:16] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-12 22:16:17] [INFO ] After 1023ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2023-03-12 22:16:20] [INFO ] After 3279ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 2197 ms.
[2023-03-12 22:16:22] [INFO ] After 20579ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
FORMULA ASLink-PT-04a-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-04a-ReachabilityFireability-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 84 ms.
Support contains 135 out of 833 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 833/833 places, 1377/1377 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 832 transition count 1366
Reduce places removed 11 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 14 rules applied. Total rules applied 26 place count 821 transition count 1363
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 818 transition count 1363
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 29 place count 818 transition count 1346
Deduced a syphon composed of 17 places in 8 ms
Ensure Unique test removed 7 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 41 rules applied. Total rules applied 70 place count 794 transition count 1346
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 72 place count 793 transition count 1345
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 792 transition count 1345
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 75 place count 790 transition count 1338
Ensure Unique test removed 1 places
Iterating global reduction 5 with 3 rules applied. Total rules applied 78 place count 789 transition count 1338
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 80 place count 789 transition count 1336
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 81 place count 788 transition count 1336
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 8 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 89 place count 784 transition count 1332
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 91 place count 784 transition count 1330
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 93 place count 782 transition count 1330
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 95 place count 782 transition count 1328
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 97 place count 780 transition count 1328
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 98 place count 780 transition count 1328
Applied a total of 98 rules in 266 ms. Remains 780 /833 variables (removed 53) and now considering 1328/1377 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 266 ms. Remains : 780/833 places, 1328/1377 transitions.
Incomplete random walk after 10000 steps, including 90 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 228164 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 228164 steps, saw 95062 distinct states, run finished after 3002 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1328 rows 780 cols
[2023-03-12 22:16:25] [INFO ] Computed 146 place invariants in 14 ms
[2023-03-12 22:16:26] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 22:16:26] [INFO ] [Nat]Absence check using 40 positive place invariants in 12 ms returned sat
[2023-03-12 22:16:26] [INFO ] [Nat]Absence check using 40 positive and 106 generalized place invariants in 28 ms returned sat
[2023-03-12 22:16:32] [INFO ] After 6290ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-12 22:16:32] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-12 22:16:34] [INFO ] After 1344ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-12 22:16:36] [INFO ] Deduced a trap composed of 68 places in 1198 ms of which 2 ms to minimize.
[2023-03-12 22:16:37] [INFO ] Deduced a trap composed of 66 places in 706 ms of which 3 ms to minimize.
[2023-03-12 22:16:37] [INFO ] Deduced a trap composed of 64 places in 563 ms of which 3 ms to minimize.
[2023-03-12 22:16:38] [INFO ] Deduced a trap composed of 66 places in 659 ms of which 22 ms to minimize.
[2023-03-12 22:16:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3405 ms
[2023-03-12 22:16:38] [INFO ] After 6127ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 2774 ms.
[2023-03-12 22:16:41] [INFO ] After 15432ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA ASLink-PT-04a-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 46 ms.
Support contains 36 out of 780 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 780/780 places, 1328/1328 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 779 transition count 1319
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 770 transition count 1319
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 19 place count 770 transition count 1309
Deduced a syphon composed of 10 places in 2 ms
Ensure Unique test removed 8 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 47 place count 752 transition count 1309
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 751 transition count 1300
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 751 transition count 1300
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 750 transition count 1292
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 750 transition count 1292
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 749 transition count 1284
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 749 transition count 1284
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 748 transition count 1276
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 748 transition count 1276
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 747 transition count 1268
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 747 transition count 1268
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 65 place count 743 transition count 1264
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 743 transition count 1264
Applied a total of 66 rules in 201 ms. Remains 743 /780 variables (removed 37) and now considering 1264/1328 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 743/780 places, 1264/1328 transitions.
Incomplete random walk after 10000 steps, including 99 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 306508 steps, run timeout after 3002 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 306508 steps, saw 127260 distinct states, run finished after 3010 ms. (steps per millisecond=101 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1264 rows 743 cols
[2023-03-12 22:16:44] [INFO ] Computed 137 place invariants in 11 ms
[2023-03-12 22:16:45] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 22:16:45] [INFO ] [Nat]Absence check using 38 positive place invariants in 9 ms returned sat
[2023-03-12 22:16:45] [INFO ] [Nat]Absence check using 38 positive and 99 generalized place invariants in 40 ms returned sat
[2023-03-12 22:16:47] [INFO ] After 2496ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 22:16:47] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-12 22:16:51] [INFO ] After 3559ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 22:16:53] [INFO ] After 5494ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5295 ms.
[2023-03-12 22:16:58] [INFO ] After 13495ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 36 out of 743 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 743/743 places, 1264/1264 transitions.
Applied a total of 0 rules in 24 ms. Remains 743 /743 variables (removed 0) and now considering 1264/1264 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 743/743 places, 1264/1264 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 743/743 places, 1264/1264 transitions.
Applied a total of 0 rules in 22 ms. Remains 743 /743 variables (removed 0) and now considering 1264/1264 (removed 0) transitions.
[2023-03-12 22:16:58] [INFO ] Invariant cache hit.
[2023-03-12 22:16:59] [INFO ] Implicit Places using invariants in 946 ms returned [1, 19, 20, 22, 32, 50, 68, 154, 167, 168, 171, 189, 207, 287, 300, 301, 302, 303, 304, 322, 340, 420, 436, 437, 438, 439, 440, 458, 476, 557, 562, 574, 575, 576, 577, 578, 608, 610, 613, 631, 632, 633, 634, 647, 653, 659, 665, 671, 677, 683, 689, 695, 701, 707]
Discarding 54 places :
Implicit Place search using SMT only with invariants took 964 ms to find 54 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 689/743 places, 1264/1264 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 689 transition count 1187
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 154 place count 612 transition count 1187
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 154 place count 612 transition count 1156
Deduced a syphon composed of 31 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 63 rules applied. Total rules applied 217 place count 580 transition count 1156
Discarding 13 places :
Implicit places reduction removed 13 places
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 2 with 28 rules applied. Total rules applied 245 place count 567 transition count 1141
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 260 place count 552 transition count 1141
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 260 place count 552 transition count 1140
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 262 place count 551 transition count 1140
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 278 place count 535 transition count 1124
Iterating global reduction 4 with 16 rules applied. Total rules applied 294 place count 535 transition count 1124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 297 place count 535 transition count 1121
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 297 place count 535 transition count 1120
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 299 place count 534 transition count 1120
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 303 place count 530 transition count 1116
Iterating global reduction 5 with 4 rules applied. Total rules applied 307 place count 530 transition count 1116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 308 place count 530 transition count 1115
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 309 place count 529 transition count 1114
Iterating global reduction 6 with 1 rules applied. Total rules applied 310 place count 529 transition count 1114
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 311 place count 528 transition count 1113
Iterating global reduction 6 with 1 rules applied. Total rules applied 312 place count 528 transition count 1113
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 84 rules applied. Total rules applied 396 place count 486 transition count 1071
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 400 place count 482 transition count 1067
Iterating global reduction 6 with 4 rules applied. Total rules applied 404 place count 482 transition count 1067
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 407 place count 482 transition count 1064
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 411 place count 482 transition count 1060
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 417 place count 478 transition count 1058
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 8 with 20 rules applied. Total rules applied 437 place count 478 transition count 1038
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 458 place count 457 transition count 1038
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 459 place count 457 transition count 1037
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 472 place count 457 transition count 1037
Applied a total of 472 rules in 215 ms. Remains 457 /689 variables (removed 232) and now considering 1037/1264 (removed 227) transitions.
// Phase 1: matrix 1037 rows 457 cols
[2023-03-12 22:16:59] [INFO ] Computed 68 place invariants in 14 ms
[2023-03-12 22:17:00] [INFO ] Implicit Places using invariants in 380 ms returned [73, 110, 118, 119, 173, 190, 196, 199, 201, 202, 207, 208, 260, 277, 283, 286, 288, 289, 296, 297, 351, 368, 374, 377, 379, 380]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 382 ms to find 26 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 431/743 places, 1037/1264 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 422 transition count 1028
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 422 transition count 1028
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 419 transition count 1025
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 419 transition count 1025
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 38 place count 412 transition count 1018
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 47 place count 412 transition count 1009
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 56 place count 403 transition count 1009
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 403 transition count 1005
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 64 place count 399 transition count 1005
Applied a total of 64 rules in 80 ms. Remains 399 /431 variables (removed 32) and now considering 1005/1037 (removed 32) transitions.
// Phase 1: matrix 1005 rows 399 cols
[2023-03-12 22:17:00] [INFO ] Computed 42 place invariants in 7 ms
[2023-03-12 22:17:00] [INFO ] Implicit Places using invariants in 496 ms returned []
[2023-03-12 22:17:00] [INFO ] Invariant cache hit.
[2023-03-12 22:17:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 22:17:01] [INFO ] Implicit Places using invariants and state equation in 1080 ms returned []
Implicit Place search using SMT with State Equation took 1580 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 399/743 places, 1005/1264 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3244 ms. Remains : 399/743 places, 1005/1264 transitions.
Incomplete random walk after 10000 steps, including 182 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Finished probabilistic random walk after 74344 steps, run visited all 1 properties in 384 ms. (steps per millisecond=193 )
Probabilistic random walk after 74344 steps, saw 54136 distinct states, run finished after 385 ms. (steps per millisecond=193 ) properties seen :1
FORMULA ASLink-PT-04a-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 94045 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ASLink_PT_04a
(NrP: 1016 NrTr: 1554 NrArc: 5858)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.110sec

net check time: 0m 0.000sec

init dd package: 0m 2.980sec


before gc: list nodes free: 1604899

after gc: idd nodes used:74516, unused:63925484; list nodes free:266016862

before gc: list nodes free: 1249796

after gc: idd nodes used:81909, unused:63918091; list nodes free:265985361

before gc: list nodes free: 1210874

after gc: idd nodes used:95093, unused:63904907; list nodes free:265929139
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6552336 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16099756 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.011sec

15440 17218 17982 18124 19342 46915 64309 66715 74378 84404 90691 88985 93836

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-04a"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is ASLink-PT-04a, 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 r010-oct2-167813598500063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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