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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 6.9K Feb 25 11:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 11:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 11:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 11:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 12:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 25 12:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 12:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 12:00 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-c002-ReachabilityCardinality-00
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityCardinality-01
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityCardinality-02
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityCardinality-03
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityCardinality-04
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityCardinality-05
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityCardinality-06
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityCardinality-07
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityCardinality-08
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityCardinality-09
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityCardinality-10
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityCardinality-11
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityCardinality-12
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityCardinality-13
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityCardinality-14
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678619781987

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-c002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 11:16:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 11:16:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 11:16:23] [INFO ] Load time of PNML (sax parser for PT used): 339 ms
[2023-03-12 11:16:23] [INFO ] Transformed 2826 places.
[2023-03-12 11:16:23] [INFO ] Transformed 8960 transitions.
[2023-03-12 11:16:23] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 540 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 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-c002-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 8) seen :1
FORMULA FunctionPointer-PT-c002-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :1
FORMULA FunctionPointer-PT-c002-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :1
FORMULA FunctionPointer-PT-c002-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) 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 5) seen :1
FORMULA FunctionPointer-PT-c002-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 4 properties.
[2023-03-12 11:16:24] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2023-03-12 11:16:24] [INFO ] Computed 4 place invariants in 87 ms
[2023-03-12 11:16:25] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-12 11:16:25] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 11:16:25] [INFO ] After 512ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 11:16:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-12 11:16:25] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 11:16:27] [INFO ] After 1203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 11:16:27] [INFO ] State equation strengthened by 479 read => feed constraints.
[2023-03-12 11:16:27] [INFO ] After 439ms SMT Verify possible using 479 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 11:16:28] [INFO ] Deduced a trap composed of 135 places in 644 ms of which 7 ms to minimize.
[2023-03-12 11:16:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 826 ms
[2023-03-12 11:16:28] [INFO ] After 1808ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 430 ms.
[2023-03-12 11:16:29] [INFO ] After 3889ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 45 ms.
Support contains 22 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 1428 are kept as prefixes of interest. Removing 200 places using SCC suffix rule.12 ms
Discarding 200 places :
Also discarding 0 output transitions
Drop transitions removed 367 transitions
Reduce isomorphic transitions removed 367 transitions.
Iterating post reduction 0 with 367 rules applied. Total rules applied 368 place count 1428 transition count 5595
Discarding 295 places :
Symmetric choice reduction at 1 with 295 rule applications. Total rules 663 place count 1133 transition count 3331
Iterating global reduction 1 with 295 rules applied. Total rules applied 958 place count 1133 transition count 3331
Ensure Unique test removed 358 transitions
Reduce isomorphic transitions removed 358 transitions.
Iterating post reduction 1 with 358 rules applied. Total rules applied 1316 place count 1133 transition count 2973
Discarding 151 places :
Symmetric choice reduction at 2 with 151 rule applications. Total rules 1467 place count 982 transition count 2671
Iterating global reduction 2 with 151 rules applied. Total rules applied 1618 place count 982 transition count 2671
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 1682 place count 982 transition count 2607
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1696 place count 968 transition count 2579
Iterating global reduction 3 with 14 rules applied. Total rules applied 1710 place count 968 transition count 2579
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1723 place count 955 transition count 2553
Iterating global reduction 3 with 13 rules applied. Total rules applied 1736 place count 955 transition count 2553
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1749 place count 942 transition count 2527
Iterating global reduction 3 with 13 rules applied. Total rules applied 1762 place count 942 transition count 2527
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1775 place count 929 transition count 2501
Iterating global reduction 3 with 13 rules applied. Total rules applied 1788 place count 929 transition count 2501
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1801 place count 916 transition count 2475
Iterating global reduction 3 with 13 rules applied. Total rules applied 1814 place count 916 transition count 2475
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1825 place count 905 transition count 2453
Iterating global reduction 3 with 11 rules applied. Total rules applied 1836 place count 905 transition count 2453
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1846 place count 895 transition count 2433
Iterating global reduction 3 with 10 rules applied. Total rules applied 1856 place count 895 transition count 2433
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 1896 place count 855 transition count 2283
Iterating global reduction 3 with 40 rules applied. Total rules applied 1936 place count 855 transition count 2283
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 1985 place count 806 transition count 2087
Iterating global reduction 3 with 49 rules applied. Total rules applied 2034 place count 806 transition count 2087
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 2082 place count 758 transition count 1961
Iterating global reduction 3 with 48 rules applied. Total rules applied 2130 place count 758 transition count 1961
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 2177 place count 711 transition count 1867
Iterating global reduction 3 with 47 rules applied. Total rules applied 2224 place count 711 transition count 1867
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 2270 place count 665 transition count 1775
Iterating global reduction 3 with 46 rules applied. Total rules applied 2316 place count 665 transition count 1775
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 2362 place count 619 transition count 1683
Iterating global reduction 3 with 46 rules applied. Total rules applied 2408 place count 619 transition count 1683
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 2452 place count 575 transition count 1595
Iterating global reduction 3 with 44 rules applied. Total rules applied 2496 place count 575 transition count 1595
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 2510 place count 561 transition count 1567
Iterating global reduction 3 with 14 rules applied. Total rules applied 2524 place count 561 transition count 1567
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 3 with 30 rules applied. Total rules applied 2554 place count 561 transition count 1537
Applied a total of 2554 rules in 1160 ms. Remains 561 /1628 variables (removed 1067) and now considering 1537/5962 (removed 4425) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1161 ms. Remains : 561/1628 places, 1537/5962 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 4) 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 4) 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 4) 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 4) 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 4) seen :0
Interrupted probabilistic random walk after 215096 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 215096 steps, saw 131911 distinct states, run finished after 3002 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 11:16:33] [INFO ] Flow matrix only has 925 transitions (discarded 612 similar events)
// Phase 1: matrix 925 rows 561 cols
[2023-03-12 11:16:33] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-12 11:16:33] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 11:16:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 11:16:34] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 11:16:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 11:16:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 11:16:34] [INFO ] After 324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 11:16:34] [INFO ] State equation strengthened by 138 read => feed constraints.
[2023-03-12 11:16:34] [INFO ] After 167ms SMT Verify possible using 138 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 11:16:34] [INFO ] Deduced a trap composed of 135 places in 160 ms of which 2 ms to minimize.
[2023-03-12 11:16:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2023-03-12 11:16:35] [INFO ] After 590ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 150 ms.
[2023-03-12 11:16:35] [INFO ] After 1202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 22 out of 561 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 561/561 places, 1537/1537 transitions.
Applied a total of 0 rules in 73 ms. Remains 561 /561 variables (removed 0) and now considering 1537/1537 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 561/561 places, 1537/1537 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 561/561 places, 1537/1537 transitions.
Applied a total of 0 rules in 76 ms. Remains 561 /561 variables (removed 0) and now considering 1537/1537 (removed 0) transitions.
[2023-03-12 11:16:35] [INFO ] Flow matrix only has 925 transitions (discarded 612 similar events)
[2023-03-12 11:16:35] [INFO ] Invariant cache hit.
[2023-03-12 11:16:35] [INFO ] Implicit Places using invariants in 384 ms returned []
[2023-03-12 11:16:35] [INFO ] Flow matrix only has 925 transitions (discarded 612 similar events)
[2023-03-12 11:16:35] [INFO ] Invariant cache hit.
[2023-03-12 11:16:36] [INFO ] State equation strengthened by 138 read => feed constraints.
[2023-03-12 11:16:36] [INFO ] Implicit Places using invariants and state equation in 1158 ms returned []
Implicit Place search using SMT with State Equation took 1546 ms to find 0 implicit places.
[2023-03-12 11:16:37] [INFO ] Redundant transitions in 103 ms returned []
[2023-03-12 11:16:37] [INFO ] Flow matrix only has 925 transitions (discarded 612 similar events)
[2023-03-12 11:16:37] [INFO ] Invariant cache hit.
[2023-03-12 11:16:37] [INFO ] Dead Transitions using invariants and state equation in 508 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2249 ms. Remains : 561/561 places, 1537/1537 transitions.
Ensure Unique test removed 612 transitions
Reduce isomorphic transitions removed 612 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 629 rules applied. Total rules applied 629 place count 561 transition count 908
Reduce places removed 17 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 19 rules applied. Total rules applied 648 place count 544 transition count 906
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 650 place count 542 transition count 906
Performed 117 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 117 Pre rules applied. Total rules applied 650 place count 542 transition count 789
Deduced a syphon composed of 117 places in 1 ms
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 884 place count 425 transition count 789
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 3 with 280 rules applied. Total rules applied 1164 place count 285 transition count 649
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 1228 place count 221 transition count 521
Iterating global reduction 3 with 64 rules applied. Total rules applied 1292 place count 221 transition count 521
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1293 place count 221 transition count 520
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1356 place count 158 transition count 394
Iterating global reduction 4 with 63 rules applied. Total rules applied 1419 place count 158 transition count 394
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1482 place count 95 transition count 268
Iterating global reduction 4 with 63 rules applied. Total rules applied 1545 place count 95 transition count 268
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1608 place count 95 transition count 205
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1608 place count 95 transition count 204
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 1610 place count 94 transition count 204
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1612 place count 93 transition count 203
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 1632 place count 83 transition count 212
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1634 place count 83 transition count 210
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 6 with 23 rules applied. Total rules applied 1657 place count 83 transition count 187
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1658 place count 82 transition count 186
Iterating global reduction 6 with 1 rules applied. Total rules applied 1659 place count 82 transition count 186
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1665 place count 82 transition count 180
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 1667 place count 82 transition count 180
Applied a total of 1667 rules in 84 ms. Remains 82 /561 variables (removed 479) and now considering 180/1537 (removed 1357) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 180 rows 82 cols
[2023-03-12 11:16:37] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 11:16:37] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 11:16:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 11:16:37] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 11:16:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 11:16:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 11:16:37] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 11:16:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 11:16:37] [INFO ] After 30ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 11:16:37] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-12 11:16:37] [INFO ] After 202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-12 11:16:37] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-12 11:16:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 561 places, 1537 transitions and 6276 arcs took 10 ms.
[2023-03-12 11:16:38] [INFO ] Flatten gal took : 130 ms
Total runtime 14774 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: 561 NrTr: 1537 NrArc: 6276)

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

net check time: 0m 0.000sec

init dd package: 0m 2.708sec

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

6673 13849 21025 28201 35377 42294 49470 57228 64473 71718 78963 86208 93453 100698 107013 114189 146379 155073 163767 172461 181155 189849 198543

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

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