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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 5.9K Feb 25 11:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 25 11:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 11:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 11:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 11:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 11:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 11:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Feb 25 11:53 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-b128-ReachabilityFireability-00
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityFireability-01
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityFireability-02
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityFireability-03
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityFireability-04
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityFireability-05
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityFireability-06
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityFireability-07
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityFireability-08
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityFireability-09
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityFireability-10
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityFireability-11
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityFireability-12
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityFireability-13
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityFireability-14
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678616379048

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-b128
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 10:19:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 10:19:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 10:19:40] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2023-03-12 10:19:40] [INFO ] Transformed 306 places.
[2023-03-12 10:19:40] [INFO ] Transformed 840 transitions.
[2023-03-12 10:19:40] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 150 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 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-b128-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10014 steps, including 4 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 13) seen :3
FORMULA FunctionPointer-PT-b128-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b128-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b128-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-12 10:19:41] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2023-03-12 10:19:41] [INFO ] Computed 4 place invariants in 26 ms
[2023-03-12 10:19:41] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 10:19:41] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 10:19:41] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:9
[2023-03-12 10:19:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 10:19:41] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 10:19:42] [INFO ] After 337ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :6
[2023-03-12 10:19:42] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-12 10:19:42] [INFO ] After 233ms SMT Verify possible using 65 Read/Feed constraints in natural domain returned unsat :4 sat :6
[2023-03-12 10:19:42] [INFO ] After 538ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :6
Attempting to minimize the solution found.
Minimization took 227 ms.
[2023-03-12 10:19:43] [INFO ] After 1226ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :6
FORMULA FunctionPointer-PT-b128-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-b128-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-b128-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-b128-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 107 ms.
Support contains 54 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.2 ms
Discarding 10 places :
Also discarding 0 output transitions
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 195 transition count 606
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 195 transition count 606
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 0 with 78 rules applied. Total rules applied 113 place count 195 transition count 528
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 120 place count 188 transition count 514
Iterating global reduction 1 with 7 rules applied. Total rules applied 127 place count 188 transition count 514
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 159 place count 188 transition count 482
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 161 place count 186 transition count 478
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 186 transition count 478
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 179 place count 186 transition count 462
Applied a total of 179 rules in 103 ms. Remains 186 /222 variables (removed 36) and now considering 462/648 (removed 186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 186/222 places, 462/648 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :4
FORMULA FunctionPointer-PT-b128-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b128-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b128-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b128-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 10:19:43] [INFO ] Flow matrix only has 313 transitions (discarded 149 similar events)
// Phase 1: matrix 313 rows 186 cols
[2023-03-12 10:19:43] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-12 10:19:43] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 10:19:43] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 10:19:43] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 10:19:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 10:19:43] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 10:19:43] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 10:19:43] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-12 10:19:43] [INFO ] After 60ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 10:19:43] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-12 10:19:43] [INFO ] After 366ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 24 ms.
Support contains 22 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 462/462 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 173 transition count 426
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 173 transition count 426
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 42 place count 173 transition count 410
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 50 place count 165 transition count 388
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 165 transition count 388
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 63 place count 160 transition count 376
Iterating global reduction 1 with 5 rules applied. Total rules applied 68 place count 160 transition count 376
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 158 transition count 370
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 158 transition count 370
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 156 transition count 366
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 156 transition count 366
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 155 transition count 364
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 155 transition count 364
Applied a total of 78 rules in 40 ms. Remains 155 /186 variables (removed 31) and now considering 364/462 (removed 98) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 155/186 places, 364/462 transitions.
Incomplete random walk after 10007 steps, including 7 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :1
FORMULA FunctionPointer-PT-b128-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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
Running SMT prover for 1 properties.
[2023-03-12 10:19:43] [INFO ] Flow matrix only has 252 transitions (discarded 112 similar events)
// Phase 1: matrix 252 rows 155 cols
[2023-03-12 10:19:43] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-12 10:19:43] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 10:19:43] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 10:19:43] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 10:19:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 10:19:43] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 10:19:43] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 10:19:43] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-12 10:19:44] [INFO ] After 37ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 10:19:44] [INFO ] After 79ms 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 10:19:44] [INFO ] After 236ms 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 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 364/364 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 154 transition count 362
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 154 transition count 362
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 153 transition count 360
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 153 transition count 360
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 152 transition count 356
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 152 transition count 356
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 151 transition count 354
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 151 transition count 354
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 150 transition count 352
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 150 transition count 352
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 149 transition count 350
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 149 transition count 350
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 148 transition count 348
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 148 transition count 348
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 147 transition count 346
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 147 transition count 346
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 146 transition count 344
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 146 transition count 344
Applied a total of 18 rules in 45 ms. Remains 146 /155 variables (removed 9) and now considering 344/364 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 146/155 places, 344/364 transitions.
Incomplete random walk after 10057 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=1436 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1322803 steps, run timeout after 3001 ms. (steps per millisecond=440 ) properties seen :{}
Probabilistic random walk after 1322803 steps, saw 845814 distinct states, run finished after 3002 ms. (steps per millisecond=440 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 10:19:47] [INFO ] Flow matrix only has 238 transitions (discarded 106 similar events)
// Phase 1: matrix 238 rows 146 cols
[2023-03-12 10:19:47] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-12 10:19:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 10:19:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 10:19:47] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 10:19:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 10:19:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 10:19:47] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 10:19:47] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-12 10:19:47] [INFO ] After 30ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 10:19:47] [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 39 ms.
[2023-03-12 10:19:47] [INFO ] After 212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 18 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 344/344 transitions.
Applied a total of 0 rules in 23 ms. Remains 146 /146 variables (removed 0) and now considering 344/344 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 146/146 places, 344/344 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 344/344 transitions.
Applied a total of 0 rules in 8 ms. Remains 146 /146 variables (removed 0) and now considering 344/344 (removed 0) transitions.
[2023-03-12 10:19:47] [INFO ] Flow matrix only has 238 transitions (discarded 106 similar events)
[2023-03-12 10:19:47] [INFO ] Invariant cache hit.
[2023-03-12 10:19:47] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-12 10:19:47] [INFO ] Flow matrix only has 238 transitions (discarded 106 similar events)
[2023-03-12 10:19:47] [INFO ] Invariant cache hit.
[2023-03-12 10:19:47] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-12 10:19:47] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2023-03-12 10:19:47] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-12 10:19:47] [INFO ] Flow matrix only has 238 transitions (discarded 106 similar events)
[2023-03-12 10:19:47] [INFO ] Invariant cache hit.
[2023-03-12 10:19:47] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 428 ms. Remains : 146/146 places, 344/344 transitions.
Graph (trivial) has 190 edges and 146 vertex of which 24 / 146 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 90 transitions
Reduce isomorphic transitions removed 130 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 130 transition count 206
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 122 transition count 204
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21 place count 120 transition count 204
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 21 place count 120 transition count 181
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 67 place count 97 transition count 181
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 74 place count 90 transition count 174
Iterating global reduction 3 with 7 rules applied. Total rules applied 81 place count 90 transition count 174
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 95 place count 90 transition count 160
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 127 place count 74 transition count 144
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 131 place count 70 transition count 136
Iterating global reduction 4 with 4 rules applied. Total rules applied 135 place count 70 transition count 136
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 138 place count 67 transition count 130
Iterating global reduction 4 with 3 rules applied. Total rules applied 141 place count 67 transition count 130
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 144 place count 64 transition count 124
Iterating global reduction 4 with 3 rules applied. Total rules applied 147 place count 64 transition count 124
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 64 transition count 121
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 162 place count 58 transition count 128
Applied a total of 162 rules in 28 ms. Remains 58 /146 variables (removed 88) and now considering 128/344 (removed 216) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 128 rows 58 cols
[2023-03-12 10:19:47] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 10:19:47] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 10:19:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 10:19:48] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 10:19:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 10:19:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 10:19:48] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 10:19:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 10:19:48] [INFO ] After 22ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 10:19:48] [INFO ] After 44ms 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 10:19:48] [INFO ] After 141ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-12 10:19:48] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 31 ms.
[2023-03-12 10:19:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 146 places, 344 transitions and 1390 arcs took 6 ms.
[2023-03-12 10:19:48] [INFO ] Flatten gal took : 54 ms
Total runtime 7885 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: 146 NrTr: 344 NrArc: 1390)

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

net check time: 0m 0.000sec

init dd package: 0m 2.796sec

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

10745

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

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