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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 5.7K Feb 25 11:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 25 11:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 11:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 11:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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.4K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 11:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K Feb 25 11:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 11:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K Feb 25 11:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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-b008-ReachabilityFireability-00
FORMULA_NAME FunctionPointer-PT-b008-ReachabilityFireability-01
FORMULA_NAME FunctionPointer-PT-b008-ReachabilityFireability-02
FORMULA_NAME FunctionPointer-PT-b008-ReachabilityFireability-03
FORMULA_NAME FunctionPointer-PT-b008-ReachabilityFireability-04
FORMULA_NAME FunctionPointer-PT-b008-ReachabilityFireability-05
FORMULA_NAME FunctionPointer-PT-b008-ReachabilityFireability-06
FORMULA_NAME FunctionPointer-PT-b008-ReachabilityFireability-07
FORMULA_NAME FunctionPointer-PT-b008-ReachabilityFireability-08
FORMULA_NAME FunctionPointer-PT-b008-ReachabilityFireability-09
FORMULA_NAME FunctionPointer-PT-b008-ReachabilityFireability-10
FORMULA_NAME FunctionPointer-PT-b008-ReachabilityFireability-11
FORMULA_NAME FunctionPointer-PT-b008-ReachabilityFireability-12
FORMULA_NAME FunctionPointer-PT-b008-ReachabilityFireability-13
FORMULA_NAME FunctionPointer-PT-b008-ReachabilityFireability-14
FORMULA_NAME FunctionPointer-PT-b008-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678605189951

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b008
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 07:13:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 07:13:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 07:13:11] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2023-03-12 07:13:11] [INFO ] Transformed 306 places.
[2023-03-12 07:13:11] [INFO ] Transformed 840 transitions.
[2023-03-12 07:13:11] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 143 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 84 places in 4 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b008-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10001 steps, including 13 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 12) seen :5
FORMULA FunctionPointer-PT-b008-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b008-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b008-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b008-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b008-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :2
FORMULA FunctionPointer-PT-b008-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b008-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :1
FORMULA FunctionPointer-PT-b008-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-12 07:13:12] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2023-03-12 07:13:12] [INFO ] Computed 4 place invariants in 22 ms
[2023-03-12 07:13:12] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-12 07:13:12] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 07:13:12] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2023-03-12 07:13:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-12 07:13:12] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 07:13:12] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-12 07:13:12] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-12 07:13:12] [INFO ] After 89ms SMT Verify possible using 65 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2023-03-12 07:13:12] [INFO ] After 220ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-12 07:13:12] [INFO ] After 572ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
FORMULA FunctionPointer-PT-b008-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-b008-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 38 ms.
Support contains 19 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 212 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 0 output transitions
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 23 place count 190 transition count 556
Iterating global reduction 0 with 22 rules applied. Total rules applied 45 place count 190 transition count 556
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 105 place count 190 transition count 496
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 116 place count 179 transition count 474
Iterating global reduction 1 with 11 rules applied. Total rules applied 127 place count 179 transition count 474
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 147 place count 179 transition count 454
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 153 place count 173 transition count 442
Iterating global reduction 2 with 6 rules applied. Total rules applied 159 place count 173 transition count 442
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 165 place count 167 transition count 418
Iterating global reduction 2 with 6 rules applied. Total rules applied 171 place count 167 transition count 418
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 176 place count 162 transition count 408
Iterating global reduction 2 with 5 rules applied. Total rules applied 181 place count 162 transition count 408
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 184 place count 159 transition count 396
Iterating global reduction 2 with 3 rules applied. Total rules applied 187 place count 159 transition count 396
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 189 place count 157 transition count 388
Iterating global reduction 2 with 2 rules applied. Total rules applied 191 place count 157 transition count 388
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 193 place count 155 transition count 384
Iterating global reduction 2 with 2 rules applied. Total rules applied 195 place count 155 transition count 384
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 196 place count 154 transition count 382
Iterating global reduction 2 with 1 rules applied. Total rules applied 197 place count 154 transition count 382
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 198 place count 153 transition count 380
Iterating global reduction 2 with 1 rules applied. Total rules applied 199 place count 153 transition count 380
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 200 place count 152 transition count 378
Iterating global reduction 2 with 1 rules applied. Total rules applied 201 place count 152 transition count 378
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 213 place count 152 transition count 366
Applied a total of 213 rules in 133 ms. Remains 152 /222 variables (removed 70) and now considering 366/648 (removed 282) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 152/222 places, 366/648 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :1
FORMULA FunctionPointer-PT-b008-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 07:13:13] [INFO ] Flow matrix only has 252 transitions (discarded 114 similar events)
// Phase 1: matrix 252 rows 152 cols
[2023-03-12 07:13:13] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-12 07:13:13] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 07:13:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 07:13:13] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 07:13:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 07:13:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 07:13:13] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 07:13:13] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-12 07:13:13] [INFO ] After 39ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 07:13:13] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-12 07:13:13] [INFO ] After 254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 18 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 366/366 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 151 transition count 362
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 151 transition count 362
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 150 transition count 360
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 150 transition count 360
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 149 transition count 356
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 149 transition count 356
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 148 transition count 354
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 148 transition count 354
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 147 transition count 352
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 147 transition count 352
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 146 transition count 350
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 146 transition count 350
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 145 transition count 348
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 145 transition count 348
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 144 transition count 346
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 144 transition count 346
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 143 transition count 344
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 143 transition count 344
Applied a total of 18 rules in 78 ms. Remains 143 /152 variables (removed 9) and now considering 344/366 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 143/152 places, 344/366 transitions.
Incomplete random walk after 10001 steps, including 17 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1201638 steps, run timeout after 3001 ms. (steps per millisecond=400 ) properties seen :{}
Probabilistic random walk after 1201638 steps, saw 791360 distinct states, run finished after 3002 ms. (steps per millisecond=400 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 07:13:16] [INFO ] Flow matrix only has 237 transitions (discarded 107 similar events)
// Phase 1: matrix 237 rows 143 cols
[2023-03-12 07:13:16] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-12 07:13:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 07:13:16] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 07:13:16] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 07:13:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 07:13:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 07:13:16] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 07:13:16] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-12 07:13:16] [INFO ] After 40ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 07:13:16] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-12 07:13:17] [INFO ] After 238ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 18 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 344/344 transitions.
Applied a total of 0 rules in 9 ms. Remains 143 /143 variables (removed 0) and now considering 344/344 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 143/143 places, 344/344 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 344/344 transitions.
Applied a total of 0 rules in 8 ms. Remains 143 /143 variables (removed 0) and now considering 344/344 (removed 0) transitions.
[2023-03-12 07:13:17] [INFO ] Flow matrix only has 237 transitions (discarded 107 similar events)
[2023-03-12 07:13:17] [INFO ] Invariant cache hit.
[2023-03-12 07:13:17] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-12 07:13:17] [INFO ] Flow matrix only has 237 transitions (discarded 107 similar events)
[2023-03-12 07:13:17] [INFO ] Invariant cache hit.
[2023-03-12 07:13:17] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-12 07:13:17] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2023-03-12 07:13:17] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-12 07:13:17] [INFO ] Flow matrix only has 237 transitions (discarded 107 similar events)
[2023-03-12 07:13:17] [INFO ] Invariant cache hit.
[2023-03-12 07:13:17] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 403 ms. Remains : 143/143 places, 344/344 transitions.
Graph (trivial) has 178 edges and 143 vertex of which 24 / 143 are part of one of the 8 SCC in 2 ms
Free SCC test removed 16 places
Drop transitions removed 40 transitions
Ensure Unique test removed 91 transitions
Reduce isomorphic transitions removed 131 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 127 transition count 207
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 121 transition count 206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 120 transition count 206
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 15 place count 120 transition count 187
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 53 place count 101 transition count 187
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 60 place count 94 transition count 180
Iterating global reduction 3 with 7 rules applied. Total rules applied 67 place count 94 transition count 180
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 81 place count 94 transition count 166
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 119 place count 75 transition count 147
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 124 place count 70 transition count 137
Iterating global reduction 4 with 5 rules applied. Total rules applied 129 place count 70 transition count 137
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 134 place count 65 transition count 127
Iterating global reduction 4 with 5 rules applied. Total rules applied 139 place count 65 transition count 127
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 143 place count 61 transition count 119
Iterating global reduction 4 with 4 rules applied. Total rules applied 147 place count 61 transition count 119
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 150 place count 61 transition count 116
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 158 place count 57 transition count 122
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 168 place count 57 transition count 112
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 170 place count 57 transition count 110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 172 place count 55 transition count 110
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 173 place count 55 transition count 109
Applied a total of 173 rules in 37 ms. Remains 55 /143 variables (removed 88) and now considering 109/344 (removed 235) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 109 rows 55 cols
[2023-03-12 07:13:17] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 07:13:17] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 07:13:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 07:13:17] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 07:13:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 07:13:17] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 07:13:17] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 07:13:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 07:13:17] [INFO ] After 17ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 07:13:17] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-12 07:13:17] [INFO ] After 122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-12 07:13:17] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-12 07:13:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 143 places, 344 transitions and 1388 arcs took 2 ms.
[2023-03-12 07:13:17] [INFO ] Flatten gal took : 48 ms
Total runtime 6536 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: FuncPointer_2
(NrP: 143 NrTr: 344 NrArc: 1388)

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

net check time: 0m 0.000sec

init dd package: 0m 2.670sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 6231356 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16100568 kB

BK_TIME_CONFINEMENT_REACHED

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

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


initing FirstDep: 0m 0.000sec

239233 1217210

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-b008"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is FunctionPointer-PT-b008, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-tall-167838857600679"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b008.tgz
mv FunctionPointer-PT-b008 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;