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.r170-tall-167838857600662.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 FunctionPointer-PT-b002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857600662
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 7.5K Feb 25 11:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 11:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 11:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 25 11:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 391K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityCardinality-00
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityCardinality-01
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityCardinality-02
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityCardinality-03
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityCardinality-04
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityCardinality-05
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityCardinality-06
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityCardinality-07
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityCardinality-08
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityCardinality-09
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityCardinality-10
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityCardinality-11
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityCardinality-12
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityCardinality-13
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityCardinality-14
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678598037927

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=FunctionPointer-PT-b002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 05:13:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 05:13:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 05:13:59] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2023-03-12 05:13:59] [INFO ] Transformed 306 places.
[2023-03-12 05:13:59] [INFO ] Transformed 840 transitions.
[2023-03-12 05:13:59] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 158 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b002-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 22 resets, run finished after 414 ms. (steps per millisecond=24 ) properties (out of 12) seen :7
FORMULA FunctionPointer-PT-b002-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b002-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b002-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b002-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b002-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b002-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b002-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :1
FORMULA FunctionPointer-PT-b002-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-12 05:14:00] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2023-03-12 05:14:00] [INFO ] Computed 4 place invariants in 20 ms
[2023-03-12 05:14:00] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-12 05:14:00] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 05:14:00] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-12 05:14:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 05:14:00] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 05:14:00] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-12 05:14:00] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-12 05:14:01] [INFO ] After 80ms SMT Verify possible using 65 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2023-03-12 05:14:01] [INFO ] After 187ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-12 05:14:01] [INFO ] After 473ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
FORMULA FunctionPointer-PT-b002-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-b002-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 45 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 648/648 transitions.
Graph (complete) has 932 edges and 222 vertex of which 200 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.5 ms
Discarding 22 places :
Also discarding 0 output transitions
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 200 transition count 623
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 46 place count 180 transition count 509
Iterating global reduction 1 with 20 rules applied. Total rules applied 66 place count 180 transition count 509
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 94 place count 180 transition count 481
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 104 place count 170 transition count 461
Iterating global reduction 2 with 10 rules applied. Total rules applied 114 place count 170 transition count 461
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 126 place count 170 transition count 449
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 129 place count 167 transition count 443
Iterating global reduction 3 with 3 rules applied. Total rules applied 132 place count 167 transition count 443
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 134 place count 165 transition count 435
Iterating global reduction 3 with 2 rules applied. Total rules applied 136 place count 165 transition count 435
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 137 place count 164 transition count 433
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 place count 164 transition count 433
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 154 place count 164 transition count 417
Applied a total of 154 rules in 124 ms. Remains 164 /222 variables (removed 58) and now considering 417/648 (removed 231) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 164/222 places, 417/648 transitions.
Incomplete random walk after 10003 steps, including 3 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :1
FORMULA FunctionPointer-PT-b002-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 05:14:01] [INFO ] Flow matrix only has 276 transitions (discarded 141 similar events)
// Phase 1: matrix 276 rows 164 cols
[2023-03-12 05:14:01] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-12 05:14:01] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 05:14:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 05:14:01] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 05:14:01] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 05:14:01] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-12 05:14:01] [INFO ] After 28ms SMT Verify possible using 51 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 05:14:01] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-12 05:14:01] [INFO ] After 203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 34 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 417/417 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 163 transition count 409
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 163 transition count 409
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 162 transition count 407
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 162 transition count 407
Applied a total of 4 rules in 22 ms. Remains 162 /164 variables (removed 2) and now considering 407/417 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 162/164 places, 407/417 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1275017 steps, run timeout after 3001 ms. (steps per millisecond=424 ) properties seen :{}
Probabilistic random walk after 1275017 steps, saw 793642 distinct states, run finished after 3001 ms. (steps per millisecond=424 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 05:14:04] [INFO ] Flow matrix only has 271 transitions (discarded 136 similar events)
// Phase 1: matrix 271 rows 162 cols
[2023-03-12 05:14:04] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-12 05:14:04] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 05:14:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 05:14:04] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 05:14:05] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 05:14:05] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-12 05:14:05] [INFO ] After 28ms SMT Verify possible using 51 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 05:14:05] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-12 05:14:05] [INFO ] After 209ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 34 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 407/407 transitions.
Applied a total of 0 rules in 13 ms. Remains 162 /162 variables (removed 0) and now considering 407/407 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 162/162 places, 407/407 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 407/407 transitions.
Applied a total of 0 rules in 10 ms. Remains 162 /162 variables (removed 0) and now considering 407/407 (removed 0) transitions.
[2023-03-12 05:14:05] [INFO ] Flow matrix only has 271 transitions (discarded 136 similar events)
[2023-03-12 05:14:05] [INFO ] Invariant cache hit.
[2023-03-12 05:14:05] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-12 05:14:05] [INFO ] Flow matrix only has 271 transitions (discarded 136 similar events)
[2023-03-12 05:14:05] [INFO ] Invariant cache hit.
[2023-03-12 05:14:05] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-12 05:14:05] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2023-03-12 05:14:05] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-12 05:14:05] [INFO ] Flow matrix only has 271 transitions (discarded 136 similar events)
[2023-03-12 05:14:05] [INFO ] Invariant cache hit.
[2023-03-12 05:14:05] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 492 ms. Remains : 162/162 places, 407/407 transitions.
Ensure Unique test removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 147 rules applied. Total rules applied 147 place count 162 transition count 260
Reduce places removed 11 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 15 rules applied. Total rules applied 162 place count 151 transition count 256
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 166 place count 147 transition count 256
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 166 place count 147 transition count 237
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 204 place count 128 transition count 237
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 238 place count 111 transition count 220
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 245 place count 104 transition count 206
Iterating global reduction 3 with 7 rules applied. Total rules applied 252 place count 104 transition count 206
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 259 place count 97 transition count 192
Iterating global reduction 3 with 7 rules applied. Total rules applied 266 place count 97 transition count 192
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 273 place count 90 transition count 178
Iterating global reduction 3 with 7 rules applied. Total rules applied 280 place count 90 transition count 178
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 285 place count 90 transition count 173
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 289 place count 88 transition count 173
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 296 place count 88 transition count 166
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 297 place count 88 transition count 165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 298 place count 87 transition count 165
Applied a total of 298 rules in 35 ms. Remains 87 /162 variables (removed 75) and now considering 165/407 (removed 242) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 165 rows 87 cols
[2023-03-12 05:14:05] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-12 05:14:05] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 05:14:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 05:14:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 05:14:05] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 05:14:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 05:14:05] [INFO ] After 23ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 05:14:05] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-12 05:14:05] [INFO ] After 152ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-12 05:14:05] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-12 05:14:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 162 places, 407 transitions and 1644 arcs took 4 ms.
[2023-03-12 05:14:06] [INFO ] Flatten gal took : 55 ms
Total runtime 6619 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: FuncPointer_2
(NrP: 162 NrTr: 407 NrArc: 1644)

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

net check time: 0m 0.000sec

init dd package: 0m 2.695sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6199836 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16102776 kB

BK_TIME_CONFINEMENT_REACHED

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

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


initing FirstDep: 0m 0.000sec

6157 11801 17493 20547 28554 30549 35689 40448 50951 50531 62291 67702 73344 79034 75378 90099 85380 90520 95320 112494 105362 123849 115222

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="FunctionPointer-PT-b002"
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 FunctionPointer-PT-b002, 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 r170-tall-167838857600662"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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