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.r458-smll-167912650500615.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 StigmergyElection-PT-05b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650500615
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 888K
-rw-r--r-- 1 mcc users 6.6K Feb 26 16:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 16:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 16:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 16:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 16:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 26 16:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 16:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 16:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 428K Mar 5 18:23 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 StigmergyElection-PT-05b-ReachabilityFireability-00
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-01
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-02
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-03
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-04
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-05
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-06
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-07
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-08
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-09
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-10
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-11
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-12
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-13
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-14
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679560341148

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=StigmergyElection-PT-05b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 08:32:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 08:32:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 08:32:25] [INFO ] Load time of PNML (sax parser for PT used): 196 ms
[2023-03-23 08:32:25] [INFO ] Transformed 699 places.
[2023-03-23 08:32:25] [INFO ] Transformed 1266 transitions.
[2023-03-23 08:32:25] [INFO ] Found NUPN structural information;
[2023-03-23 08:32:25] [INFO ] Parsed PT model containing 699 places and 1266 transitions and 6741 arcs in 306 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 110 resets, run finished after 660 ms. (steps per millisecond=15 ) properties (out of 16) seen :3
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 1266 rows 699 cols
[2023-03-23 08:32:27] [INFO ] Computed 6 place invariants in 44 ms
[2023-03-23 08:32:29] [INFO ] [Real]Absence check using 6 positive place invariants in 29 ms returned sat
[2023-03-23 08:32:30] [INFO ] After 932ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:11
[2023-03-23 08:32:30] [INFO ] After 1384ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:11
Attempting to minimize the solution found.
Minimization took 435 ms.
[2023-03-23 08:32:31] [INFO ] After 2893ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:11
[2023-03-23 08:32:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2023-03-23 08:32:35] [INFO ] After 3144ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :11
[2023-03-23 08:32:37] [INFO ] Deduced a trap composed of 191 places in 526 ms of which 1 ms to minimize.
[2023-03-23 08:32:38] [INFO ] Deduced a trap composed of 191 places in 449 ms of which 1 ms to minimize.
[2023-03-23 08:32:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1357 ms
[2023-03-23 08:32:40] [INFO ] After 8254ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :11
Attempting to minimize the solution found.
Minimization took 2200 ms.
[2023-03-23 08:32:42] [INFO ] After 11228ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :11
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 11 different solutions.
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 233 ms.
Support contains 75 out of 699 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 699/699 places, 1266/1266 transitions.
Graph (trivial) has 531 edges and 699 vertex of which 86 / 699 are part of one of the 12 SCC in 7 ms
Free SCC test removed 74 places
Drop transitions removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Graph (complete) has 1194 edges and 625 vertex of which 621 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.10 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 304 transitions
Trivial Post-agglo rules discarded 304 transitions
Performed 304 trivial Post agglomeration. Transition count delta: 304
Iterating post reduction 0 with 306 rules applied. Total rules applied 308 place count 621 transition count 866
Reduce places removed 304 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 314 rules applied. Total rules applied 622 place count 317 transition count 856
Reduce places removed 5 places and 0 transitions.
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Iterating post reduction 2 with 51 rules applied. Total rules applied 673 place count 312 transition count 810
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 3 with 46 rules applied. Total rules applied 719 place count 266 transition count 810
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 34 Pre rules applied. Total rules applied 719 place count 266 transition count 776
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 787 place count 232 transition count 776
Discarding 52 places :
Symmetric choice reduction at 4 with 52 rule applications. Total rules 839 place count 180 transition count 724
Iterating global reduction 4 with 52 rules applied. Total rules applied 891 place count 180 transition count 724
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 896 place count 180 transition count 719
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 900 place count 176 transition count 715
Iterating global reduction 5 with 4 rules applied. Total rules applied 904 place count 176 transition count 715
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 924 place count 166 transition count 705
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 925 place count 165 transition count 704
Iterating global reduction 5 with 1 rules applied. Total rules applied 926 place count 165 transition count 704
Performed 9 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 944 place count 156 transition count 710
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 949 place count 156 transition count 705
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 951 place count 156 transition count 703
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 953 place count 154 transition count 703
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 957 place count 154 transition count 703
Applied a total of 957 rules in 334 ms. Remains 154 /699 variables (removed 545) and now considering 703/1266 (removed 563) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 335 ms. Remains : 154/699 places, 703/1266 transitions.
Incomplete random walk after 10000 steps, including 458 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 7) seen :1
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 71 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 703 rows 154 cols
[2023-03-23 08:32:43] [INFO ] Computed 6 place invariants in 14 ms
[2023-03-23 08:32:43] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 08:32:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-23 08:32:45] [INFO ] After 1496ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 08:32:46] [INFO ] Deduced a trap composed of 54 places in 232 ms of which 1 ms to minimize.
[2023-03-23 08:32:47] [INFO ] Deduced a trap composed of 51 places in 276 ms of which 0 ms to minimize.
[2023-03-23 08:32:47] [INFO ] Deduced a trap composed of 52 places in 277 ms of which 1 ms to minimize.
[2023-03-23 08:32:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 981 ms
[2023-03-23 08:32:47] [INFO ] After 3739ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1133 ms.
[2023-03-23 08:32:48] [INFO ] After 4975ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 20 ms.
Support contains 59 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 703/703 transitions.
Graph (trivial) has 30 edges and 154 vertex of which 4 / 154 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 152 transition count 693
Reduce places removed 6 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 9 rules applied. Total rules applied 16 place count 146 transition count 690
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 19 place count 143 transition count 690
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 19 place count 143 transition count 689
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 142 transition count 689
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 24 place count 139 transition count 686
Iterating global reduction 3 with 3 rules applied. Total rules applied 27 place count 139 transition count 686
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 29 place count 137 transition count 683
Iterating global reduction 3 with 2 rules applied. Total rules applied 31 place count 137 transition count 683
Performed 6 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 43 place count 131 transition count 675
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 44 place count 130 transition count 674
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 130 transition count 674
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 53 place count 130 transition count 666
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 61 place count 122 transition count 666
Applied a total of 61 rules in 151 ms. Remains 122 /154 variables (removed 32) and now considering 666/703 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 122/154 places, 666/703 transitions.
Incomplete random walk after 10000 steps, including 495 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 79 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 550245 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :{}
Probabilistic random walk after 550245 steps, saw 117886 distinct states, run finished after 3002 ms. (steps per millisecond=183 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 666 rows 122 cols
[2023-03-23 08:32:52] [INFO ] Computed 6 place invariants in 10 ms
[2023-03-23 08:32:52] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 08:32:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-23 08:32:53] [INFO ] After 983ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 08:32:53] [INFO ] State equation strengthened by 114 read => feed constraints.
[2023-03-23 08:32:54] [INFO ] After 667ms SMT Verify possible using 114 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 08:32:54] [INFO ] After 1357ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 478 ms.
[2023-03-23 08:32:55] [INFO ] After 2927ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 6 ms.
Support contains 57 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 666/666 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 122 transition count 665
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 121 transition count 664
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 120 transition count 664
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 119 transition count 663
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 7 place count 118 transition count 661
Iterating global reduction 3 with 1 rules applied. Total rules applied 8 place count 118 transition count 661
Applied a total of 8 rules in 100 ms. Remains 118 /122 variables (removed 4) and now considering 661/666 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 118/122 places, 661/666 transitions.
Incomplete random walk after 10000 steps, including 502 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1111617 steps, run timeout after 3001 ms. (steps per millisecond=370 ) properties seen :{}
Probabilistic random walk after 1111617 steps, saw 227963 distinct states, run finished after 3003 ms. (steps per millisecond=370 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 661 rows 118 cols
[2023-03-23 08:32:58] [INFO ] Computed 6 place invariants in 12 ms
[2023-03-23 08:32:58] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 08:32:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 08:32:59] [INFO ] After 633ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 08:32:59] [INFO ] State equation strengthened by 113 read => feed constraints.
[2023-03-23 08:32:59] [INFO ] After 485ms SMT Verify possible using 113 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 08:33:00] [INFO ] After 918ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 400 ms.
[2023-03-23 08:33:00] [INFO ] After 2024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 24 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 2 ms.
All properties solved without resorting to model-checking.
Total runtime 35874 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: StigmergyElection_PT_05b
(NrP: 699 NrTr: 1266 NrArc: 6741)

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

net check time: 0m 0.001sec

init dd package: 0m 3.429sec


RS generation: 6m25.947sec


-> reachability set: #nodes 79078 (7.9e+04) #states 113,197,703,280 (11)



starting MCC model checker
--------------------------

checking: EF [IS_FIREABLE [t774]]
normalized: E [true U IS_FIREABLE [t774]]

MC time: 3m21.047sec

checking: EF [IS_FIREABLE [t112]]
normalized: E [true U IS_FIREABLE [t112]]


before gc: list nodes free: 1904311

after gc: idd nodes used:159628, unused:63840372; list nodes free:280320120
MC time: 3m 9.035sec

checking: EF [IS_FIREABLE [t960]]
normalized: E [true U IS_FIREABLE [t960]]

MC time: 2m57.000sec

checking: EF [IS_FIREABLE [t744]]
normalized: E [true U IS_FIREABLE [t744]]

MC time: 2m46.000sec

checking: EF [IS_FIREABLE [t277]]
normalized: E [true U IS_FIREABLE [t277]]

MC time: 2m35.006sec

checking: EF [IS_FIREABLE [t645]]
normalized: E [true U IS_FIREABLE [t645]]

MC time: 2m26.000sec

checking: EF [[IS_FIREABLE [t953] & ~ [IS_FIREABLE [t620]]]]
normalized: E [true U [IS_FIREABLE [t953] & ~ [IS_FIREABLE [t620]]]]


before gc: list nodes free: 2525149

after gc: idd nodes used:104657, unused:63895343; list nodes free:280556502
MC time: 2m17.000sec

checking: AG [[~ [IS_FIREABLE [t813]] | IS_FIREABLE [t540]]]
normalized: ~ [E [true U ~ [[IS_FIREABLE [t540] | ~ [IS_FIREABLE [t813]]]]]]

MC time: 2m 8.003sec

checking: EF [[~ [IS_FIREABLE [t915]] & IS_FIREABLE [t1162]]]
normalized: E [true U [~ [IS_FIREABLE [t915]] & IS_FIREABLE [t1162]]]

MC time: 2m 0.000sec

checking: EF [~ [[~ [[IS_FIREABLE [t175] & [[IS_FIREABLE [t986] | IS_FIREABLE [t727]] | IS_FIREABLE [t956]]]] | ~ [IS_FIREABLE [t449]]]]]
normalized: E [true U ~ [[~ [IS_FIREABLE [t449]] | ~ [[[[IS_FIREABLE [t986] | IS_FIREABLE [t727]] | IS_FIREABLE [t956]] & IS_FIREABLE [t175]]]]]]

-> the formula is FALSE

FORMULA StigmergyElection-PT-05b-ReachabilityFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.152sec

checking: AG [[~ [[IS_FIREABLE [t649] & ~ [[[[[[IS_FIREABLE [t182] | IS_FIREABLE [t1083]] | [IS_FIREABLE [t60] | IS_FIREABLE [t424]]] & [[IS_FIREABLE [t890] & IS_FIREABLE [t883]] | [IS_FIREABLE [t851] | IS_FIREABLE [t916]]]] | ~ [[[IS_FIREABLE [t974] & IS_FIREABLE [t1079]] & IS_FIREABLE [t159]]]] & [[[[IS_FIREABLE [t58] & IS_FIREABLE [t736]] | IS_FIREABLE [t995]] & IS_FIREABLE [t340]] & [~ [IS_FIREABLE [t531]] & [~ [IS_FIREABLE [t709]] | ~ [IS_FIREABLE [t1143]]]]]]]]] | IS_FIREABLE [t454]]]
normalized: ~ [E [true U ~ [[IS_FIREABLE [t454] | ~ [[IS_FIREABLE [t649] & ~ [[[[IS_FIREABLE [t340] & [IS_FIREABLE [t995] | [IS_FIREABLE [t58] & IS_FIREABLE [t736]]]] & [~ [IS_FIREABLE [t531]] & [~ [IS_FIREABLE [t709]] | ~ [IS_FIREABLE [t1143]]]]] & [~ [[IS_FIREABLE [t159] & [IS_FIREABLE [t974] & IS_FIREABLE [t1079]]]] | [[[IS_FIREABLE [t182] | IS_FIREABLE [t1083]] | [IS_FIREABLE [t60] | IS_FIREABLE [t424]]] & [[IS_FIREABLE [t890] & IS_FIREABLE [t883]] | [IS_FIREABLE [t851] | IS_FIREABLE [t916]]]]]]]]]]]]]

MC time: 2m 0.000sec

checking: EF [[IS_FIREABLE [t680] & [[[IS_FIREABLE [t338] | ~ [IS_FIREABLE [t589]]] & [[[~ [[~ [IS_FIREABLE [t494]] & ~ [IS_FIREABLE [t895]]]] & [[IS_FIREABLE [t489] | [IS_FIREABLE [t464] | IS_FIREABLE [t752]]] & ~ [IS_FIREABLE [t457]]]] | IS_FIREABLE [t716]] | IS_FIREABLE [t1107]]] & [[[[IS_FIREABLE [t640] | ~ [IS_FIREABLE [t690]]] | ~ [IS_FIREABLE [t620]]] & [IS_FIREABLE [t644] & [[[[IS_FIREABLE [t442] & IS_FIREABLE [t368]] | [IS_FIREABLE [t807] | IS_FIREABLE [t950]]] | [[IS_FIREABLE [t593] | IS_FIREABLE [t550]] & ~ [IS_FIREABLE [t657]]]] & IS_FIREABLE [t720]]]] | IS_FIREABLE [t213]]]]]
normalized: E [true U [IS_FIREABLE [t680] & [[IS_FIREABLE [t213] | [[IS_FIREABLE [t644] & [IS_FIREABLE [t720] & [[~ [IS_FIREABLE [t657]] & [IS_FIREABLE [t593] | IS_FIREABLE [t550]]] | [[IS_FIREABLE [t807] | IS_FIREABLE [t950]] | [IS_FIREABLE [t442] & IS_FIREABLE [t368]]]]]] & [~ [IS_FIREABLE [t620]] | [IS_FIREABLE [t640] | ~ [IS_FIREABLE [t690]]]]]] & [[IS_FIREABLE [t1107] | [IS_FIREABLE [t716] | [[~ [IS_FIREABLE [t457]] & [IS_FIREABLE [t489] | [IS_FIREABLE [t464] | IS_FIREABLE [t752]]]] & ~ [[~ [IS_FIREABLE [t895]] & ~ [IS_FIREABLE [t494]]]]]]] & [IS_FIREABLE [t338] | ~ [IS_FIREABLE [t589]]]]]]]

-> the formula is FALSE

FORMULA StigmergyElection-PT-05b-ReachabilityFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.749sec

checking: AG [[[[IS_FIREABLE [t461] | ~ [[IS_FIREABLE [t340] | [IS_FIREABLE [t890] | [~ [IS_FIREABLE [t153]] | ~ [IS_FIREABLE [t965]]]]]]] & IS_FIREABLE [t1248]] | [[IS_FIREABLE [t583] | [[~ [IS_FIREABLE [t462]] | [[[[IS_FIREABLE [t360] & IS_FIREABLE [t1155]] & ~ [IS_FIREABLE [t43]]] | ~ [[IS_FIREABLE [t68] | IS_FIREABLE [t796]]]] & IS_FIREABLE [t935]]] | [[~ [[IS_FIREABLE [t1148] | IS_FIREABLE [t669]]] & [[~ [IS_FIREABLE [t231]] | IS_FIREABLE [t73]] & [~ [IS_FIREABLE [t1129]] & [IS_FIREABLE [t122] & IS_FIREABLE [t1031]]]]] & ~ [[[~ [IS_FIREABLE [t704]] | ~ [IS_FIREABLE [t721]]] & [[IS_FIREABLE [t1187] & IS_FIREABLE [t978]] | ~ [IS_FIREABLE [t961]]]]]]]] & ~ [IS_FIREABLE [t1258]]]]]
normalized: ~ [E [true U ~ [[[~ [IS_FIREABLE [t1258]] & [IS_FIREABLE [t583] | [[~ [[[~ [IS_FIREABLE [t961]] | [IS_FIREABLE [t1187] & IS_FIREABLE [t978]]] & [~ [IS_FIREABLE [t721]] | ~ [IS_FIREABLE [t704]]]]] & [[[[IS_FIREABLE [t122] & IS_FIREABLE [t1031]] & ~ [IS_FIREABLE [t1129]]] & [IS_FIREABLE [t73] | ~ [IS_FIREABLE [t231]]]] & ~ [[IS_FIREABLE [t1148] | IS_FIREABLE [t669]]]]] | [[IS_FIREABLE [t935] & [~ [[IS_FIREABLE [t68] | IS_FIREABLE [t796]]] | [~ [IS_FIREABLE [t43]] & [IS_FIREABLE [t360] & IS_FIREABLE [t1155]]]]] | ~ [IS_FIREABLE [t462]]]]]] | [IS_FIREABLE [t1248] & [IS_FIREABLE [t461] | ~ [[IS_FIREABLE [t340] | [IS_FIREABLE [t890] | [~ [IS_FIREABLE [t965]] | ~ [IS_FIREABLE [t153]]]]]]]]]]]]


before gc: list nodes free: 2486770

after gc: idd nodes used:206629, unused:63793371; list nodes free:280110074
MC time: 2m 0.078sec

checking: AG [[[IS_FIREABLE [t167] & [[~ [IS_FIREABLE [t73]] & [[[[IS_FIREABLE [t1176] & IS_FIREABLE [t70]] | IS_FIREABLE [t846]] & [[IS_FIREABLE [t589] & ~ [IS_FIREABLE [t1177]]] & [~ [IS_FIREABLE [t417]] | [IS_FIREABLE [t821] | IS_FIREABLE [t422]]]]] & [[~ [IS_FIREABLE [t85]] & [IS_FIREABLE [t1074] & [IS_FIREABLE [t331] | IS_FIREABLE [t198]]]] & [~ [IS_FIREABLE [t128]] & IS_FIREABLE [t936]]]]] & [[~ [[IS_FIREABLE [t4] & IS_FIREABLE [t666]]] & ~ [IS_FIREABLE [t195]]] & [[[[~ [IS_FIREABLE [t356]] | [IS_FIREABLE [t923] | IS_FIREABLE [t407]]] | [~ [IS_FIREABLE [t4]] & [IS_FIREABLE [t1151] | IS_FIREABLE [t386]]]] | [IS_FIREABLE [t861] & ~ [[IS_FIREABLE [t282] & IS_FIREABLE [t903]]]]] | IS_FIREABLE [t205]]]]] | ~ [[~ [[~ [[IS_FIREABLE [t412] & IS_FIREABLE [t318]]] & [IS_FIREABLE [t240] & IS_FIREABLE [t632]]]] & IS_FIREABLE [t678]]]]]
normalized: ~ [E [true U ~ [[~ [[IS_FIREABLE [t678] & ~ [[[IS_FIREABLE [t240] & IS_FIREABLE [t632]] & ~ [[IS_FIREABLE [t412] & IS_FIREABLE [t318]]]]]]] | [IS_FIREABLE [t167] & [[[IS_FIREABLE [t205] | [[IS_FIREABLE [t861] & ~ [[IS_FIREABLE [t282] & IS_FIREABLE [t903]]]] | [[[IS_FIREABLE [t1151] | IS_FIREABLE [t386]] & ~ [IS_FIREABLE [t4]]] | [[IS_FIREABLE [t923] | IS_FIREABLE [t407]] | ~ [IS_FIREABLE [t356]]]]]] & [~ [IS_FIREABLE [t195]] & ~ [[IS_FIREABLE [t4] & IS_FIREABLE [t666]]]]] & [[[[IS_FIREABLE [t936] & ~ [IS_FIREABLE [t128]]] & [[IS_FIREABLE [t1074] & [IS_FIREABLE [t331] | IS_FIREABLE [t198]]] & ~ [IS_FIREABLE [t85]]]] & [[[[IS_FIREABLE [t821] | IS_FIREABLE [t422]] | ~ [IS_FIREABLE [t417]]] & [IS_FIREABLE [t589] & ~ [IS_FIREABLE [t1177]]]] & [IS_FIREABLE [t846] | [IS_FIREABLE [t1176] & IS_FIREABLE [t70]]]]] & ~ [IS_FIREABLE [t73]]]]]]]]]

MC time: 1m51.000sec

checking: AG [[[[~ [[IS_FIREABLE [t649] & [IS_FIREABLE [t1246] | IS_FIREABLE [t1006]]]] & [~ [[IS_FIREABLE [t1024] | [~ [IS_FIREABLE [t633]] | ~ [IS_FIREABLE [t247]]]]] & [[[IS_FIREABLE [t480] | IS_FIREABLE [t815]] & ~ [[IS_FIREABLE [t1021] & IS_FIREABLE [t333]]]] | [[[[IS_FIREABLE [t723] | IS_FIREABLE [t324]] | ~ [IS_FIREABLE [t1212]]] | IS_FIREABLE [t1232]] & IS_FIREABLE [t1088]]]]] | ~ [[IS_FIREABLE [t881] & [[[~ [IS_FIREABLE [t689]] & [IS_FIREABLE [t669] & IS_FIREABLE [t1080]]] & [IS_FIREABLE [t1249] | [IS_FIREABLE [t904] | IS_FIREABLE [t57]]]] & [~ [IS_FIREABLE [t0]] & [[IS_FIREABLE [t479] | IS_FIREABLE [t1206]] & [IS_FIREABLE [t345] & IS_FIREABLE [t642]]]]]]]] & [~ [IS_FIREABLE [t1116]] | [~ [[IS_FIREABLE [t354] | [[[[IS_FIREABLE [t350] & IS_FIREABLE [t894]] & IS_FIREABLE [t466]] & IS_FIREABLE [t871]] | [[~ [IS_FIREABLE [t256]] & ~ [IS_FIREABLE [t610]]] | IS_FIREABLE [t828]]]]] | [IS_FIREABLE [t827] & IS_FIREABLE [t225]]]]]]
normalized: ~ [E [true U ~ [[[[[IS_FIREABLE [t827] & IS_FIREABLE [t225]] | ~ [[IS_FIREABLE [t354] | [[IS_FIREABLE [t828] | [~ [IS_FIREABLE [t610]] & ~ [IS_FIREABLE [t256]]]] | [IS_FIREABLE [t871] & [IS_FIREABLE [t466] & [IS_FIREABLE [t350] & IS_FIREABLE [t894]]]]]]]] | ~ [IS_FIREABLE [t1116]]] & [~ [[IS_FIREABLE [t881] & [[[[IS_FIREABLE [t345] & IS_FIREABLE [t642]] & [IS_FIREABLE [t479] | IS_FIREABLE [t1206]]] & ~ [IS_FIREABLE [t0]]] & [[IS_FIREABLE [t1249] | [IS_FIREABLE [t904] | IS_FIREABLE [t57]]] & [[IS_FIREABLE [t669] & IS_FIREABLE [t1080]] & ~ [IS_FIREABLE [t689]]]]]]] | [[[[IS_FIREABLE [t1088] & [IS_FIREABLE [t1232] | [~ [IS_FIREABLE [t1212]] | [IS_FIREABLE [t723] | IS_FIREABLE [t324]]]]] | [~ [[IS_FIREABLE [t1021] & IS_FIREABLE [t333]]] & [IS_FIREABLE [t480] | IS_FIREABLE [t815]]]] & ~ [[IS_FIREABLE [t1024] | [~ [IS_FIREABLE [t247]] | ~ [IS_FIREABLE [t633]]]]]] & ~ [[IS_FIREABLE [t649] & [IS_FIREABLE [t1246] | IS_FIREABLE [t1006]]]]]]]]]]

MC time: 1m43.000sec

checking: EF [[IS_FIREABLE [t929] | [[[[[[[[IS_FIREABLE [t741] & IS_FIREABLE [t596]] | ~ [IS_FIREABLE [t905]]] | ~ [[IS_FIREABLE [t1132] | IS_FIREABLE [t401]]]] & [[[IS_FIREABLE [t662] & IS_FIREABLE [t963]] & ~ [IS_FIREABLE [t1215]]] | [[IS_FIREABLE [t878] & IS_FIREABLE [t672]] | [IS_FIREABLE [t644] & IS_FIREABLE [t371]]]]] & IS_FIREABLE [t129]] | [[[~ [IS_FIREABLE [t46]] & [[IS_FIREABLE [t347] & IS_FIREABLE [t831]] | [IS_FIREABLE [t37] | IS_FIREABLE [t121]]]] & [[[IS_FIREABLE [t1105] | IS_FIREABLE [t894]] & IS_FIREABLE [t847]] | [[IS_FIREABLE [t118] & IS_FIREABLE [t1144]] & [IS_FIREABLE [t390] | IS_FIREABLE [t661]]]]] | [~ [[~ [IS_FIREABLE [t354]] & [IS_FIREABLE [t950] | IS_FIREABLE [t118]]]] & ~ [[IS_FIREABLE [t714] | IS_FIREABLE [t72]]]]]] & ~ [IS_FIREABLE [t224]]] & [~ [[[[~ [IS_FIREABLE [t22]] | [[IS_FIREABLE [t888] & IS_FIREABLE [t784]] & [IS_FIREABLE [t392] | IS_FIREABLE [t1036]]]] | IS_FIREABLE [t663]] & ~ [IS_FIREABLE [t1228]]]] & IS_FIREABLE [t124]]]]]
normalized: E [true U [IS_FIREABLE [t929] | [[IS_FIREABLE [t124] & ~ [[~ [IS_FIREABLE [t1228]] & [IS_FIREABLE [t663] | [[[IS_FIREABLE [t392] | IS_FIREABLE [t1036]] & [IS_FIREABLE [t888] & IS_FIREABLE [t784]]] | ~ [IS_FIREABLE [t22]]]]]]] & [~ [IS_FIREABLE [t224]] & [[[~ [[IS_FIREABLE [t714] | IS_FIREABLE [t72]]] & ~ [[[IS_FIREABLE [t950] | IS_FIREABLE [t118]] & ~ [IS_FIREABLE [t354]]]]] | [[[[IS_FIREABLE [t390] | IS_FIREABLE [t661]] & [IS_FIREABLE [t118] & IS_FIREABLE [t1144]]] | [IS_FIREABLE [t847] & [IS_FIREABLE [t1105] | IS_FIREABLE [t894]]]] & [[[IS_FIREABLE [t37] | IS_FIREABLE [t121]] | [IS_FIREABLE [t347] & IS_FIREABLE [t831]]] & ~ [IS_FIREABLE [t46]]]]] | [IS_FIREABLE [t129] & [[[[IS_FIREABLE [t644] & IS_FIREABLE [t371]] | [IS_FIREABLE [t878] & IS_FIREABLE [t672]]] | [~ [IS_FIREABLE [t1215]] & [IS_FIREABLE [t662] & IS_FIREABLE [t963]]]] & [~ [[IS_FIREABLE [t1132] | IS_FIREABLE [t401]]] | [~ [IS_FIREABLE [t905]] | [IS_FIREABLE [t741] & IS_FIREABLE [t596]]]]]]]]]]]

MC time: 1m36.002sec

checking: EF [IS_FIREABLE [t774]]
normalized: E [true U IS_FIREABLE [t774]]


before gc: list nodes free: 4627304

after gc: idd nodes used:189230, unused:63810770; list nodes free:280203175
-> the formula is TRUE

FORMULA StigmergyElection-PT-05b-ReachabilityFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6323164 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16100224 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.014sec

51281 116891 63078 64970 65515 69311 69177 72003 65013 74168 69088 78272 74871 74823 70821 74927 78519 79980 75896 75516 71555 73776 72497 77104 79815 78574 77413 71991 82082 79262 80032 80906 82448 86200 88342 86424 85216 90645 85732 85356 86349 95852 85919 90413 84067 88666 91654 89859 87187 88344 87226 87746 92332 92671 95843 94965 96807 93508 96413 91317 80203 87837 92140 90740 90406 95912 92973 93719 96638 90836 97395 96164 100491 91361
iterations count:7418196 (5859), effective:190843 (150)

initing FirstDep: 0m 0.014sec

95489 122464 127355 113027 124256 121707 127427 122261 123158 118559
sat_reach.icc:155: Timeout: after 200 sec

108090 122865 137879 136496 131553 131094 135987 132386 131738 131989
sat_reach.icc:155: Timeout: after 188 sec

87682 110947 134790 140977 142984 142135
sat_reach.icc:155: Timeout: after 176 sec

95375 124763 136895 140534 138708 140201 145037
sat_reach.icc:155: Timeout: after 165 sec

105307 119696 129493 126736 127530 127577 125419 131925
sat_reach.icc:155: Timeout: after 154 sec

91640 117120 123684 124115
sat_reach.icc:155: Timeout: after 145 sec

102677 136173 136373
sat_reach.icc:155: Timeout: after 136 sec

94236 111023 126142 130774 136754 134321 124555
sat_reach.icc:155: Timeout: after 127 sec

99373 142170
sat_reach.icc:155: Timeout: after 119 sec

119672 133431 128403
sat_reach.icc:155: Timeout: after 119 sec

87674
sat_reach.icc:155: Timeout: after 119 sec

110799 137649 139161
sat_reach.icc:155: Timeout: after 110 sec

85364 145624 142665
sat_reach.icc:155: Timeout: after 102 sec

103195 138266
sat_reach.icc:155: Timeout: after 95 sec

95489 122464 127355 113027 124256 121707 127427 122261 123158 118559 130685 130635 126009 128022 130685 126967 131095 127532 117025 128554 127138 125194 126218 124014 120763 126812 154005 171314 159981 166804 173613 171097 174657 161655 171590 177527 159960 176336 175240 174088 174201 179551 182608 179181 177454 177703 174773 169711 181390 181983 180577 185011 186168 172956 176825 170899 176708 180065 171653 175308 176791 169842 182935 181291 175012 178898 171076 166327
iterations count:6825457 (5391), effective:119566 (94)

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="StigmergyElection-PT-05b"
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 StigmergyElection-PT-05b, 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 r458-smll-167912650500615"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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