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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 5.2K Feb 25 11:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Feb 25 11:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 17K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 12:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Feb 25 12:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 25 12:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 25 12:02 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-c064-ReachabilityFireability-00
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-01
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-02
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-03
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-04
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-05
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-06
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-07
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-08
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-09
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-10
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-11
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-12
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-13
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-14
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678634899157

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-c064
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 15:28:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 15:28:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 15:28:21] [INFO ] Load time of PNML (sax parser for PT used): 321 ms
[2023-03-12 15:28:21] [INFO ] Transformed 2826 places.
[2023-03-12 15:28:21] [INFO ] Transformed 8960 transitions.
[2023-03-12 15:28:21] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 428 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 29 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10034 steps, including 2 resets, run finished after 459 ms. (steps per millisecond=21 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 107421 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 107421 steps, saw 87692 distinct states, run finished after 3002 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 12 properties.
[2023-03-12 15:28:25] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2023-03-12 15:28:25] [INFO ] Computed 4 place invariants in 85 ms
[2023-03-12 15:28:26] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-12 15:28:26] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-12 15:28:26] [INFO ] After 811ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:11
[2023-03-12 15:28:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-12 15:28:26] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 9 ms returned sat
[2023-03-12 15:28:29] [INFO ] After 2326ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :10
[2023-03-12 15:28:29] [INFO ] State equation strengthened by 479 read => feed constraints.
[2023-03-12 15:28:31] [INFO ] After 1799ms SMT Verify possible using 479 Read/Feed constraints in natural domain returned unsat :2 sat :10
[2023-03-12 15:28:33] [INFO ] After 3825ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :10
Attempting to minimize the solution found.
Minimization took 1403 ms.
[2023-03-12 15:28:34] [INFO ] After 8303ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :10
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 571 ms.
Support contains 47 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.26 ms
Discarding 17 places :
Also discarding 0 output transitions
Discarding 284 places :
Symmetric choice reduction at 0 with 284 rule applications. Total rules 285 place count 1327 transition count 3884
Iterating global reduction 0 with 284 rules applied. Total rules applied 569 place count 1327 transition count 3884
Ensure Unique test removed 464 transitions
Reduce isomorphic transitions removed 464 transitions.
Iterating post reduction 0 with 464 rules applied. Total rules applied 1033 place count 1327 transition count 3420
Discarding 144 places :
Symmetric choice reduction at 1 with 144 rule applications. Total rules 1177 place count 1183 transition count 3132
Iterating global reduction 1 with 144 rules applied. Total rules applied 1321 place count 1183 transition count 3132
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Iterating post reduction 1 with 116 rules applied. Total rules applied 1437 place count 1183 transition count 3016
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1451 place count 1169 transition count 2988
Iterating global reduction 2 with 14 rules applied. Total rules applied 1465 place count 1169 transition count 2988
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1478 place count 1156 transition count 2962
Iterating global reduction 2 with 13 rules applied. Total rules applied 1491 place count 1156 transition count 2962
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1504 place count 1143 transition count 2936
Iterating global reduction 2 with 13 rules applied. Total rules applied 1517 place count 1143 transition count 2936
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1530 place count 1130 transition count 2910
Iterating global reduction 2 with 13 rules applied. Total rules applied 1543 place count 1130 transition count 2910
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1556 place count 1117 transition count 2884
Iterating global reduction 2 with 13 rules applied. Total rules applied 1569 place count 1117 transition count 2884
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1579 place count 1107 transition count 2864
Iterating global reduction 2 with 10 rules applied. Total rules applied 1589 place count 1107 transition count 2864
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1598 place count 1098 transition count 2846
Iterating global reduction 2 with 9 rules applied. Total rules applied 1607 place count 1098 transition count 2846
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 1632 place count 1073 transition count 2758
Iterating global reduction 2 with 25 rules applied. Total rules applied 1657 place count 1073 transition count 2758
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 1698 place count 1032 transition count 2594
Iterating global reduction 2 with 41 rules applied. Total rules applied 1739 place count 1032 transition count 2594
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 1780 place count 991 transition count 2466
Iterating global reduction 2 with 41 rules applied. Total rules applied 1821 place count 991 transition count 2466
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 1861 place count 951 transition count 2386
Iterating global reduction 2 with 40 rules applied. Total rules applied 1901 place count 951 transition count 2386
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 1940 place count 912 transition count 2308
Iterating global reduction 2 with 39 rules applied. Total rules applied 1979 place count 912 transition count 2308
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 2018 place count 873 transition count 2230
Iterating global reduction 2 with 39 rules applied. Total rules applied 2057 place count 873 transition count 2230
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 2094 place count 836 transition count 2156
Iterating global reduction 2 with 37 rules applied. Total rules applied 2131 place count 836 transition count 2156
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 2151 place count 816 transition count 2116
Iterating global reduction 2 with 20 rules applied. Total rules applied 2171 place count 816 transition count 2116
Drop transitions removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 2 with 46 rules applied. Total rules applied 2217 place count 816 transition count 2070
Applied a total of 2217 rules in 1770 ms. Remains 816 /1628 variables (removed 812) and now considering 2070/5962 (removed 3892) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1771 ms. Remains : 816/1628 places, 2070/5962 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) 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 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 37 ms. (steps per millisecond=270 ) 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 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 19 ms. (steps per millisecond=526 ) 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 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 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :1
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-12 15:28:37] [INFO ] Flow matrix only has 1404 transitions (discarded 666 similar events)
// Phase 1: matrix 1404 rows 816 cols
[2023-03-12 15:28:37] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-12 15:28:37] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 15:28:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 15:28:38] [INFO ] After 886ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 15:28:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 15:28:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 15:28:39] [INFO ] After 1269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-12 15:28:39] [INFO ] State equation strengthened by 342 read => feed constraints.
[2023-03-12 15:28:40] [INFO ] After 998ms SMT Verify possible using 342 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-12 15:28:42] [INFO ] After 2269ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 778 ms.
[2023-03-12 15:28:42] [INFO ] After 4627ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 138 ms.
Support contains 40 out of 816 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 816/816 places, 2070/2070 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 811 transition count 2056
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 811 transition count 2056
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 14 place count 811 transition count 2052
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 19 place count 806 transition count 2042
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 806 transition count 2042
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 802 transition count 2028
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 802 transition count 2028
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 797 transition count 2014
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 797 transition count 2014
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 792 transition count 2004
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 792 transition count 2004
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 787 transition count 1994
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 787 transition count 1994
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 782 transition count 1984
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 782 transition count 1984
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 777 transition count 1974
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 777 transition count 1974
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 87 place count 772 transition count 1964
Iterating global reduction 1 with 5 rules applied. Total rules applied 92 place count 772 transition count 1964
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 94 place count 770 transition count 1960
Iterating global reduction 1 with 2 rules applied. Total rules applied 96 place count 770 transition count 1960
Applied a total of 96 rules in 310 ms. Remains 770 /816 variables (removed 46) and now considering 1960/2070 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 310 ms. Remains : 770/816 places, 1960/2070 transitions.
Incomplete random walk after 10040 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=130 ) properties (out of 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :1
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) 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 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-12 15:28:43] [INFO ] Flow matrix only has 1329 transitions (discarded 631 similar events)
// Phase 1: matrix 1329 rows 770 cols
[2023-03-12 15:28:43] [INFO ] Computed 2 place invariants in 17 ms
[2023-03-12 15:28:43] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 15:28:43] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 15:28:44] [INFO ] After 858ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 15:28:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 15:28:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 15:28:46] [INFO ] After 1136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-12 15:28:46] [INFO ] State equation strengthened by 327 read => feed constraints.
[2023-03-12 15:28:47] [INFO ] After 1023ms SMT Verify possible using 327 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-12 15:28:48] [INFO ] After 1993ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 842 ms.
[2023-03-12 15:28:48] [INFO ] After 4254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 3 ms.
Support contains 37 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1960/1960 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 768 transition count 1954
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 768 transition count 1954
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 766 transition count 1950
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 766 transition count 1950
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 764 transition count 1942
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 764 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 762 transition count 1938
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 762 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 760 transition count 1934
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 760 transition count 1934
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 758 transition count 1930
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 758 transition count 1930
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 756 transition count 1926
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 756 transition count 1926
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 754 transition count 1922
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 754 transition count 1922
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 752 transition count 1918
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 752 transition count 1918
Applied a total of 36 rules in 261 ms. Remains 752 /770 variables (removed 18) and now considering 1918/1960 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 262 ms. Remains : 752/770 places, 1918/1960 transitions.
Incomplete random walk after 10005 steps, including 3 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 8) seen :1
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :1
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 6 properties.
[2023-03-12 15:28:49] [INFO ] Flow matrix only has 1300 transitions (discarded 618 similar events)
// Phase 1: matrix 1300 rows 752 cols
[2023-03-12 15:28:49] [INFO ] Computed 2 place invariants in 16 ms
[2023-03-12 15:28:49] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 15:28:49] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 15:28:50] [INFO ] After 803ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 15:28:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 15:28:50] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 15:28:51] [INFO ] After 968ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 15:28:51] [INFO ] State equation strengthened by 321 read => feed constraints.
[2023-03-12 15:28:52] [INFO ] After 806ms SMT Verify possible using 321 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 15:28:53] [INFO ] After 1628ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 576 ms.
[2023-03-12 15:28:53] [INFO ] After 3403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 135 ms.
Support contains 35 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1918/1918 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 750 transition count 1914
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 750 transition count 1914
Applied a total of 4 rules in 129 ms. Remains 750 /752 variables (removed 2) and now considering 1914/1918 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 750/752 places, 1914/1918 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 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 12 ms. (steps per millisecond=833 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 198940 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 198940 steps, saw 129144 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-12 15:28:57] [INFO ] Flow matrix only has 1294 transitions (discarded 620 similar events)
// Phase 1: matrix 1294 rows 750 cols
[2023-03-12 15:28:57] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-12 15:28:57] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 15:28:57] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 15:28:57] [INFO ] After 811ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 15:28:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 15:28:58] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 15:28:58] [INFO ] After 873ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 15:28:59] [INFO ] State equation strengthened by 317 read => feed constraints.
[2023-03-12 15:28:59] [INFO ] After 768ms SMT Verify possible using 317 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 15:29:00] [INFO ] After 1567ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 572 ms.
[2023-03-12 15:29:01] [INFO ] After 3245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 121 ms.
Support contains 35 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1914/1914 transitions.
Applied a total of 0 rules in 113 ms. Remains 750 /750 variables (removed 0) and now considering 1914/1914 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 750/750 places, 1914/1914 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1914/1914 transitions.
Applied a total of 0 rules in 117 ms. Remains 750 /750 variables (removed 0) and now considering 1914/1914 (removed 0) transitions.
[2023-03-12 15:29:01] [INFO ] Flow matrix only has 1294 transitions (discarded 620 similar events)
[2023-03-12 15:29:01] [INFO ] Invariant cache hit.
[2023-03-12 15:29:01] [INFO ] Implicit Places using invariants in 348 ms returned []
[2023-03-12 15:29:01] [INFO ] Flow matrix only has 1294 transitions (discarded 620 similar events)
[2023-03-12 15:29:01] [INFO ] Invariant cache hit.
[2023-03-12 15:29:02] [INFO ] State equation strengthened by 317 read => feed constraints.
[2023-03-12 15:29:03] [INFO ] Implicit Places using invariants and state equation in 1864 ms returned []
Implicit Place search using SMT with State Equation took 2215 ms to find 0 implicit places.
[2023-03-12 15:29:03] [INFO ] Redundant transitions in 104 ms returned []
[2023-03-12 15:29:03] [INFO ] Flow matrix only has 1294 transitions (discarded 620 similar events)
[2023-03-12 15:29:03] [INFO ] Invariant cache hit.
[2023-03-12 15:29:04] [INFO ] Dead Transitions using invariants and state equation in 620 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3071 ms. Remains : 750/750 places, 1914/1914 transitions.
Graph (trivial) has 1101 edges and 750 vertex of which 186 / 750 are part of one of the 62 SCC in 13 ms
Free SCC test removed 124 places
Drop transitions removed 310 transitions
Ensure Unique test removed 496 transitions
Reduce isomorphic transitions removed 806 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 626 transition count 1088
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 606 transition count 1087
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 605 transition count 1087
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 115 Pre rules applied. Total rules applied 43 place count 605 transition count 972
Deduced a syphon composed of 115 places in 0 ms
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 230 rules applied. Total rules applied 273 place count 490 transition count 972
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 334 place count 429 transition count 911
Iterating global reduction 3 with 61 rules applied. Total rules applied 395 place count 429 transition count 911
Ensure Unique test removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Iterating post reduction 3 with 122 rules applied. Total rules applied 517 place count 429 transition count 789
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 1 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 4 with 262 rules applied. Total rules applied 779 place count 298 transition count 658
Discarding 60 places :
Symmetric choice reduction at 4 with 60 rule applications. Total rules 839 place count 238 transition count 538
Iterating global reduction 4 with 60 rules applied. Total rules applied 899 place count 238 transition count 538
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 900 place count 238 transition count 537
Discarding 56 places :
Symmetric choice reduction at 5 with 56 rule applications. Total rules 956 place count 182 transition count 425
Iterating global reduction 5 with 56 rules applied. Total rules applied 1012 place count 182 transition count 425
Discarding 56 places :
Symmetric choice reduction at 5 with 56 rule applications. Total rules 1068 place count 126 transition count 313
Iterating global reduction 5 with 56 rules applied. Total rules applied 1124 place count 126 transition count 313
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 5 with 54 rules applied. Total rules applied 1178 place count 126 transition count 259
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 6 with 2 rules applied. Total rules applied 1180 place count 125 transition count 258
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 1208 place count 111 transition count 267
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 6 with 18 rules applied. Total rules applied 1226 place count 111 transition count 249
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 1229 place count 111 transition count 246
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1232 place count 108 transition count 246
Applied a total of 1232 rules in 109 ms. Remains 108 /750 variables (removed 642) and now considering 246/1914 (removed 1668) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 246 rows 108 cols
[2023-03-12 15:29:04] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-12 15:29:04] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 15:29:04] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 15:29:04] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 15:29:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 15:29:04] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 15:29:04] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 15:29:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 15:29:05] [INFO ] After 113ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 15:29:05] [INFO ] After 243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 111 ms.
[2023-03-12 15:29:05] [INFO ] After 571ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-12 15:29:05] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-12 15:29:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 750 places, 1914 transitions and 7782 arcs took 14 ms.
[2023-03-12 15:29:05] [INFO ] Flatten gal took : 154 ms
Total runtime 45048 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: 750 NrTr: 1914 NrArc: 7782)

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

net check time: 0m 0.001sec

init dd package: 0m 2.775sec

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

6830 6830 6914 23894 25049 401152

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

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