fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r170-tall-167838857700766
Last Updated
May 14, 2023

About the Execution of Marcie+red for FunctionPointer-PT-c128

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
12091.260 3600000.00 3652302.00 21715.10 ?TTFT?F?T???T?TT normal

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

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-01
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-02
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-03
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-04
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-05
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-06
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-07
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-08
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-09
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-10
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-11
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-12
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-13
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-14
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678638242920

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c128
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 16:24:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 16:24:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:24:04] [INFO ] Load time of PNML (sax parser for PT used): 413 ms
[2023-03-12 16:24:04] [INFO ] Transformed 2826 places.
[2023-03-12 16:24:04] [INFO ] Transformed 8960 transitions.
[2023-03-12 16:24:04] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 522 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 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-c128-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10015 steps, including 2 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 8) seen :1
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-12 16:24:05] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2023-03-12 16:24:05] [INFO ] Computed 4 place invariants in 95 ms
[2023-03-12 16:24:06] [INFO ] After 566ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 16:24:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-12 16:24:07] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 16:24:08] [INFO ] After 1631ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 16:24:08] [INFO ] State equation strengthened by 479 read => feed constraints.
[2023-03-12 16:24:09] [INFO ] After 717ms SMT Verify possible using 479 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-12 16:24:10] [INFO ] After 1964ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 640 ms.
[2023-03-12 16:24:11] [INFO ] After 5131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 2172 ms.
Support contains 53 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 1437 are kept as prefixes of interest. Removing 191 places using SCC suffix rule.12 ms
Discarding 191 places :
Also discarding 0 output transitions
Drop transitions removed 358 transitions
Reduce isomorphic transitions removed 358 transitions.
Iterating post reduction 0 with 358 rules applied. Total rules applied 359 place count 1437 transition count 5604
Discarding 282 places :
Symmetric choice reduction at 1 with 282 rule applications. Total rules 641 place count 1155 transition count 3426
Iterating global reduction 1 with 282 rules applied. Total rules applied 923 place count 1155 transition count 3426
Ensure Unique test removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 1 with 384 rules applied. Total rules applied 1307 place count 1155 transition count 3042
Discarding 147 places :
Symmetric choice reduction at 2 with 147 rule applications. Total rules 1454 place count 1008 transition count 2748
Iterating global reduction 2 with 147 rules applied. Total rules applied 1601 place count 1008 transition count 2748
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 2 with 84 rules applied. Total rules applied 1685 place count 1008 transition count 2664
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1695 place count 998 transition count 2644
Iterating global reduction 3 with 10 rules applied. Total rules applied 1705 place count 998 transition count 2644
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1715 place count 988 transition count 2624
Iterating global reduction 3 with 10 rules applied. Total rules applied 1725 place count 988 transition count 2624
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1734 place count 979 transition count 2606
Iterating global reduction 3 with 9 rules applied. Total rules applied 1743 place count 979 transition count 2606
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1752 place count 970 transition count 2588
Iterating global reduction 3 with 9 rules applied. Total rules applied 1761 place count 970 transition count 2588
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1770 place count 961 transition count 2570
Iterating global reduction 3 with 9 rules applied. Total rules applied 1779 place count 961 transition count 2570
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1787 place count 953 transition count 2554
Iterating global reduction 3 with 8 rules applied. Total rules applied 1795 place count 953 transition count 2554
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1802 place count 946 transition count 2540
Iterating global reduction 3 with 7 rules applied. Total rules applied 1809 place count 946 transition count 2540
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 1829 place count 926 transition count 2470
Iterating global reduction 3 with 20 rules applied. Total rules applied 1849 place count 926 transition count 2470
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 1887 place count 888 transition count 2318
Iterating global reduction 3 with 38 rules applied. Total rules applied 1925 place count 888 transition count 2318
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 1962 place count 851 transition count 2196
Iterating global reduction 3 with 37 rules applied. Total rules applied 1999 place count 851 transition count 2196
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 2034 place count 816 transition count 2126
Iterating global reduction 3 with 35 rules applied. Total rules applied 2069 place count 816 transition count 2126
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 2104 place count 781 transition count 2056
Iterating global reduction 3 with 35 rules applied. Total rules applied 2139 place count 781 transition count 2056
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 2173 place count 747 transition count 1988
Iterating global reduction 3 with 34 rules applied. Total rules applied 2207 place count 747 transition count 1988
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 2239 place count 715 transition count 1924
Iterating global reduction 3 with 32 rules applied. Total rules applied 2271 place count 715 transition count 1924
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 2292 place count 694 transition count 1882
Iterating global reduction 3 with 21 rules applied. Total rules applied 2313 place count 694 transition count 1882
Drop transitions removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 3 with 52 rules applied. Total rules applied 2365 place count 694 transition count 1830
Applied a total of 2365 rules in 1236 ms. Remains 694 /1628 variables (removed 934) and now considering 1830/5962 (removed 4132) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1237 ms. Remains : 694/1628 places, 1830/5962 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 7) 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 7) 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 7) 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 7) 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 7) 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 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 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 188805 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 188805 steps, saw 116808 distinct states, run finished after 3008 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-12 16:24:18] [INFO ] Flow matrix only has 1136 transitions (discarded 694 similar events)
// Phase 1: matrix 1136 rows 694 cols
[2023-03-12 16:24:18] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-12 16:24:18] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 16:24:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 16:24:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 16:24:19] [INFO ] After 523ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 16:24:19] [INFO ] State equation strengthened by 188 read => feed constraints.
[2023-03-12 16:24:19] [INFO ] After 325ms SMT Verify possible using 188 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-12 16:24:19] [INFO ] After 768ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 269 ms.
[2023-03-12 16:24:20] [INFO ] After 1778ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 1663 ms.
Support contains 53 out of 694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 694/694 places, 1830/1830 transitions.
Applied a total of 0 rules in 106 ms. Remains 694 /694 variables (removed 0) and now considering 1830/1830 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 694/694 places, 1830/1830 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 694/694 places, 1830/1830 transitions.
Applied a total of 0 rules in 89 ms. Remains 694 /694 variables (removed 0) and now considering 1830/1830 (removed 0) transitions.
[2023-03-12 16:24:22] [INFO ] Flow matrix only has 1136 transitions (discarded 694 similar events)
[2023-03-12 16:24:22] [INFO ] Invariant cache hit.
[2023-03-12 16:24:22] [INFO ] Implicit Places using invariants in 446 ms returned []
[2023-03-12 16:24:22] [INFO ] Flow matrix only has 1136 transitions (discarded 694 similar events)
[2023-03-12 16:24:22] [INFO ] Invariant cache hit.
[2023-03-12 16:24:22] [INFO ] State equation strengthened by 188 read => feed constraints.
[2023-03-12 16:24:25] [INFO ] Implicit Places using invariants and state equation in 2687 ms returned []
Implicit Place search using SMT with State Equation took 3138 ms to find 0 implicit places.
[2023-03-12 16:24:25] [INFO ] Redundant transitions in 102 ms returned []
[2023-03-12 16:24:25] [INFO ] Flow matrix only has 1136 transitions (discarded 694 similar events)
[2023-03-12 16:24:25] [INFO ] Invariant cache hit.
[2023-03-12 16:24:25] [INFO ] Dead Transitions using invariants and state equation in 570 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3914 ms. Remains : 694/694 places, 1830/1830 transitions.
Ensure Unique test removed 694 transitions
Reduce isomorphic transitions removed 694 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 731 rules applied. Total rules applied 731 place count 694 transition count 1099
Reduce places removed 37 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 39 rules applied. Total rules applied 770 place count 657 transition count 1097
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 772 place count 655 transition count 1097
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 151 Pre rules applied. Total rules applied 772 place count 655 transition count 946
Deduced a syphon composed of 151 places in 1 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 3 with 302 rules applied. Total rules applied 1074 place count 504 transition count 946
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 0 ms
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 3 with 268 rules applied. Total rules applied 1342 place count 370 transition count 812
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 1402 place count 310 transition count 692
Iterating global reduction 3 with 60 rules applied. Total rules applied 1462 place count 310 transition count 692
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1463 place count 310 transition count 691
Discarding 58 places :
Symmetric choice reduction at 4 with 58 rule applications. Total rules 1521 place count 252 transition count 575
Iterating global reduction 4 with 58 rules applied. Total rules applied 1579 place count 252 transition count 575
Discarding 54 places :
Symmetric choice reduction at 4 with 54 rule applications. Total rules 1633 place count 198 transition count 467
Iterating global reduction 4 with 54 rules applied. Total rules applied 1687 place count 198 transition count 467
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 4 with 49 rules applied. Total rules applied 1736 place count 198 transition count 418
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 1738 place count 197 transition count 417
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 1778 place count 177 transition count 439
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 5 with 26 rules applied. Total rules applied 1804 place count 177 transition count 413
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1805 place count 177 transition count 412
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1806 place count 176 transition count 412
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1807 place count 176 transition count 411
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1808 place count 176 transition count 411
Applied a total of 1808 rules in 122 ms. Remains 176 /694 variables (removed 518) and now considering 411/1830 (removed 1419) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 411 rows 176 cols
[2023-03-12 16:24:25] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-12 16:24:26] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 16:24:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 16:24:26] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 16:24:26] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 16:24:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:24:26] [INFO ] After 87ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-12 16:24:26] [INFO ] After 241ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-12 16:24:26] [INFO ] After 560ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2023-03-12 16:24:26] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-12 16:24:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 694 places, 1830 transitions and 7452 arcs took 11 ms.
[2023-03-12 16:24:26] [INFO ] Flatten gal took : 163 ms
Total runtime 22561 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: FuncPointer_3
(NrP: 694 NrTr: 1830 NrArc: 7452)

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

net check time: 0m 0.001sec

init dd package: 0m 2.787sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 4052344 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16094916 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 ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.006sec

7490 12086 12086 12086 12086 13151 27555 36120 49637 52177 67595 78361 88647 104581 109836 104157 112787 154990 129793 138819 173023 204841 164455 204339 215211 253600 199117 246527 216645

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is FunctionPointer-PT-c128, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-tall-167838857700766"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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