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-167813598500023.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-01b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813598500023
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 13:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 13:10 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.5K Feb 25 15:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 13:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 13:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 13:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 13:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:28 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 293K 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-01b-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678655338281

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-01b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 21:09:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 21:09:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 21:09:00] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2023-03-12 21:09:00] [INFO ] Transformed 846 places.
[2023-03-12 21:09:00] [INFO ] Transformed 1148 transitions.
[2023-03-12 21:09:00] [INFO ] Found NUPN structural information;
[2023-03-12 21:09:00] [INFO ] Parsed PT model containing 846 places and 1148 transitions and 3624 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 69 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 16) seen :9
FORMULA ASLink-PT-01b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :1
FORMULA ASLink-PT-01b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1148 rows 846 cols
[2023-03-12 21:09:01] [INFO ] Computed 82 place invariants in 58 ms
[2023-03-12 21:09:01] [INFO ] [Real]Absence check using 19 positive place invariants in 55 ms returned sat
[2023-03-12 21:09:01] [INFO ] [Real]Absence check using 19 positive and 63 generalized place invariants in 56 ms returned sat
[2023-03-12 21:09:01] [INFO ] After 605ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 21:09:02] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2023-03-12 21:09:02] [INFO ] [Nat]Absence check using 19 positive and 63 generalized place invariants in 33 ms returned sat
[2023-03-12 21:09:21] [INFO ] After 19352ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-12 21:09:23] [INFO ] Deduced a trap composed of 37 places in 298 ms of which 5 ms to minimize.
[2023-03-12 21:09:23] [INFO ] Deduced a trap composed of 54 places in 176 ms of which 1 ms to minimize.
[2023-03-12 21:09:23] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 1 ms to minimize.
[2023-03-12 21:09:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 722 ms
[2023-03-12 21:09:24] [INFO ] Deduced a trap composed of 44 places in 345 ms of which 27 ms to minimize.
[2023-03-12 21:09:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 440 ms
[2023-03-12 21:09:24] [INFO ] After 22207ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 1128 ms.
[2023-03-12 21:09:25] [INFO ] After 23736ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
FORMULA ASLink-PT-01b-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-01b-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-01b-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 31 ms.
Support contains 59 out of 846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 846/846 places, 1148/1148 transitions.
Drop transitions removed 163 transitions
Trivial Post-agglo rules discarded 163 transitions
Performed 163 trivial Post agglomeration. Transition count delta: 163
Iterating post reduction 0 with 163 rules applied. Total rules applied 163 place count 846 transition count 985
Reduce places removed 163 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 173 rules applied. Total rules applied 336 place count 683 transition count 975
Reduce places removed 3 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 11 rules applied. Total rules applied 347 place count 680 transition count 967
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 355 place count 672 transition count 967
Performed 169 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 169 Pre rules applied. Total rules applied 355 place count 672 transition count 798
Deduced a syphon composed of 169 places in 2 ms
Ensure Unique test removed 11 places
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 4 with 349 rules applied. Total rules applied 704 place count 492 transition count 798
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 4 with 8 rules applied. Total rules applied 712 place count 491 transition count 791
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 8 rules applied. Total rules applied 720 place count 484 transition count 790
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 721 place count 483 transition count 790
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 721 place count 483 transition count 786
Deduced a syphon composed of 4 places in 3 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 11 rules applied. Total rules applied 732 place count 476 transition count 786
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 732 place count 476 transition count 783
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 738 place count 473 transition count 783
Discarding 24 places :
Symmetric choice reduction at 7 with 24 rule applications. Total rules 762 place count 449 transition count 759
Iterating global reduction 7 with 24 rules applied. Total rules applied 786 place count 449 transition count 759
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 787 place count 449 transition count 758
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 9 Pre rules applied. Total rules applied 787 place count 449 transition count 749
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 805 place count 440 transition count 749
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 807 place count 438 transition count 734
Iterating global reduction 8 with 2 rules applied. Total rules applied 809 place count 438 transition count 734
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 809 place count 438 transition count 733
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 811 place count 437 transition count 733
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 812 place count 436 transition count 725
Iterating global reduction 8 with 1 rules applied. Total rules applied 813 place count 436 transition count 725
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 814 place count 435 transition count 717
Iterating global reduction 8 with 1 rules applied. Total rules applied 815 place count 435 transition count 717
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 8 with 74 rules applied. Total rules applied 889 place count 398 transition count 680
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 890 place count 397 transition count 679
Ensure Unique test removed 1 places
Iterating global reduction 8 with 2 rules applied. Total rules applied 892 place count 396 transition count 679
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 893 place count 395 transition count 678
Iterating global reduction 8 with 1 rules applied. Total rules applied 894 place count 395 transition count 678
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 8 with 2 rules applied. Total rules applied 896 place count 395 transition count 676
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 897 place count 394 transition count 676
Free-agglomeration rule applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 900 place count 394 transition count 673
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 903 place count 391 transition count 673
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 904 place count 391 transition count 672
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 905 place count 390 transition count 672
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 906 place count 389 transition count 671
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 907 place count 388 transition count 671
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 907 place count 388 transition count 670
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 909 place count 387 transition count 670
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 13 with 1 rules applied. Total rules applied 910 place count 386 transition count 670
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 14 with 4 rules applied. Total rules applied 914 place count 384 transition count 668
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 915 place count 383 transition count 667
Iterating global reduction 14 with 1 rules applied. Total rules applied 916 place count 383 transition count 667
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 917 place count 383 transition count 666
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 918 place count 382 transition count 666
Applied a total of 918 rules in 321 ms. Remains 382 /846 variables (removed 464) and now considering 666/1148 (removed 482) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 321 ms. Remains : 382/846 places, 666/1148 transitions.
Incomplete random walk after 10000 steps, including 182 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 3) seen :1
FORMULA ASLink-PT-01b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 94 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 666 rows 382 cols
[2023-03-12 21:09:26] [INFO ] Computed 64 place invariants in 16 ms
[2023-03-12 21:09:26] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-12 21:09:26] [INFO ] [Real]Absence check using 15 positive and 49 generalized place invariants in 10 ms returned sat
[2023-03-12 21:09:26] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 21:09:26] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-12 21:09:26] [INFO ] [Nat]Absence check using 15 positive and 49 generalized place invariants in 17 ms returned sat
[2023-03-12 21:09:26] [INFO ] After 397ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-12 21:09:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 21:09:26] [INFO ] After 50ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-12 21:09:27] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 1 ms to minimize.
[2023-03-12 21:09:27] [INFO ] Deduced a trap composed of 114 places in 160 ms of which 1 ms to minimize.
[2023-03-12 21:09:27] [INFO ] Deduced a trap composed of 121 places in 226 ms of which 1 ms to minimize.
[2023-03-12 21:09:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 723 ms
[2023-03-12 21:09:27] [INFO ] After 798ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-12 21:09:27] [INFO ] After 1357ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA ASLink-PT-01b-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 666/666 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 382 transition count 659
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 375 transition count 659
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 14 place count 375 transition count 632
Deduced a syphon composed of 27 places in 2 ms
Ensure Unique test removed 4 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 72 place count 344 transition count 632
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 73 place count 344 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 74 place count 343 transition count 631
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 74 place count 343 transition count 630
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 77 place count 341 transition count 630
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 78 place count 340 transition count 622
Iterating global reduction 4 with 1 rules applied. Total rules applied 79 place count 340 transition count 622
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 80 place count 339 transition count 614
Iterating global reduction 4 with 1 rules applied. Total rules applied 81 place count 339 transition count 614
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 82 place count 338 transition count 606
Iterating global reduction 4 with 1 rules applied. Total rules applied 83 place count 338 transition count 606
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 84 place count 337 transition count 598
Iterating global reduction 4 with 1 rules applied. Total rules applied 85 place count 337 transition count 598
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 86 place count 336 transition count 590
Iterating global reduction 4 with 1 rules applied. Total rules applied 87 place count 336 transition count 590
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 88 place count 335 transition count 582
Iterating global reduction 4 with 1 rules applied. Total rules applied 89 place count 335 transition count 582
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 90 place count 334 transition count 574
Iterating global reduction 4 with 1 rules applied. Total rules applied 91 place count 334 transition count 574
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 92 place count 333 transition count 566
Iterating global reduction 4 with 1 rules applied. Total rules applied 93 place count 333 transition count 566
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 94 place count 332 transition count 558
Iterating global reduction 4 with 1 rules applied. Total rules applied 95 place count 332 transition count 558
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 96 place count 331 transition count 550
Iterating global reduction 4 with 1 rules applied. Total rules applied 97 place count 331 transition count 550
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 98 place count 330 transition count 542
Iterating global reduction 4 with 1 rules applied. Total rules applied 99 place count 330 transition count 542
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 100 place count 329 transition count 534
Iterating global reduction 4 with 1 rules applied. Total rules applied 101 place count 329 transition count 534
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 102 place count 328 transition count 526
Iterating global reduction 4 with 1 rules applied. Total rules applied 103 place count 328 transition count 526
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 104 place count 327 transition count 518
Iterating global reduction 4 with 1 rules applied. Total rules applied 105 place count 327 transition count 518
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 19 rules applied. Total rules applied 124 place count 317 transition count 509
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 124 place count 317 transition count 507
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 129 place count 314 transition count 507
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 130 place count 313 transition count 507
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 130 place count 313 transition count 506
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 132 place count 312 transition count 506
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 136 place count 310 transition count 504
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
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 138 place count 309 transition count 513
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 139 place count 308 transition count 512
Applied a total of 139 rules in 159 ms. Remains 308 /382 variables (removed 74) and now considering 512/666 (removed 154) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 308/382 places, 512/666 transitions.
Finished random walk after 1990 steps, including 37 resets, run visited all 1 properties in 4 ms. (steps per millisecond=497 )
FORMULA ASLink-PT-01b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 27671 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_01b
(NrP: 846 NrTr: 1148 NrArc: 3624)

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

net check time: 0m 0.000sec

init dd package: 0m 2.884sec


before gc: list nodes free: 1313790

after gc: idd nodes used:722206, unused:63277794; list nodes free:265418772

before gc: list nodes free: 393071

after gc: idd nodes used:792374, unused:63207626; list nodes free:267199644

before gc: list nodes free: 1789957

after gc: idd nodes used:1498992, unused:62501008; list nodes free:274739048
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6326736 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16101976 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
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

326497 366173 364689 360253 364985 362829 362861 353805 358173 353729 359673 371541 373037 708044 759410 764418 756802 765410 785412 788054 804340 785522 786998 782122 786430 779478 781174 779030 777990 786870 793658 794262 846822 1195500 1342328 1353457 1351841 1357200 1360342 1422273 1480088 1454926 1498264 1419994

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-01b"
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-01b, 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-167813598500023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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