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

About the Execution of Marcie+red for StigmergyElection-PT-05b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6144.048 81898.00 102945.00 5967.90 FTTTFTTTFTFTTTFF 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.r458-smll-167912650500614.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650500614
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1679560291267

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=StigmergyElection-PT-05b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 08:31:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 08:31:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 08:31:36] [INFO ] Load time of PNML (sax parser for PT used): 292 ms
[2023-03-23 08:31:36] [INFO ] Transformed 699 places.
[2023-03-23 08:31:36] [INFO ] Transformed 1266 transitions.
[2023-03-23 08:31:36] [INFO ] Found NUPN structural information;
[2023-03-23 08:31:36] [INFO ] Parsed PT model containing 699 places and 1266 transitions and 6741 arcs in 489 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 41 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 111 resets, run finished after 811 ms. (steps per millisecond=12 ) properties (out of 11) seen :5
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :1
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1266 rows 699 cols
[2023-03-23 08:31:38] [INFO ] Computed 6 place invariants in 48 ms
[2023-03-23 08:31:39] [INFO ] After 698ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 08:31:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 1072 ms returned sat
[2023-03-23 08:31:42] [INFO ] After 1377ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-23 08:31:42] [INFO ] Deduced a trap composed of 162 places in 725 ms of which 11 ms to minimize.
[2023-03-23 08:31:43] [INFO ] Deduced a trap composed of 108 places in 604 ms of which 2 ms to minimize.
[2023-03-23 08:31:44] [INFO ] Deduced a trap composed of 190 places in 598 ms of which 2 ms to minimize.
[2023-03-23 08:31:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2337 ms
[2023-03-23 08:31:45] [INFO ] Deduced a trap composed of 190 places in 552 ms of which 4 ms to minimize.
[2023-03-23 08:31:46] [INFO ] Deduced a trap composed of 189 places in 556 ms of which 1 ms to minimize.
[2023-03-23 08:31:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1519 ms
[2023-03-23 08:31:46] [INFO ] After 6086ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 635 ms.
[2023-03-23 08:31:47] [INFO ] After 8393ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 106 ms.
Support contains 92 out of 699 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 699/699 places, 1266/1266 transitions.
Graph (trivial) has 535 edges and 699 vertex of which 73 / 699 are part of one of the 11 SCC in 22 ms
Free SCC test removed 62 places
Drop transitions removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Graph (complete) has 1208 edges and 637 vertex of which 631 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.10 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 287 transitions
Trivial Post-agglo rules discarded 287 transitions
Performed 287 trivial Post agglomeration. Transition count delta: 287
Iterating post reduction 0 with 289 rules applied. Total rules applied 291 place count 631 transition count 896
Reduce places removed 287 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 290 rules applied. Total rules applied 581 place count 344 transition count 893
Reduce places removed 1 places and 0 transitions.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Iterating post reduction 2 with 60 rules applied. Total rules applied 641 place count 343 transition count 834
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 65 rules applied. Total rules applied 706 place count 284 transition count 828
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 709 place count 281 transition count 828
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 15 Pre rules applied. Total rules applied 709 place count 281 transition count 813
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 739 place count 266 transition count 813
Discarding 32 places :
Symmetric choice reduction at 5 with 32 rule applications. Total rules 771 place count 234 transition count 781
Iterating global reduction 5 with 32 rules applied. Total rules applied 803 place count 234 transition count 781
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 804 place count 234 transition count 780
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 804 place count 234 transition count 779
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 806 place count 233 transition count 779
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 814 place count 225 transition count 403
Iterating global reduction 6 with 8 rules applied. Total rules applied 822 place count 225 transition count 403
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 868 place count 202 transition count 380
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 869 place count 201 transition count 379
Iterating global reduction 6 with 1 rules applied. Total rules applied 870 place count 201 transition count 379
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 872 place count 200 transition count 379
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 877 place count 200 transition count 374
Free-agglomeration rule applied 18 times.
Iterating global reduction 6 with 18 rules applied. Total rules applied 895 place count 200 transition count 356
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 913 place count 182 transition count 356
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 915 place count 182 transition count 354
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 916 place count 182 transition count 354
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 918 place count 182 transition count 354
Applied a total of 918 rules in 396 ms. Remains 182 /699 variables (removed 517) and now considering 354/1266 (removed 912) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 397 ms. Remains : 182/699 places, 354/1266 transitions.
Incomplete random walk after 10000 steps, including 303 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 384821 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :{}
Probabilistic random walk after 384821 steps, saw 80922 distinct states, run finished after 3005 ms. (steps per millisecond=128 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 354 rows 182 cols
[2023-03-23 08:31:51] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-23 08:31:51] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 08:31:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-23 08:31:51] [INFO ] After 316ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 08:31:51] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-23 08:31:52] [INFO ] After 176ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 08:31:52] [INFO ] Deduced a trap composed of 49 places in 322 ms of which 1 ms to minimize.
[2023-03-23 08:31:52] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 2 ms to minimize.
[2023-03-23 08:31:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 527 ms
[2023-03-23 08:31:53] [INFO ] Deduced a trap composed of 54 places in 209 ms of which 2 ms to minimize.
[2023-03-23 08:31:53] [INFO ] Deduced a trap composed of 51 places in 177 ms of which 2 ms to minimize.
[2023-03-23 08:31:53] [INFO ] Deduced a trap composed of 51 places in 166 ms of which 1 ms to minimize.
[2023-03-23 08:31:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 663 ms
[2023-03-23 08:31:53] [INFO ] Deduced a trap composed of 51 places in 179 ms of which 1 ms to minimize.
[2023-03-23 08:31:53] [INFO ] Deduced a trap composed of 48 places in 186 ms of which 1 ms to minimize.
[2023-03-23 08:31:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 462 ms
[2023-03-23 08:31:54] [INFO ] After 2074ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 265 ms.
[2023-03-23 08:31:54] [INFO ] After 2746ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 54 ms.
Support contains 90 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 354/354 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 182 transition count 353
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 181 transition count 353
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 181 transition count 351
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 179 transition count 351
Applied a total of 6 rules in 55 ms. Remains 179 /182 variables (removed 3) and now considering 351/354 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 179/182 places, 351/354 transitions.
Incomplete random walk after 10000 steps, including 306 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 439491 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :{}
Probabilistic random walk after 439491 steps, saw 89449 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 351 rows 179 cols
[2023-03-23 08:31:58] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-23 08:31:58] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 08:31:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-23 08:31:58] [INFO ] After 274ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 08:31:58] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-23 08:31:58] [INFO ] After 270ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 08:31:59] [INFO ] Deduced a trap composed of 46 places in 143 ms of which 1 ms to minimize.
[2023-03-23 08:31:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2023-03-23 08:31:59] [INFO ] Deduced a trap composed of 48 places in 155 ms of which 1 ms to minimize.
[2023-03-23 08:31:59] [INFO ] Deduced a trap composed of 46 places in 137 ms of which 1 ms to minimize.
[2023-03-23 08:31:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 357 ms
[2023-03-23 08:31:59] [INFO ] Deduced a trap composed of 53 places in 125 ms of which 0 ms to minimize.
[2023-03-23 08:31:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2023-03-23 08:31:59] [INFO ] After 1217ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 230 ms.
[2023-03-23 08:32:00] [INFO ] After 1832ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 16 ms.
Support contains 90 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 351/351 transitions.
Applied a total of 0 rules in 11 ms. Remains 179 /179 variables (removed 0) and now considering 351/351 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 179/179 places, 351/351 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 351/351 transitions.
Applied a total of 0 rules in 12 ms. Remains 179 /179 variables (removed 0) and now considering 351/351 (removed 0) transitions.
[2023-03-23 08:32:00] [INFO ] Invariant cache hit.
[2023-03-23 08:32:00] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-23 08:32:00] [INFO ] Invariant cache hit.
[2023-03-23 08:32:00] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-23 08:32:00] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2023-03-23 08:32:00] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-23 08:32:00] [INFO ] Invariant cache hit.
[2023-03-23 08:32:01] [INFO ] Dead Transitions using invariants and state equation in 460 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 973 ms. Remains : 179/179 places, 351/351 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 179 transition count 349
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 177 transition count 349
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 177 transition count 348
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 176 transition count 348
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 174 transition count 346
Applied a total of 10 rules in 33 ms. Remains 174 /179 variables (removed 5) and now considering 346/351 (removed 5) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 346 rows 174 cols
[2023-03-23 08:32:01] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-23 08:32:01] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 08:32:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-23 08:32:01] [INFO ] After 400ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 08:32:01] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 1 ms to minimize.
[2023-03-23 08:32:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-03-23 08:32:02] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 0 ms to minimize.
[2023-03-23 08:32:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-03-23 08:32:02] [INFO ] After 925ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 207 ms.
[2023-03-23 08:32:02] [INFO ] After 1246ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-23 08:32:02] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 9 ms.
[2023-03-23 08:32:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 179 places, 351 transitions and 1971 arcs took 10 ms.
[2023-03-23 08:32:03] [INFO ] Flatten gal took : 146 ms
Total runtime 26830 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: StigmergyElection_PT_05b
(NrP: 179 NrTr: 351 NrArc: 1971)

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

net check time: 0m 0.000sec

init dd package: 0m 3.561sec


RS generation: 0m 4.330sec


-> reachability set: #nodes 12222 (1.2e+04) #states 33,222,961 (7)



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

checking: EF [[p16<=1 & 1<=p16]]
normalized: E [true U [p16<=1 & 1<=p16]]

abstracting: (1<=p16)
states: 492,480 (5)
abstracting: (p16<=1)
states: 33,222,961 (7)
-> the formula is TRUE

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

MC time: 0m12.101sec

checking: AG [[[[p61<=1 & 1<=p61] | [[p168<=1 & 1<=p168] | [p102<=0 & 0<=p102]]] | [[[p98<=1 & 1<=p98] | [[p159<=1 & 1<=p159] & [p162<=0 & 0<=p162]]] | [[[p121<=0 & 0<=p121] & [[p97<=1 & 1<=p97] & [[p28<=0 & 0<=p28] | [[p4<=1 & 1<=p4] | [p134<=1 & 1<=p134]]]]] | [[p43<=1 & 1<=p43] & [[[p72<=0 & 0<=p72] | [p65<=1 & 1<=p65]] & [[p80<=0 & 0<=p80] | [p110<=1 & 1<=p110]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[p97<=1 & 1<=p97] & [[[p134<=1 & 1<=p134] | [p4<=1 & 1<=p4]] | [p28<=0 & 0<=p28]]] & [p121<=0 & 0<=p121]] | [[[[p80<=0 & 0<=p80] | [p110<=1 & 1<=p110]] & [[p65<=1 & 1<=p65] | [p72<=0 & 0<=p72]]] & [p43<=1 & 1<=p43]]] | [[[p162<=0 & 0<=p162] & [p159<=1 & 1<=p159]] | [p98<=1 & 1<=p98]]] | [[[p102<=0 & 0<=p102] | [p168<=1 & 1<=p168]] | [p61<=1 & 1<=p61]]]]]]

abstracting: (1<=p61)
states: 655,776 (5)
abstracting: (p61<=1)
states: 33,222,961 (7)
abstracting: (1<=p168)
states: 279,072 (5)
abstracting: (p168<=1)
states: 33,222,961 (7)
abstracting: (0<=p102)
states: 33,222,961 (7)
abstracting: (p102<=0)
states: 32,837,401 (7)
abstracting: (1<=p98)
states: 588,708 (5)
abstracting: (p98<=1)
states: 33,222,961 (7)
abstracting: (1<=p159)
states: 1,535,872 (6)
abstracting: (p159<=1)
states: 33,222,961 (7)
abstracting: (0<=p162)
states: 33,222,961 (7)
abstracting: (p162<=0)
states: 32,861,201 (7)
abstracting: (1<=p43)
states: 1,704,204 (6)
abstracting: (p43<=1)
states: 33,222,961 (7)
abstracting: (0<=p72)
states: 33,222,961 (7)
abstracting: (p72<=0)
states: 31,698,121 (7)
abstracting: (1<=p65)
states: 655,776 (5)
abstracting: (p65<=1)
states: 33,222,961 (7)
abstracting: (1<=p110)
states: 1,514,336 (6)
abstracting: (p110<=1)
states: 33,222,961 (7)
abstracting: (0<=p80)
states: 33,222,961 (7)
abstracting: (p80<=0)
states: 32,853,601 (7)
abstracting: (0<=p121)
states: 33,222,961 (7)
abstracting: (p121<=0)
states: 31,708,625 (7)
abstracting: (0<=p28)
states: 33,222,961 (7)
abstracting: (p28<=0)
states: 32,749,681 (7)
abstracting: (1<=p4)
states: 498,960 (5)
abstracting: (p4<=1)
states: 33,222,961 (7)
abstracting: (1<=p134)
states: 563,112 (5)
abstracting: (p134<=1)
states: 33,222,961 (7)
abstracting: (1<=p97)
states: 588,708 (5)
abstracting: (p97<=1)
states: 33,222,961 (7)
-> the formula is FALSE

FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.175sec

checking: AG [[[[[p45<=0 & 0<=p45] & [[[p136<=1 & 1<=p136] | [[p132<=0 & 0<=p132] | [p43<=1 & 1<=p43]]] | [[p147<=0 & 0<=p147] | [[p112<=1 & 1<=p112] | [p100<=1 & 1<=p100]]]]] | [[[p54<=0 & 0<=p54] & [[[p37<=0 & 0<=p37] | [[[p138<=0 & 0<=p138] & [p111<=1 & 1<=p111]] | [[p88<=0 & 0<=p88] & [[p91<=0 & 0<=p91] & [p145<=1 & 1<=p145]]]]] & [[p95<=0 & 0<=p95] | [[p56<=0 & 0<=p56] & [p175<=1 & 1<=p175]]]]] | [[p35<=0 & 0<=p35] & [[[p41<=1 & 1<=p41] | [p153<=0 & 0<=p153]] | [[[p157<=0 & 0<=p157] & [p142<=1 & 1<=p142]] | [[[p70<=1 & 1<=p70] & [p17<=1 & 1<=p17]] | [[p18<=0 & 0<=p18] & [[p76<=1 & 1<=p76] | [[p104<=0 & 0<=p104] | [p96<=1 & 1<=p96]]]]]]]]]] | [[[p148<=1 & 1<=p148] & [0<=p164 & p164<=0]] | [[1<=p58 & p58<=1] & [p101<=0 & 0<=p101]]]]]
normalized: ~ [E [true U ~ [[[[[p101<=0 & 0<=p101] & [1<=p58 & p58<=1]] | [[0<=p164 & p164<=0] & [p148<=1 & 1<=p148]]] | [[[[[[[[[[p96<=1 & 1<=p96] | [p104<=0 & 0<=p104]] | [p76<=1 & 1<=p76]] & [p18<=0 & 0<=p18]] | [[p17<=1 & 1<=p17] & [p70<=1 & 1<=p70]]] | [[p142<=1 & 1<=p142] & [p157<=0 & 0<=p157]]] | [[p153<=0 & 0<=p153] | [p41<=1 & 1<=p41]]] & [p35<=0 & 0<=p35]] | [[[[[p175<=1 & 1<=p175] & [p56<=0 & 0<=p56]] | [p95<=0 & 0<=p95]] & [[[[[p145<=1 & 1<=p145] & [p91<=0 & 0<=p91]] & [p88<=0 & 0<=p88]] | [[p111<=1 & 1<=p111] & [p138<=0 & 0<=p138]]] | [p37<=0 & 0<=p37]]] & [p54<=0 & 0<=p54]]] | [[[[[p100<=1 & 1<=p100] | [p112<=1 & 1<=p112]] | [p147<=0 & 0<=p147]] | [[[p43<=1 & 1<=p43] | [p132<=0 & 0<=p132]] | [p136<=1 & 1<=p136]]] & [p45<=0 & 0<=p45]]]]]]]

abstracting: (0<=p45)
states: 33,222,961 (7)
abstracting: (p45<=0)
states: 31,518,757 (7)
abstracting: (1<=p136)
states: 563,112 (5)
abstracting: (p136<=1)
states: 33,222,961 (7)
abstracting: (0<=p132)
states: 33,222,961 (7)
abstracting: (p132<=0)
states: 32,659,849 (7)
abstracting: (1<=p43)
states: 1,704,204 (6)
abstracting: (p43<=1)
states: 33,222,961 (7)
abstracting: (0<=p147)
states: 33,222,961 (7)
abstracting: (p147<=0)
states: 32,779,729 (7)
abstracting: (1<=p112)
states: 466,560 (5)
abstracting: (p112<=1)
states: 33,222,961 (7)
abstracting: (1<=p100)
states: 588,708 (5)
abstracting: (p100<=1)
states: 33,222,961 (7)
abstracting: (0<=p54)
states: 33,222,961 (7)
abstracting: (p54<=0)
states: 31,518,757 (7)
abstracting: (0<=p37)
states: 33,222,961 (7)
abstracting: (p37<=0)
states: 32,751,721 (7)
abstracting: (0<=p138)
states: 33,222,961 (7)
abstracting: (p138<=0)
states: 32,819,041 (7)
abstracting: (1<=p111)
states: 1,514,336 (6)
abstracting: (p111<=1)
states: 33,222,961 (7)
abstracting: (0<=p88)
states: 33,222,961 (7)
abstracting: (p88<=0)
states: 31,698,121 (7)
abstracting: (0<=p91)
states: 33,222,961 (7)
abstracting: (p91<=0)
states: 31,698,121 (7)
abstracting: (1<=p145)
states: 457,232 (5)
abstracting: (p145<=1)
states: 33,222,961 (7)
abstracting: (0<=p95)
states: 33,222,961 (7)
abstracting: (p95<=0)
states: 31,698,121 (7)
abstracting: (0<=p56)
states: 33,222,961 (7)
abstracting: (p56<=0)
states: 31,518,757 (7)
abstracting: (1<=p175)
states: 4,773,834 (6)
abstracting: (p175<=1)
states: 33,222,961 (7)
abstracting: (0<=p35)
states: 33,222,961 (7)
abstracting: (p35<=0)
states: 32,751,721 (7)
abstracting: (1<=p41)
states: 1,704,204 (6)
abstracting: (p41<=1)
states: 33,222,961 (7)
abstracting: (0<=p153)
states: 33,222,961 (7)
abstracting: (p153<=0)
states: 31,687,089 (7)
abstracting: (0<=p157)
states: 33,222,961 (7)
abstracting: (p157<=0)
states: 31,687,089 (7)
abstracting: (1<=p142)
states: 1,535,872 (6)
abstracting: (p142<=1)
states: 33,222,961 (7)
abstracting: (1<=p70)
states: 424,116 (5)
abstracting: (p70<=1)
states: 33,222,961 (7)
abstracting: (1<=p17)
states: 492,480 (5)
abstracting: (p17<=1)
states: 33,222,961 (7)
abstracting: (0<=p18)
states: 33,222,961 (7)
abstracting: (p18<=0)
states: 32,730,481 (7)
abstracting: (1<=p76)
states: 1,524,840 (6)
abstracting: (p76<=1)
states: 33,222,961 (7)
abstracting: (0<=p104)
states: 33,222,961 (7)
abstracting: (p104<=0)
states: 32,837,401 (7)
abstracting: (1<=p96)
states: 588,708 (5)
abstracting: (p96<=1)
states: 33,222,961 (7)
abstracting: (1<=p148)
states: 443,232 (5)
abstracting: (p148<=1)
states: 33,222,961 (7)
abstracting: (p164<=0)
states: 32,943,889 (7)
abstracting: (0<=p164)
states: 33,222,961 (7)
abstracting: (p58<=1)
states: 33,222,961 (7)
abstracting: (1<=p58)
states: 562,020 (5)
abstracting: (0<=p101)
states: 33,222,961 (7)
abstracting: (p101<=0)
states: 32,659,849 (7)
-> the formula is FALSE

FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.354sec

checking: EF [[[[[[[[[[[[[p60<=0 & 0<=p60] & [[p161<=1 & 1<=p161] | [[p30<=1 & 1<=p30] & [[p119<=0 & 0<=p119] | [p173<=1 & 1<=p173]]]]] & [p151<=1 & 1<=p151]] | [p175<=1 & 1<=p175]] | [p46<=1 & 1<=p46]] | [[p32<=0 & 0<=p32] | [p144<=1 & 1<=p144]]] & [[p51<=1 & 1<=p51] | [[p84<=0 & 0<=p84] | [[p74<=1 & 1<=p74] & [p52<=0 & 0<=p52]]]]] & [p2<=1 & 1<=p2]] | [[[[p68<=1 & 1<=p68] | [p82<=1 & 1<=p82]] & [[[p26<=1 & 1<=p26] | [p15<=1 & 1<=p15]] | [[p170<=1 & 1<=p170] | [[p36<=0 & 0<=p36] | [p10<=1 & 1<=p10]]]]] | [[[p155<=0 & 0<=p155] & [[p13<=1 & 1<=p13] & [p12<=0 & 0<=p12]]] & [[p7<=1 & 1<=p7] & [[p79<=0 & 0<=p79] & [p177<=1 & 1<=p177]]]]]] | [[p63<=0 & 0<=p63] | [[p84<=0 & 0<=p84] | [p23<=0 & 0<=p23]]]] & [p127<=1 & 1<=p127]] | [[[p30<=1 & 1<=p30] & [p171<=1 & 1<=p171]] & [[[[p113<=0 & 0<=p113] & [p106<=0 & 0<=p106]] | [[p22<=1 & 1<=p22] & [[p9<=0 & 0<=p9] & [p117<=1 & 1<=p117]]]] & [[[p124<=0 & 0<=p124] & [p5<=1 & 1<=p5]] | [[[p166<=0 & 0<=p166] | [p122<=1 & 1<=p122]] & [[p126<=0 & 0<=p126] | [p48<=1 & 1<=p48]]]]]]]]
normalized: E [true U [[[[[[[[p82<=1 & 1<=p82] | [p68<=1 & 1<=p68]] & [[[[p10<=1 & 1<=p10] | [p36<=0 & 0<=p36]] | [p170<=1 & 1<=p170]] | [[p15<=1 & 1<=p15] | [p26<=1 & 1<=p26]]]] | [[[[p177<=1 & 1<=p177] & [p79<=0 & 0<=p79]] & [p7<=1 & 1<=p7]] & [[[p12<=0 & 0<=p12] & [p13<=1 & 1<=p13]] & [p155<=0 & 0<=p155]]]] | [[p2<=1 & 1<=p2] & [[[[[p52<=0 & 0<=p52] & [p74<=1 & 1<=p74]] | [p84<=0 & 0<=p84]] | [p51<=1 & 1<=p51]] & [[[p144<=1 & 1<=p144] | [p32<=0 & 0<=p32]] | [[p46<=1 & 1<=p46] | [[p175<=1 & 1<=p175] | [[p151<=1 & 1<=p151] & [[[[[p173<=1 & 1<=p173] | [p119<=0 & 0<=p119]] & [p30<=1 & 1<=p30]] | [p161<=1 & 1<=p161]] & [p60<=0 & 0<=p60]]]]]]]]] | [[[p23<=0 & 0<=p23] | [p84<=0 & 0<=p84]] | [p63<=0 & 0<=p63]]] & [p127<=1 & 1<=p127]] | [[[[[[p9<=0 & 0<=p9] & [p117<=1 & 1<=p117]] & [p22<=1 & 1<=p22]] | [[p106<=0 & 0<=p106] & [p113<=0 & 0<=p113]]] & [[[[p48<=1 & 1<=p48] | [p126<=0 & 0<=p126]] & [[p122<=1 & 1<=p122] | [p166<=0 & 0<=p166]]] | [[p5<=1 & 1<=p5] & [p124<=0 & 0<=p124]]]] & [[p171<=1 & 1<=p171] & [p30<=1 & 1<=p30]]]]]

abstracting: (1<=p30)
states: 719,532 (5)
abstracting: (p30<=1)
states: 33,222,961 (7)
abstracting: (1<=p171)
states: 361,760 (5)
abstracting: (p171<=1)
states: 33,222,961 (7)
abstracting: (0<=p124)
states: 33,222,961 (7)
abstracting: (p124<=0)
states: 31,708,625 (7)
abstracting: (1<=p5)
states: 571,312 (5)
abstracting: (p5<=1)
states: 33,222,961 (7)
abstracting: (0<=p166)
states: 33,222,961 (7)
abstracting: (p166<=0)
states: 32,943,889 (7)
abstracting: (1<=p122)
states: 1,514,336 (6)
abstracting: (p122<=1)
states: 33,222,961 (7)
abstracting: (0<=p126)
states: 33,222,961 (7)
abstracting: (p126<=0)
states: 31,708,625 (7)
abstracting: (1<=p48)
states: 492,480 (5)
abstracting: (p48<=1)
states: 33,222,961 (7)
abstracting: (0<=p113)
states: 33,222,961 (7)
abstracting: (p113<=0)
states: 32,756,401 (7)
abstracting: (0<=p106)
states: 33,222,961 (7)
abstracting: (p106<=0)
states: 32,837,401 (7)
abstracting: (1<=p22)
states: 1,722,300 (6)
abstracting: (p22<=1)
states: 33,222,961 (7)
abstracting: (1<=p117)
states: 1,514,336 (6)
abstracting: (p117<=1)
states: 33,222,961 (7)
abstracting: (0<=p9)
states: 33,222,961 (7)
abstracting: (p9<=0)
states: 31,500,661 (7)
abstracting: (1<=p127)
states: 403,104 (5)
abstracting: (p127<=1)
states: 33,222,961 (7)
abstracting: (0<=p63)
states: 33,222,961 (7)
abstracting: (p63<=0)
states: 32,567,185 (7)
abstracting: (0<=p84)
states: 33,222,961 (7)
abstracting: (p84<=0)
states: 32,853,601 (7)
abstracting: (0<=p23)
states: 33,222,961 (7)
abstracting: (p23<=0)
states: 32,749,681 (7)
abstracting: (0<=p60)
states: 33,222,961 (7)
abstracting: (p60<=0)
states: 32,731,129 (7)
abstracting: (1<=p161)
states: 1,535,872 (6)
abstracting: (p161<=1)
states: 33,222,961 (7)
abstracting: (1<=p30)
states: 719,532 (5)
abstracting: (p30<=1)
states: 33,222,961 (7)
abstracting: (0<=p119)
states: 33,222,961 (7)
abstracting: (p119<=0)
states: 31,708,625 (7)
abstracting: (1<=p173)
states: 719,536 (5)
abstracting: (p173<=1)
states: 33,222,961 (7)
abstracting: (1<=p151)
states: 1,535,872 (6)
abstracting: (p151<=1)
states: 33,222,961 (7)
abstracting: (1<=p175)
states: 4,773,834 (6)
abstracting: (p175<=1)
states: 33,222,961 (7)
abstracting: (1<=p46)
states: 492,480 (5)
abstracting: (p46<=1)
states: 33,222,961 (7)
abstracting: (0<=p32)
states: 33,222,961 (7)
abstracting: (p32<=0)
states: 32,503,429 (7)
abstracting: (1<=p144)
states: 1,535,872 (6)
abstracting: (p144<=1)
states: 33,222,961 (7)
abstracting: (1<=p51)
states: 1,704,204 (6)
abstracting: (p51<=1)
states: 33,222,961 (7)
abstracting: (0<=p84)
states: 33,222,961 (7)
abstracting: (p84<=0)
states: 32,853,601 (7)
abstracting: (1<=p74)
states: 1,524,840 (6)
abstracting: (p74<=1)
states: 33,222,961 (7)
abstracting: (0<=p52)
states: 33,222,961 (7)
abstracting: (p52<=0)
states: 31,518,757 (7)
abstracting: (1<=p2)
states: 498,960 (5)
abstracting: (p2<=1)
states: 33,222,961 (7)
abstracting: (0<=p155)
states: 33,222,961 (7)
abstracting: (p155<=0)
states: 31,687,089 (7)
abstracting: (1<=p13)
states: 1,722,300 (6)
abstracting: (p13<=1)
states: 33,222,961 (7)
abstracting: (0<=p12)
states: 33,222,961 (7)
abstracting: (p12<=0)
states: 31,500,661 (7)
abstracting: (1<=p7)
states: 1,722,300 (6)
abstracting: (p7<=1)
states: 33,222,961 (7)
abstracting: (0<=p79)
states: 33,222,961 (7)
abstracting: (p79<=0)
states: 32,853,601 (7)
abstracting: (1<=p177)
states: 9,483,042 (6)
abstracting: (p177<=1)
states: 33,222,961 (7)
abstracting: (1<=p26)
states: 473,280 (5)
abstracting: (p26<=1)
states: 33,222,961 (7)
abstracting: (1<=p15)
states: 1,722,300 (6)
abstracting: (p15<=1)
states: 33,222,961 (7)
abstracting: (1<=p170)
states: 361,760 (5)
abstracting: (p170<=1)
states: 33,222,961 (7)
abstracting: (0<=p36)
states: 33,222,961 (7)
abstracting: (p36<=0)
states: 32,751,721 (7)
abstracting: (1<=p10)
states: 1,722,300 (6)
abstracting: (p10<=1)
states: 33,222,961 (7)
abstracting: (1<=p68)
states: 424,116 (5)
abstracting: (p68<=1)
states: 33,222,961 (7)
abstracting: (1<=p82)
states: 369,360 (5)
abstracting: (p82<=1)
states: 33,222,961 (7)
-> the formula is TRUE

FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.402sec

totally nodes used: 9687943 (9.7e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 33713422 68238937 101952359
used/not used/entry size/cache size: 45560758 21548106 16 1024MB
basic ops cache: hits/miss/sum: 6010303 10164702 16175005
used/not used/entry size/cache size: 11206963 5570253 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 63972 170009 233981
used/not used/entry size/cache size: 168693 8219915 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 58780330
1 7178285
2 969700
3 155367
4 22114
5 2744
6 293
7 26
8 4
9 1
>= 10 0

Total processing time: 0m42.788sec


BK_STOP 1679560373165

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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.007sec

12485
iterations count:118643 (338), effective:3468 (9)

initing FirstDep: 0m 0.003sec

23985
iterations count:193821 (552), effective:4626 (13)
21916
iterations count:189875 (540), effective:4572 (13)
26797 26578
iterations count:206293 (587), effective:4998 (14)
23546 22837
iterations count:202000 (575), effective:4941 (14)

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="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 StigmergyElection-PT-05b, 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 r458-smll-167912650500614"
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 [ "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 ;