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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 9.5K Feb 25 12:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 12:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 11:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 11:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:09 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 15K Feb 25 12:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Feb 25 12:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 12:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 12:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 4.2M 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-c128-ReachabilityFireability-00
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-01
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-02
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-03
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-04
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-05
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-06
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-07
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-08
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-09
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-10
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-11
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-12
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-13
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-14
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678638313922

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-c128
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 16:25:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:25:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:25:15] [INFO ] Load time of PNML (sax parser for PT used): 345 ms
[2023-03-12 16:25:15] [INFO ] Transformed 2826 places.
[2023-03-12 16:25:15] [INFO ] Transformed 8960 transitions.
[2023-03-12 16:25:15] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 608 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 28 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c128-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10007 steps, including 2 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 11) seen :1
FORMULA FunctionPointer-PT-c128-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) 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 35 ms. (steps per millisecond=285 ) 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 24 ms. (steps per millisecond=416 ) 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
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 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 91415 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 91415 steps, saw 74622 distinct states, run finished after 3002 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-12 16:25:19] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2023-03-12 16:25:19] [INFO ] Computed 4 place invariants in 80 ms
[2023-03-12 16:25:20] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-12 16:25:20] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 16:25:20] [INFO ] After 739ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:9
[2023-03-12 16:25:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-12 16:25:21] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-12 16:25:23] [INFO ] After 2087ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2023-03-12 16:25:23] [INFO ] State equation strengthened by 479 read => feed constraints.
[2023-03-12 16:25:25] [INFO ] After 1490ms SMT Verify possible using 479 Read/Feed constraints in natural domain returned unsat :2 sat :8
[2023-03-12 16:25:26] [INFO ] After 3054ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 1512 ms.
[2023-03-12 16:25:28] [INFO ] After 7350ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
FORMULA FunctionPointer-PT-c128-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-c128-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 762 ms.
Support contains 56 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1611 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.14 ms
Discarding 17 places :
Also discarding 0 output transitions
Discarding 269 places :
Symmetric choice reduction at 0 with 269 rule applications. Total rules 270 place count 1342 transition count 4038
Iterating global reduction 0 with 269 rules applied. Total rules applied 539 place count 1342 transition count 4038
Ensure Unique test removed 534 transitions
Reduce isomorphic transitions removed 534 transitions.
Iterating post reduction 0 with 534 rules applied. Total rules applied 1073 place count 1342 transition count 3504
Discarding 131 places :
Symmetric choice reduction at 1 with 131 rule applications. Total rules 1204 place count 1211 transition count 3242
Iterating global reduction 1 with 131 rules applied. Total rules applied 1335 place count 1211 transition count 3242
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Iterating post reduction 1 with 132 rules applied. Total rules applied 1467 place count 1211 transition count 3110
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1481 place count 1197 transition count 3082
Iterating global reduction 2 with 14 rules applied. Total rules applied 1495 place count 1197 transition count 3082
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1508 place count 1184 transition count 3056
Iterating global reduction 2 with 13 rules applied. Total rules applied 1521 place count 1184 transition count 3056
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1534 place count 1171 transition count 3030
Iterating global reduction 2 with 13 rules applied. Total rules applied 1547 place count 1171 transition count 3030
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1558 place count 1160 transition count 3008
Iterating global reduction 2 with 11 rules applied. Total rules applied 1569 place count 1160 transition count 3008
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1579 place count 1150 transition count 2988
Iterating global reduction 2 with 10 rules applied. Total rules applied 1589 place count 1150 transition count 2988
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1598 place count 1141 transition count 2970
Iterating global reduction 2 with 9 rules applied. Total rules applied 1607 place count 1141 transition count 2970
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1611 place count 1137 transition count 2962
Iterating global reduction 2 with 4 rules applied. Total rules applied 1615 place count 1137 transition count 2962
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1629 place count 1123 transition count 2908
Iterating global reduction 2 with 14 rules applied. Total rules applied 1643 place count 1123 transition count 2908
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 1658 place count 1108 transition count 2848
Iterating global reduction 2 with 15 rules applied. Total rules applied 1673 place count 1108 transition count 2848
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1687 place count 1094 transition count 2816
Iterating global reduction 2 with 14 rules applied. Total rules applied 1701 place count 1094 transition count 2816
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1715 place count 1080 transition count 2788
Iterating global reduction 2 with 14 rules applied. Total rules applied 1729 place count 1080 transition count 2788
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1743 place count 1066 transition count 2760
Iterating global reduction 2 with 14 rules applied. Total rules applied 1757 place count 1066 transition count 2760
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1771 place count 1052 transition count 2732
Iterating global reduction 2 with 14 rules applied. Total rules applied 1785 place count 1052 transition count 2732
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1799 place count 1038 transition count 2704
Iterating global reduction 2 with 14 rules applied. Total rules applied 1813 place count 1038 transition count 2704
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1815 place count 1036 transition count 2700
Iterating global reduction 2 with 2 rules applied. Total rules applied 1817 place count 1036 transition count 2700
Drop transitions removed 98 transitions
Redundant transition composition rules discarded 98 transitions
Iterating global reduction 2 with 98 rules applied. Total rules applied 1915 place count 1036 transition count 2602
Applied a total of 1915 rules in 1736 ms. Remains 1036 /1628 variables (removed 592) and now considering 2602/5962 (removed 3360) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1738 ms. Remains : 1036/1628 places, 2602/5962 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 8) seen :1
FORMULA FunctionPointer-PT-c128-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :1
FORMULA FunctionPointer-PT-c128-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) 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 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 2 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 16:25:31] [INFO ] Flow matrix only has 1763 transitions (discarded 839 similar events)
// Phase 1: matrix 1763 rows 1036 cols
[2023-03-12 16:25:31] [INFO ] Computed 2 place invariants in 26 ms
[2023-03-12 16:25:31] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2023-03-12 16:25:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 16:25:31] [INFO ] After 287ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 16:25:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 16:25:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 16:25:33] [INFO ] After 1324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 16:25:33] [INFO ] State equation strengthened by 410 read => feed constraints.
[2023-03-12 16:25:34] [INFO ] After 1211ms SMT Verify possible using 410 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 16:25:35] [INFO ] After 2735ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 832 ms.
[2023-03-12 16:25:36] [INFO ] After 5196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 314 ms.
Support contains 41 out of 1036 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1036/1036 places, 2602/2602 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1026 transition count 2572
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1026 transition count 2572
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 36 place count 1026 transition count 2556
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 46 place count 1016 transition count 2534
Iterating global reduction 1 with 10 rules applied. Total rules applied 56 place count 1016 transition count 2534
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 60 place count 1016 transition count 2530
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 64 place count 1012 transition count 2522
Iterating global reduction 2 with 4 rules applied. Total rules applied 68 place count 1012 transition count 2522
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 78 place count 1002 transition count 2486
Iterating global reduction 2 with 10 rules applied. Total rules applied 88 place count 1002 transition count 2486
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 98 place count 992 transition count 2466
Iterating global reduction 2 with 10 rules applied. Total rules applied 108 place count 992 transition count 2466
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 117 place count 983 transition count 2448
Iterating global reduction 2 with 9 rules applied. Total rules applied 126 place count 983 transition count 2448
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 135 place count 974 transition count 2430
Iterating global reduction 2 with 9 rules applied. Total rules applied 144 place count 974 transition count 2430
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 153 place count 965 transition count 2412
Iterating global reduction 2 with 9 rules applied. Total rules applied 162 place count 965 transition count 2412
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 170 place count 957 transition count 2396
Iterating global reduction 2 with 8 rules applied. Total rules applied 178 place count 957 transition count 2396
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 186 place count 949 transition count 2380
Iterating global reduction 2 with 8 rules applied. Total rules applied 194 place count 949 transition count 2380
Applied a total of 194 rules in 475 ms. Remains 949 /1036 variables (removed 87) and now considering 2380/2602 (removed 222) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 475 ms. Remains : 949/1036 places, 2380/2602 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :2
FORMULA FunctionPointer-PT-c128-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-c128-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) 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 4) 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 4) 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 4) seen :0
Running SMT prover for 4 properties.
[2023-03-12 16:25:37] [INFO ] Flow matrix only has 1612 transitions (discarded 768 similar events)
// Phase 1: matrix 1612 rows 949 cols
[2023-03-12 16:25:37] [INFO ] Computed 2 place invariants in 20 ms
[2023-03-12 16:25:37] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 16:25:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 16:25:38] [INFO ] After 978ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 16:25:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 16:25:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-12 16:25:39] [INFO ] After 890ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 16:25:39] [INFO ] State equation strengthened by 380 read => feed constraints.
[2023-03-12 16:25:40] [INFO ] After 719ms SMT Verify possible using 380 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 16:25:41] [INFO ] After 1469ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 522 ms.
[2023-03-12 16:25:41] [INFO ] After 3111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 165 ms.
Support contains 30 out of 949 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 949/949 places, 2380/2380 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 940 transition count 2356
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 940 transition count 2356
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 28 place count 940 transition count 2346
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 38 place count 930 transition count 2326
Iterating global reduction 1 with 10 rules applied. Total rules applied 48 place count 930 transition count 2326
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 56 place count 930 transition count 2318
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 64 place count 922 transition count 2296
Iterating global reduction 2 with 8 rules applied. Total rules applied 72 place count 922 transition count 2296
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 85 place count 909 transition count 2254
Iterating global reduction 2 with 13 rules applied. Total rules applied 98 place count 909 transition count 2254
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 112 place count 895 transition count 2222
Iterating global reduction 2 with 14 rules applied. Total rules applied 126 place count 895 transition count 2222
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 141 place count 880 transition count 2186
Iterating global reduction 2 with 15 rules applied. Total rules applied 156 place count 880 transition count 2186
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 171 place count 865 transition count 2156
Iterating global reduction 2 with 15 rules applied. Total rules applied 186 place count 865 transition count 2156
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 200 place count 851 transition count 2128
Iterating global reduction 2 with 14 rules applied. Total rules applied 214 place count 851 transition count 2128
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 228 place count 837 transition count 2100
Iterating global reduction 2 with 14 rules applied. Total rules applied 242 place count 837 transition count 2100
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 254 place count 825 transition count 2076
Iterating global reduction 2 with 12 rules applied. Total rules applied 266 place count 825 transition count 2076
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 270 place count 821 transition count 2068
Iterating global reduction 2 with 4 rules applied. Total rules applied 274 place count 821 transition count 2068
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 277 place count 818 transition count 2062
Iterating global reduction 2 with 3 rules applied. Total rules applied 280 place count 818 transition count 2062
Applied a total of 280 rules in 414 ms. Remains 818 /949 variables (removed 131) and now considering 2062/2380 (removed 318) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 415 ms. Remains : 818/949 places, 2062/2380 transitions.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) 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 4) 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 4) 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 4) 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 4) seen :0
Interrupted probabilistic random walk after 212541 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 212541 steps, saw 137971 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 16:25:45] [INFO ] Flow matrix only has 1393 transitions (discarded 669 similar events)
// Phase 1: matrix 1393 rows 818 cols
[2023-03-12 16:25:45] [INFO ] Computed 2 place invariants in 16 ms
[2023-03-12 16:25:45] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 16:25:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 16:25:46] [INFO ] After 967ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 16:25:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 16:25:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 16:25:47] [INFO ] After 834ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 16:25:47] [INFO ] State equation strengthened by 335 read => feed constraints.
[2023-03-12 16:25:48] [INFO ] After 577ms SMT Verify possible using 335 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 16:25:48] [INFO ] After 1219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 611 ms.
[2023-03-12 16:25:49] [INFO ] After 2847ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 149 ms.
Support contains 30 out of 818 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 818/818 places, 2062/2062 transitions.
Applied a total of 0 rules in 142 ms. Remains 818 /818 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 818/818 places, 2062/2062 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 818/818 places, 2062/2062 transitions.
Applied a total of 0 rules in 122 ms. Remains 818 /818 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2023-03-12 16:25:49] [INFO ] Flow matrix only has 1393 transitions (discarded 669 similar events)
[2023-03-12 16:25:49] [INFO ] Invariant cache hit.
[2023-03-12 16:25:50] [INFO ] Implicit Places using invariants in 377 ms returned []
[2023-03-12 16:25:50] [INFO ] Flow matrix only has 1393 transitions (discarded 669 similar events)
[2023-03-12 16:25:50] [INFO ] Invariant cache hit.
[2023-03-12 16:25:50] [INFO ] State equation strengthened by 335 read => feed constraints.
[2023-03-12 16:25:53] [INFO ] Implicit Places using invariants and state equation in 3067 ms returned []
Implicit Place search using SMT with State Equation took 3445 ms to find 0 implicit places.
[2023-03-12 16:25:53] [INFO ] Redundant transitions in 117 ms returned []
[2023-03-12 16:25:53] [INFO ] Flow matrix only has 1393 transitions (discarded 669 similar events)
[2023-03-12 16:25:53] [INFO ] Invariant cache hit.
[2023-03-12 16:25:54] [INFO ] Dead Transitions using invariants and state equation in 678 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4377 ms. Remains : 818/818 places, 2062/2062 transitions.
Graph (trivial) has 1207 edges and 818 vertex of which 189 / 818 are part of one of the 63 SCC in 5 ms
Free SCC test removed 126 places
Drop transitions removed 315 transitions
Ensure Unique test removed 543 transitions
Reduce isomorphic transitions removed 858 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 692 transition count 1173
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 661 transition count 1173
Performed 136 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 136 Pre rules applied. Total rules applied 63 place count 661 transition count 1037
Deduced a syphon composed of 136 places in 1 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 272 rules applied. Total rules applied 335 place count 525 transition count 1037
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 397 place count 463 transition count 975
Iterating global reduction 2 with 62 rules applied. Total rules applied 459 place count 463 transition count 975
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 583 place count 463 transition count 851
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 0 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 272 rules applied. Total rules applied 855 place count 327 transition count 715
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 918 place count 264 transition count 589
Iterating global reduction 3 with 63 rules applied. Total rules applied 981 place count 264 transition count 589
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 983 place count 264 transition count 587
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 1045 place count 202 transition count 463
Iterating global reduction 4 with 62 rules applied. Total rules applied 1107 place count 202 transition count 463
Discarding 61 places :
Symmetric choice reduction at 4 with 61 rule applications. Total rules 1168 place count 141 transition count 341
Iterating global reduction 4 with 61 rules applied. Total rules applied 1229 place count 141 transition count 341
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 4 with 58 rules applied. Total rules applied 1287 place count 141 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1289 place count 140 transition count 282
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 1329 place count 120 transition count 284
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 1342 place count 120 transition count 271
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 1345 place count 120 transition count 268
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1348 place count 117 transition count 268
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1349 place count 117 transition count 267
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1350 place count 117 transition count 267
Applied a total of 1350 rules in 116 ms. Remains 117 /818 variables (removed 701) and now considering 267/2062 (removed 1795) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 267 rows 117 cols
[2023-03-12 16:25:54] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-12 16:25:54] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 16:25:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 16:25:54] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 16:25:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 16:25:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 16:25:54] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 16:25:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:25:54] [INFO ] After 91ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 16:25:54] [INFO ] After 204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-12 16:25:54] [INFO ] After 473ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-12 16:25:54] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-12 16:25:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 818 places, 2062 transitions and 8374 arcs took 11 ms.
[2023-03-12 16:25:55] [INFO ] Flatten gal took : 157 ms
Total runtime 39700 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_3
(NrP: 818 NrTr: 2062 NrArc: 8374)

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

net check time: 0m 0.001sec

init dd package: 0m 2.742sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 1032484 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16095028 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.004sec

7614 13899 14130 14130 14130 14130 14140 15192 33540 42480 49432 62570 66164 81840 82137 99283 97641 104997 114858 139361 130633 152236 146080 152818 163552 196882 176870 206633 194386

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

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