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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 7.1K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 11:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 11:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 11:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 25 11:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 11:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:09 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-b016-ReachabilityCardinality-00
FORMULA_NAME FunctionPointer-PT-b016-ReachabilityCardinality-01
FORMULA_NAME FunctionPointer-PT-b016-ReachabilityCardinality-02
FORMULA_NAME FunctionPointer-PT-b016-ReachabilityCardinality-03
FORMULA_NAME FunctionPointer-PT-b016-ReachabilityCardinality-04
FORMULA_NAME FunctionPointer-PT-b016-ReachabilityCardinality-05
FORMULA_NAME FunctionPointer-PT-b016-ReachabilityCardinality-06
FORMULA_NAME FunctionPointer-PT-b016-ReachabilityCardinality-07
FORMULA_NAME FunctionPointer-PT-b016-ReachabilityCardinality-08
FORMULA_NAME FunctionPointer-PT-b016-ReachabilityCardinality-09
FORMULA_NAME FunctionPointer-PT-b016-ReachabilityCardinality-10
FORMULA_NAME FunctionPointer-PT-b016-ReachabilityCardinality-11
FORMULA_NAME FunctionPointer-PT-b016-ReachabilityCardinality-12
FORMULA_NAME FunctionPointer-PT-b016-ReachabilityCardinality-13
FORMULA_NAME FunctionPointer-PT-b016-ReachabilityCardinality-14
FORMULA_NAME FunctionPointer-PT-b016-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678605623930

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-b016
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 07:20:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 07:20:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 07:20:25] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2023-03-12 07:20:25] [INFO ] Transformed 306 places.
[2023-03-12 07:20:25] [INFO ] Transformed 840 transitions.
[2023-03-12 07:20:25] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 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-b016-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 8 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 13) seen :4
FORMULA FunctionPointer-PT-b016-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b016-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b016-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b016-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :1
FORMULA FunctionPointer-PT-b016-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-12 07:20:26] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2023-03-12 07:20:26] [INFO ] Computed 4 place invariants in 13 ms
[2023-03-12 07:20:26] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 07:20:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 07:20:26] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 07:20:26] [INFO ] After 298ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2023-03-12 07:20:26] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-12 07:20:27] [INFO ] After 202ms SMT Verify possible using 65 Read/Feed constraints in natural domain returned unsat :1 sat :7
[2023-03-12 07:20:27] [INFO ] After 504ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 342 ms.
[2023-03-12 07:20:27] [INFO ] After 1265ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
FORMULA FunctionPointer-PT-b016-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 121 ms.
Support contains 81 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 214 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 0 output transitions
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 199 transition count 556
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 199 transition count 556
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 67 place count 199 transition count 520
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 72 place count 194 transition count 510
Iterating global reduction 1 with 5 rules applied. Total rules applied 77 place count 194 transition count 510
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 85 place count 194 transition count 502
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 101 place count 194 transition count 486
Applied a total of 101 rules in 91 ms. Remains 194 /222 variables (removed 28) and now considering 486/648 (removed 162) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 194/222 places, 486/648 transitions.
Incomplete random walk after 10002 steps, including 20 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 7) seen :1
FORMULA FunctionPointer-PT-b016-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 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 7 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-12 07:20:28] [INFO ] Flow matrix only has 330 transitions (discarded 156 similar events)
// Phase 1: matrix 330 rows 194 cols
[2023-03-12 07:20:28] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-12 07:20:28] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 07:20:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 07:20:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 07:20:28] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 07:20:28] [INFO ] State equation strengthened by 64 read => feed constraints.
[2023-03-12 07:20:28] [INFO ] After 163ms SMT Verify possible using 64 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 07:20:29] [INFO ] After 376ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 150 ms.
[2023-03-12 07:20:29] [INFO ] After 858ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 111 ms.
Support contains 81 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 486/486 transitions.
Applied a total of 0 rules in 19 ms. Remains 194 /194 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 194/194 places, 486/486 transitions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 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 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 255081 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 255081 steps, saw 167711 distinct states, run finished after 3002 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-12 07:20:32] [INFO ] Flow matrix only has 330 transitions (discarded 156 similar events)
[2023-03-12 07:20:32] [INFO ] Invariant cache hit.
[2023-03-12 07:20:32] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 07:20:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 07:20:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 07:20:33] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 07:20:33] [INFO ] State equation strengthened by 64 read => feed constraints.
[2023-03-12 07:20:33] [INFO ] After 158ms SMT Verify possible using 64 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 07:20:33] [INFO ] After 352ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 141 ms.
[2023-03-12 07:20:33] [INFO ] After 817ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 120 ms.
Support contains 81 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 486/486 transitions.
Applied a total of 0 rules in 16 ms. Remains 194 /194 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 194/194 places, 486/486 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 486/486 transitions.
Applied a total of 0 rules in 19 ms. Remains 194 /194 variables (removed 0) and now considering 486/486 (removed 0) transitions.
[2023-03-12 07:20:33] [INFO ] Flow matrix only has 330 transitions (discarded 156 similar events)
[2023-03-12 07:20:33] [INFO ] Invariant cache hit.
[2023-03-12 07:20:33] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-12 07:20:33] [INFO ] Flow matrix only has 330 transitions (discarded 156 similar events)
[2023-03-12 07:20:33] [INFO ] Invariant cache hit.
[2023-03-12 07:20:33] [INFO ] State equation strengthened by 64 read => feed constraints.
[2023-03-12 07:20:33] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2023-03-12 07:20:34] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-12 07:20:34] [INFO ] Flow matrix only has 330 transitions (discarded 156 similar events)
[2023-03-12 07:20:34] [INFO ] Invariant cache hit.
[2023-03-12 07:20:34] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 545 ms. Remains : 194/194 places, 486/486 transitions.
Graph (trivial) has 109 edges and 194 vertex of which 6 / 194 are part of one of the 2 SCC in 2 ms
Free SCC test removed 4 places
Drop transitions removed 10 transitions
Ensure Unique test removed 152 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 190 transition count 319
Reduce places removed 5 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 9 rules applied. Total rules applied 15 place count 185 transition count 315
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 19 place count 181 transition count 315
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 19 place count 181 transition count 305
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 39 place count 171 transition count 305
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 40 place count 170 transition count 304
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 170 transition count 304
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 43 place count 170 transition count 302
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 65 place count 159 transition count 291
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 66 place count 158 transition count 289
Iterating global reduction 4 with 1 rules applied. Total rules applied 67 place count 158 transition count 289
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 4 with 2 rules applied. Total rules applied 69 place count 157 transition count 289
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 75 place count 157 transition count 283
Free-agglomeration rule applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 83 place count 157 transition count 275
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 91 place count 149 transition count 275
Applied a total of 91 rules in 53 ms. Remains 149 /194 variables (removed 45) and now considering 275/486 (removed 211) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 275 rows 149 cols
[2023-03-12 07:20:34] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-12 07:20:34] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 07:20:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 07:20:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 07:20:34] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 07:20:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 07:20:34] [INFO ] After 130ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 07:20:34] [INFO ] After 285ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 128 ms.
[2023-03-12 07:20:34] [INFO ] After 643ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-12 07:20:34] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2023-03-12 07:20:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 194 places, 486 transitions and 1954 arcs took 3 ms.
[2023-03-12 07:20:35] [INFO ] Flatten gal took : 59 ms
Total runtime 9826 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: 194 NrTr: 486 NrArc: 1954)

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

net check time: 0m 0.000sec

init dd package: 0m 2.755sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8401804 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16104612 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//
++ 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.000sec

623097 788182

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

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