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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7204.075 3600000.00 3676902.00 8571.80 FF??T?T?FTT????T 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-167838857700742.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-c016, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857700742
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.0K Feb 25 11:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 11:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 11:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K 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 11K Feb 25 12:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 12:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 12:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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-c016-ReachabilityCardinality-00
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityCardinality-01
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityCardinality-02
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityCardinality-03
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityCardinality-04
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityCardinality-05
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityCardinality-06
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityCardinality-07
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityCardinality-08
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityCardinality-09
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityCardinality-10
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityCardinality-11
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityCardinality-12
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityCardinality-13
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityCardinality-14
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678627723038

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-c016
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 13:28:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 13:28:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 13:28:44] [INFO ] Load time of PNML (sax parser for PT used): 332 ms
[2023-03-12 13:28:44] [INFO ] Transformed 2826 places.
[2023-03-12 13:28:45] [INFO ] Transformed 8960 transitions.
[2023-03-12 13:28:45] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 496 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 28 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c016-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10013 steps, including 2 resets, run finished after 479 ms. (steps per millisecond=20 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 12) seen :1
FORMULA FunctionPointer-PT-c016-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :1
FORMULA FunctionPointer-PT-c016-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) 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 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-12 13:28:46] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2023-03-12 13:28:46] [INFO ] Computed 4 place invariants in 97 ms
[2023-03-12 13:28:46] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:28:46] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 13:28:47] [INFO ] After 817ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 13:28:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-12 13:28:47] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 8 ms returned sat
[2023-03-12 13:28:49] [INFO ] After 1555ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2023-03-12 13:28:49] [INFO ] State equation strengthened by 479 read => feed constraints.
[2023-03-12 13:28:50] [INFO ] After 891ms SMT Verify possible using 479 Read/Feed constraints in natural domain returned unsat :2 sat :8
[2023-03-12 13:28:51] [INFO ] After 2153ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 720 ms.
[2023-03-12 13:28:52] [INFO ] After 5130ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
FORMULA FunctionPointer-PT-c016-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-c016-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 642 ms.
Support contains 66 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 1441 are kept as prefixes of interest. Removing 187 places using SCC suffix rule.11 ms
Discarding 187 places :
Also discarding 0 output transitions
Drop transitions removed 345 transitions
Reduce isomorphic transitions removed 345 transitions.
Iterating post reduction 0 with 345 rules applied. Total rules applied 346 place count 1441 transition count 5617
Discarding 284 places :
Symmetric choice reduction at 1 with 284 rule applications. Total rules 630 place count 1157 transition count 3407
Iterating global reduction 1 with 284 rules applied. Total rules applied 914 place count 1157 transition count 3407
Ensure Unique test removed 364 transitions
Reduce isomorphic transitions removed 364 transitions.
Iterating post reduction 1 with 364 rules applied. Total rules applied 1278 place count 1157 transition count 3043
Discarding 144 places :
Symmetric choice reduction at 2 with 144 rule applications. Total rules 1422 place count 1013 transition count 2755
Iterating global reduction 2 with 144 rules applied. Total rules applied 1566 place count 1013 transition count 2755
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 1630 place count 1013 transition count 2691
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1641 place count 1002 transition count 2669
Iterating global reduction 3 with 11 rules applied. Total rules applied 1652 place count 1002 transition count 2669
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1662 place count 992 transition count 2649
Iterating global reduction 3 with 10 rules applied. Total rules applied 1672 place count 992 transition count 2649
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1682 place count 982 transition count 2629
Iterating global reduction 3 with 10 rules applied. Total rules applied 1692 place count 982 transition count 2629
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1702 place count 972 transition count 2609
Iterating global reduction 3 with 10 rules applied. Total rules applied 1712 place count 972 transition count 2609
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1721 place count 963 transition count 2591
Iterating global reduction 3 with 9 rules applied. Total rules applied 1730 place count 963 transition count 2591
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1736 place count 957 transition count 2579
Iterating global reduction 3 with 6 rules applied. Total rules applied 1742 place count 957 transition count 2579
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1746 place count 953 transition count 2571
Iterating global reduction 3 with 4 rules applied. Total rules applied 1750 place count 953 transition count 2571
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1765 place count 938 transition count 2515
Iterating global reduction 3 with 15 rules applied. Total rules applied 1780 place count 938 transition count 2515
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 1803 place count 915 transition count 2423
Iterating global reduction 3 with 23 rules applied. Total rules applied 1826 place count 915 transition count 2423
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1847 place count 894 transition count 2359
Iterating global reduction 3 with 21 rules applied. Total rules applied 1868 place count 894 transition count 2359
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1889 place count 873 transition count 2317
Iterating global reduction 3 with 21 rules applied. Total rules applied 1910 place count 873 transition count 2317
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1931 place count 852 transition count 2275
Iterating global reduction 3 with 21 rules applied. Total rules applied 1952 place count 852 transition count 2275
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1973 place count 831 transition count 2233
Iterating global reduction 3 with 21 rules applied. Total rules applied 1994 place count 831 transition count 2233
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 2013 place count 812 transition count 2195
Iterating global reduction 3 with 19 rules applied. Total rules applied 2032 place count 812 transition count 2195
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 2041 place count 803 transition count 2177
Iterating global reduction 3 with 9 rules applied. Total rules applied 2050 place count 803 transition count 2177
Drop transitions removed 82 transitions
Redundant transition composition rules discarded 82 transitions
Iterating global reduction 3 with 82 rules applied. Total rules applied 2132 place count 803 transition count 2095
Applied a total of 2132 rules in 1452 ms. Remains 803 /1628 variables (removed 825) and now considering 2095/5962 (removed 3867) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1453 ms. Remains : 803/1628 places, 2095/5962 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 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 22 ms. (steps per millisecond=454 ) 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 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 150252 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 150252 steps, saw 92989 distinct states, run finished after 3005 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-12 13:28:57] [INFO ] Flow matrix only has 1327 transitions (discarded 768 similar events)
// Phase 1: matrix 1327 rows 803 cols
[2023-03-12 13:28:57] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-12 13:28:57] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:28:57] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 13:28:57] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 13:28:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:28:58] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:28:58] [INFO ] After 636ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-12 13:28:58] [INFO ] State equation strengthened by 233 read => feed constraints.
[2023-03-12 13:28:59] [INFO ] After 460ms SMT Verify possible using 233 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-12 13:28:59] [INFO ] After 1078ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 365 ms.
[2023-03-12 13:29:00] [INFO ] After 2362ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 356 ms.
Support contains 66 out of 803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 803/803 places, 2095/2095 transitions.
Applied a total of 0 rules in 128 ms. Remains 803 /803 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 803/803 places, 2095/2095 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 803/803 places, 2095/2095 transitions.
Applied a total of 0 rules in 128 ms. Remains 803 /803 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
[2023-03-12 13:29:00] [INFO ] Flow matrix only has 1327 transitions (discarded 768 similar events)
[2023-03-12 13:29:00] [INFO ] Invariant cache hit.
[2023-03-12 13:29:01] [INFO ] Implicit Places using invariants in 488 ms returned []
[2023-03-12 13:29:01] [INFO ] Flow matrix only has 1327 transitions (discarded 768 similar events)
[2023-03-12 13:29:01] [INFO ] Invariant cache hit.
[2023-03-12 13:29:01] [INFO ] State equation strengthened by 233 read => feed constraints.
[2023-03-12 13:29:03] [INFO ] Implicit Places using invariants and state equation in 2167 ms returned []
Implicit Place search using SMT with State Equation took 2660 ms to find 0 implicit places.
[2023-03-12 13:29:03] [INFO ] Redundant transitions in 118 ms returned []
[2023-03-12 13:29:03] [INFO ] Flow matrix only has 1327 transitions (discarded 768 similar events)
[2023-03-12 13:29:03] [INFO ] Invariant cache hit.
[2023-03-12 13:29:04] [INFO ] Dead Transitions using invariants and state equation in 686 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3606 ms. Remains : 803/803 places, 2095/2095 transitions.
Ensure Unique test removed 768 transitions
Reduce isomorphic transitions removed 768 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 817 rules applied. Total rules applied 817 place count 803 transition count 1278
Reduce places removed 49 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 54 rules applied. Total rules applied 871 place count 754 transition count 1273
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 876 place count 749 transition count 1273
Performed 188 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 188 Pre rules applied. Total rules applied 876 place count 749 transition count 1085
Deduced a syphon composed of 188 places in 1 ms
Reduce places removed 188 places and 0 transitions.
Iterating global reduction 3 with 376 rules applied. Total rules applied 1252 place count 561 transition count 1085
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 1 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 1506 place count 434 transition count 958
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 1562 place count 378 transition count 846
Iterating global reduction 3 with 56 rules applied. Total rules applied 1618 place count 378 transition count 846
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1619 place count 378 transition count 845
Discarding 52 places :
Symmetric choice reduction at 4 with 52 rule applications. Total rules 1671 place count 326 transition count 741
Iterating global reduction 4 with 52 rules applied. Total rules applied 1723 place count 326 transition count 741
Discarding 48 places :
Symmetric choice reduction at 4 with 48 rule applications. Total rules 1771 place count 278 transition count 645
Iterating global reduction 4 with 48 rules applied. Total rules applied 1819 place count 278 transition count 645
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 4 with 36 rules applied. Total rules applied 1855 place count 278 transition count 609
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 1857 place count 277 transition count 608
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 5 with 70 rules applied. Total rules applied 1927 place count 242 transition count 624
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 5 with 44 rules applied. Total rules applied 1971 place count 242 transition count 580
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1974 place count 239 transition count 577
Iterating global reduction 5 with 3 rules applied. Total rules applied 1977 place count 239 transition count 577
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1980 place count 239 transition count 574
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1986 place count 236 transition count 607
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1988 place count 236 transition count 605
Free-agglomeration rule applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1996 place count 236 transition count 597
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 2006 place count 228 transition count 595
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 2009 place count 228 transition count 592
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 2010 place count 228 transition count 592
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 2012 place count 228 transition count 592
Applied a total of 2012 rules in 179 ms. Remains 228 /803 variables (removed 575) and now considering 592/2095 (removed 1503) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 592 rows 228 cols
[2023-03-12 13:29:04] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-12 13:29:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 13:29:04] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:29:04] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 13:29:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 13:29:04] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:29:04] [INFO ] After 216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-12 13:29:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 13:29:05] [INFO ] After 148ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-12 13:29:05] [INFO ] After 371ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 140 ms.
[2023-03-12 13:29:05] [INFO ] After 835ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2023-03-12 13:29:05] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-12 13:29:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 803 places, 2095 transitions and 8510 arcs took 9 ms.
[2023-03-12 13:29:05] [INFO ] Flatten gal took : 158 ms
Total runtime 21245 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: 803 NrTr: 2095 NrArc: 8510)

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

net check time: 0m 0.001sec

init dd package: 0m 2.772sec

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

2901 10004 13949 13882 13920 13956 14007 14040 14072 14507 14134 14147 14176 14205 14575 14755 14272 14318 14327 14464 14363 11609 14621 14424 14433 14787 14467 14492 14500 14525 14550 13209 14582 14589 14644 14621 14628 14652 14659 14682 14689 14713 14719 14743 14749 14755 14778 14793 14808 14814 14820 12828 14848 14871 14877 14449 14905 15102 14916 13299 14944 14966 15251 14977 14999 15004 15009 15031 15036 14389 15063 15068 15073 15095 15100 15105 12831 15131 15136 15188 15162 15167 15171 15193 15197 15202 15223 15228 15232 15733 15258 15262 15341 15288 15292 15296 15252 15322 15326 15330 15351 15355 15359 15363 15384 15388 15392 15396 15417 15421 15425 15446 15450 15453 15457 15478 15482 15486 15489 15510 15514 15747 15521 15542 15568 15549 15553 15500 168387 244950 303932 301375 357567 340169 325206 305442 682213

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

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