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

About the Execution of Marcie+red for ASLink-PT-04a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9591.584 3600000.00 3675378.00 182.00 T?T?TTTFFT?T?FFF normal

Execution Chart

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

Trace from the execution

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

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME ASLink-PT-04a-ReachabilityCardinality-01
FORMULA_NAME ASLink-PT-04a-ReachabilityCardinality-02
FORMULA_NAME ASLink-PT-04a-ReachabilityCardinality-03
FORMULA_NAME ASLink-PT-04a-ReachabilityCardinality-04
FORMULA_NAME ASLink-PT-04a-ReachabilityCardinality-05
FORMULA_NAME ASLink-PT-04a-ReachabilityCardinality-06
FORMULA_NAME ASLink-PT-04a-ReachabilityCardinality-07
FORMULA_NAME ASLink-PT-04a-ReachabilityCardinality-08
FORMULA_NAME ASLink-PT-04a-ReachabilityCardinality-09
FORMULA_NAME ASLink-PT-04a-ReachabilityCardinality-10
FORMULA_NAME ASLink-PT-04a-ReachabilityCardinality-11
FORMULA_NAME ASLink-PT-04a-ReachabilityCardinality-12
FORMULA_NAME ASLink-PT-04a-ReachabilityCardinality-13
FORMULA_NAME ASLink-PT-04a-ReachabilityCardinality-14
FORMULA_NAME ASLink-PT-04a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678659321455

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=ReachabilityCardinality
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:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 22:15:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 22:15:24] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2023-03-12 22:15:24] [INFO ] Transformed 1016 places.
[2023-03-12 22:15:24] [INFO ] Transformed 1554 transitions.
[2023-03-12 22:15:24] [INFO ] Found NUPN structural information;
[2023-03-12 22:15:24] [INFO ] Parsed PT model containing 1016 places and 1554 transitions and 5858 arcs in 343 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 16 transitions
Reduce redundant transitions removed 16 transitions.
FORMULA ASLink-PT-04a-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 79 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 14) seen :8
FORMULA ASLink-PT-04a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04a-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04a-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04a-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 6) seen :1
FORMULA ASLink-PT-04a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1538 rows 1016 cols
[2023-03-12 22:15:25] [INFO ] Computed 194 place invariants in 52 ms
[2023-03-12 22:15:26] [INFO ] After 643ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 22:15:26] [INFO ] [Nat]Absence check using 46 positive place invariants in 15 ms returned sat
[2023-03-12 22:15:26] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 44 ms returned sat
[2023-03-12 22:15:49] [INFO ] After 22669ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-12 22:15:51] [INFO ] After 24561ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-12 22:15:51] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA ASLink-PT-04a-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 53 ms.
Support contains 74 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 16 places
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 993 transition count 1475
Reduce places removed 63 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 70 rules applied. Total rules applied 156 place count 930 transition count 1468
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 163 place count 923 transition count 1468
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 163 place count 923 transition count 1388
Deduced a syphon composed of 80 places in 4 ms
Ensure Unique test removed 24 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 347 place count 819 transition count 1388
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 349 place count 818 transition count 1387
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 350 place count 817 transition count 1387
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 356 place count 811 transition count 1353
Iterating global reduction 5 with 6 rules applied. Total rules applied 362 place count 811 transition count 1353
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 366 place count 810 transition count 1350
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 368 place count 808 transition count 1350
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 369 place count 807 transition count 1342
Iterating global reduction 7 with 1 rules applied. Total rules applied 370 place count 807 transition count 1342
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 7 with 48 rules applied. Total rules applied 418 place count 783 transition count 1318
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 419 place count 783 transition count 1317
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 420 place count 782 transition count 1317
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 424 place count 782 transition count 1313
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 428 place count 778 transition count 1313
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 434 place count 778 transition count 1313
Applied a total of 434 rules in 412 ms. Remains 778 /1016 variables (removed 238) and now considering 1313/1538 (removed 225) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 414 ms. Remains : 778/1016 places, 1313/1538 transitions.
Incomplete random walk after 10000 steps, including 99 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 144438 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 144438 steps, saw 63300 distinct states, run finished after 3002 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1313 rows 778 cols
[2023-03-12 22:15:55] [INFO ] Computed 145 place invariants in 25 ms
[2023-03-12 22:15:55] [INFO ] After 324ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 22:15:55] [INFO ] [Nat]Absence check using 41 positive place invariants in 17 ms returned sat
[2023-03-12 22:15:55] [INFO ] [Nat]Absence check using 41 positive and 104 generalized place invariants in 120 ms returned sat
[2023-03-12 22:16:08] [INFO ] After 12412ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 22:16:08] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-12 22:16:18] [INFO ] After 9848ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 22:16:19] [INFO ] Deduced a trap composed of 146 places in 532 ms of which 5 ms to minimize.
[2023-03-12 22:16:19] [INFO ] Deduced a trap composed of 149 places in 395 ms of which 1 ms to minimize.
[2023-03-12 22:16:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1073 ms
[2023-03-12 22:16:20] [INFO ] After 12083ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-12 22:16:20] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 149 ms.
Support contains 74 out of 778 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 778/778 places, 1313/1313 transitions.
Applied a total of 0 rules in 24 ms. Remains 778 /778 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 778/778 places, 1313/1313 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 778/778 places, 1313/1313 transitions.
Applied a total of 0 rules in 45 ms. Remains 778 /778 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
[2023-03-12 22:16:20] [INFO ] Invariant cache hit.
[2023-03-12 22:16:21] [INFO ] Implicit Places using invariants in 735 ms returned [1, 19, 20, 21, 24, 35, 53, 71, 112, 138, 149, 162, 176, 178, 180, 198, 254, 271, 302, 317, 318, 319, 320, 338, 356, 394, 419, 434, 446, 459, 464, 465, 466, 484, 502, 565, 588, 593, 605, 607, 608, 609, 642, 644, 647, 665, 666, 667, 668, 693, 699, 711, 717, 723, 735, 741]
Discarding 56 places :
Implicit Place search using SMT only with invariants took 739 ms to find 56 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 722/778 places, 1313/1313 transitions.
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 45 rules applied. Total rules applied 45 place count 722 transition count 1268
Reduce places removed 45 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 54 rules applied. Total rules applied 99 place count 677 transition count 1259
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 108 place count 668 transition count 1259
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 108 place count 668 transition count 1238
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 43 rules applied. Total rules applied 151 place count 646 transition count 1238
Discarding 6 places :
Implicit places reduction removed 6 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 3 with 9 rules applied. Total rules applied 160 place count 640 transition count 1235
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 163 place count 637 transition count 1235
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 169 place count 631 transition count 1229
Iterating global reduction 5 with 6 rules applied. Total rules applied 175 place count 631 transition count 1229
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 179 place count 627 transition count 1225
Iterating global reduction 5 with 4 rules applied. Total rules applied 183 place count 627 transition count 1225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 185 place count 627 transition count 1223
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 6 with 76 rules applied. Total rules applied 261 place count 589 transition count 1185
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 262 place count 589 transition count 1184
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 266 place count 589 transition count 1180
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 271 place count 585 transition count 1179
Free-agglomeration rule (complex) applied 31 times.
Iterating global reduction 7 with 31 rules applied. Total rules applied 302 place count 585 transition count 1148
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 7 with 31 rules applied. Total rules applied 333 place count 554 transition count 1148
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 344 place count 554 transition count 1148
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 346 place count 554 transition count 1148
Applied a total of 346 rules in 204 ms. Remains 554 /722 variables (removed 168) and now considering 1148/1313 (removed 165) transitions.
// Phase 1: matrix 1148 rows 554 cols
[2023-03-12 22:16:21] [INFO ] Computed 82 place invariants in 22 ms
[2023-03-12 22:16:22] [INFO ] Implicit Places using invariants in 342 ms returned [112, 123, 131, 132, 187, 216, 219, 221, 227, 232, 234, 311, 322, 333, 340, 417, 431, 519, 523, 534, 543, 549, 553]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 359 ms to find 23 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 531/778 places, 1148/1313 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 531 transition count 1147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 530 transition count 1147
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 5 place count 527 transition count 1144
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 527 transition count 1144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 525 transition count 1142
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 525 transition count 1141
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 17 place count 525 transition count 1137
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 21 place count 521 transition count 1137
Applied a total of 21 rules in 104 ms. Remains 521 /531 variables (removed 10) and now considering 1137/1148 (removed 11) transitions.
// Phase 1: matrix 1137 rows 521 cols
[2023-03-12 22:16:22] [INFO ] Computed 59 place invariants in 12 ms
[2023-03-12 22:16:22] [INFO ] Implicit Places using invariants in 675 ms returned []
[2023-03-12 22:16:22] [INFO ] Invariant cache hit.
[2023-03-12 22:16:23] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 22:16:24] [INFO ] Implicit Places using invariants and state equation in 1275 ms returned []
Implicit Place search using SMT with State Equation took 1978 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 521/778 places, 1137/1313 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3431 ms. Remains : 521/778 places, 1137/1313 transitions.
Incomplete random walk after 10000 steps, including 120 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 220693 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 220693 steps, saw 76168 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 22:16:27] [INFO ] Invariant cache hit.
[2023-03-12 22:16:27] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 22:16:27] [INFO ] [Nat]Absence check using 18 positive place invariants in 5 ms returned sat
[2023-03-12 22:16:27] [INFO ] [Nat]Absence check using 18 positive and 41 generalized place invariants in 27 ms returned sat
[2023-03-12 22:16:46] [INFO ] After 18708ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 22:16:46] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 22:16:46] [INFO ] After 366ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 22:16:47] [INFO ] After 649ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 277 ms.
[2023-03-12 22:16:47] [INFO ] After 19854ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 85 ms.
Support contains 74 out of 521 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 521/521 places, 1137/1137 transitions.
Applied a total of 0 rules in 16 ms. Remains 521 /521 variables (removed 0) and now considering 1137/1137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 521/521 places, 1137/1137 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 521/521 places, 1137/1137 transitions.
Applied a total of 0 rules in 13 ms. Remains 521 /521 variables (removed 0) and now considering 1137/1137 (removed 0) transitions.
[2023-03-12 22:16:47] [INFO ] Invariant cache hit.
[2023-03-12 22:16:47] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-12 22:16:47] [INFO ] Invariant cache hit.
[2023-03-12 22:16:48] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 22:16:49] [INFO ] Implicit Places using invariants and state equation in 1429 ms returned []
Implicit Place search using SMT with State Equation took 1708 ms to find 0 implicit places.
[2023-03-12 22:16:49] [INFO ] Redundant transitions in 81 ms returned []
[2023-03-12 22:16:49] [INFO ] Invariant cache hit.
[2023-03-12 22:16:49] [INFO ] Dead Transitions using invariants and state equation in 581 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2389 ms. Remains : 521/521 places, 1137/1137 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 521 transition count 1134
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 518 transition count 1134
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 518 transition count 1133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 517 transition count 1133
Applied a total of 8 rules in 62 ms. Remains 517 /521 variables (removed 4) and now considering 1133/1137 (removed 4) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1133 rows 517 cols
[2023-03-12 22:16:49] [INFO ] Computed 59 place invariants in 8 ms
[2023-03-12 22:16:50] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 22:16:50] [INFO ] [Nat]Absence check using 19 positive place invariants in 80 ms returned sat
[2023-03-12 22:16:50] [INFO ] [Nat]Absence check using 19 positive and 40 generalized place invariants in 36 ms returned sat
[2023-03-12 22:17:01] [INFO ] After 10563ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 22:17:10] [INFO ] After 19849ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 171 ms.
[2023-03-12 22:17:10] [INFO ] After 20389ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-12 22:17:10] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 11 ms.
[2023-03-12 22:17:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 521 places, 1137 transitions and 4471 arcs took 17 ms.
[2023-03-12 22:17:10] [INFO ] Flatten gal took : 115 ms
Total runtime 106872 ms.
There are residual formulas that ITS could not solve within timeout
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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ASLink_PT_04a
(NrP: 521 NrTr: 1137 NrArc: 4471)

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

net check time: 0m 0.000sec

init dd package: 0m 2.832sec


before gc: list nodes free: 538764

after gc: idd nodes used:9281, unused:63990719; list nodes free:264197225

before gc: list nodes free: 209085

after gc: idd nodes used:39051, unused:63960949; list nodes free:266160128
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6558804 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16102548 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 ReachabilityCardinality -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.005sec

7296 7858 8365 9252 9670 9964 10724 11067 11028 11706 12130 11696 11938 12736 13185 12879 12235 13206 14513 16847 13719 16744 13368 15893 12654 14865 13603 12764 11872 10952 10059 7808 8320 7619 6472 5022 4006 2417 2348 5715 6933 7607 7693 7496 7597 5345 5263 5735 5824 5527 6087 7162 8166 9660 9279 9696 9389 8113 5137 5140 6129 6396 6501 6343 6171 5809 6086 6541 6948 7054 6840 6687 7145 7235 7169 8246 8420 8533 9476 8163 8045 7924 8419 8662 8823 8750 8606 8728 8295 6445 13526 23407 46164 40454 37759 37337 36625 35222 33135 34083 31227 30437 34896 33096 32060 34120 33530 31339 30201 35530 33508 32877 31158 33053 31182 29805 35164 34339 32096 31594 36740 31806 37451 34452 33429 32482 31437 36438 34608 32365 31664 33022 32430 31749 36257 34459 33171 32169 31625 32105 32272 36065 34921 32716 32389 31481 36419 32022 36744 35224 31266 32437 31537 36765 35477 34969 32429 35943 32832 32208 36816 35304 34551 32543 31596 33334 32411 37290 35532 34742 33032 30452 36506 32578 37492 36704 35158 33746 39444 36614 35330 34307 33439 34861 33889 39436 37799 35115 34109 34094 35890 34080 39408 37375 36337 34635 34398 38846 37569 37155 37818 36260 35408 34539 39449 37633 38236 35196 33954 35427 34845 40357 38416 38190 35678 34677 36268 35199 40676 39720 38188 35957 34983 40493 38948 37010 39657 38426 36478 33478 41048 40046 37319 37201 38900 37150 45218 40952 39939 37849 37100 42696 37659 44460 42278 40205 38478 37888 43120 41450 39931 38442 40992 38782 38972 44087 42721 39949 38767 38663 39806 38977 44625 42983 35820 39423 38572 44519 40291 46016

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="ReachabilityCardinality"
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 ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r010-oct2-167813598500062"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;