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.r171-tall-167838859000718.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 smartxred
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 r171-tall-167838859000718
=====================================================================

--------------------
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 1679501483950

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c002
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 16:11:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 16:11:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 16:11:25] [INFO ] Load time of PNML (sax parser for PT used): 336 ms
[2023-03-22 16:11:25] [INFO ] Transformed 2826 places.
[2023-03-22 16:11:25] [INFO ] Transformed 8960 transitions.
[2023-03-22 16:11:26] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 603 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 37 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 622 ms. (steps per millisecond=16 ) properties (out of 8) seen :2
FORMULA FunctionPointer-PT-c002-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-c002-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :1
FORMULA FunctionPointer-PT-c002-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :1
FORMULA FunctionPointer-PT-c002-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) 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 4) seen :0
Running SMT prover for 4 properties.
[2023-03-22 16:11:27] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2023-03-22 16:11:27] [INFO ] Computed 4 place invariants in 95 ms
[2023-03-22 16:11:27] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 16:11:27] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 16:11:27] [INFO ] After 651ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 16:11:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-22 16:11:28] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 16:11:29] [INFO ] After 1137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 16:11:29] [INFO ] State equation strengthened by 479 read => feed constraints.
[2023-03-22 16:11:30] [INFO ] After 645ms SMT Verify possible using 479 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 16:11:30] [INFO ] Deduced a trap composed of 131 places in 607 ms of which 14 ms to minimize.
[2023-03-22 16:11:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 794 ms
[2023-03-22 16:11:31] [INFO ] After 2005ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 401 ms.
[2023-03-22 16:11:31] [INFO ] After 3986ms 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 60 ms.
Support contains 28 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 292 places :
Symmetric choice reduction at 1 with 292 rule applications. Total rules 660 place count 1136 transition count 3337
Iterating global reduction 1 with 292 rules applied. Total rules applied 952 place count 1136 transition count 3337
Ensure Unique test removed 350 transitions
Reduce isomorphic transitions removed 350 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 1302 place count 1136 transition count 2987
Discarding 150 places :
Symmetric choice reduction at 2 with 150 rule applications. Total rules 1452 place count 986 transition count 2687
Iterating global reduction 2 with 150 rules applied. Total rules applied 1602 place count 986 transition count 2687
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 1666 place count 986 transition count 2623
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1679 place count 973 transition count 2597
Iterating global reduction 3 with 13 rules applied. Total rules applied 1692 place count 973 transition count 2597
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1704 place count 961 transition count 2573
Iterating global reduction 3 with 12 rules applied. Total rules applied 1716 place count 961 transition count 2573
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1728 place count 949 transition count 2549
Iterating global reduction 3 with 12 rules applied. Total rules applied 1740 place count 949 transition count 2549
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1751 place count 938 transition count 2527
Iterating global reduction 3 with 11 rules applied. Total rules applied 1762 place count 938 transition count 2527
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1773 place count 927 transition count 2505
Iterating global reduction 3 with 11 rules applied. Total rules applied 1784 place count 927 transition count 2505
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1793 place count 918 transition count 2487
Iterating global reduction 3 with 9 rules applied. Total rules applied 1802 place count 918 transition count 2487
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1810 place count 910 transition count 2471
Iterating global reduction 3 with 8 rules applied. Total rules applied 1818 place count 910 transition count 2471
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 1850 place count 878 transition count 2351
Iterating global reduction 3 with 32 rules applied. Total rules applied 1882 place count 878 transition count 2351
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 1925 place count 835 transition count 2179
Iterating global reduction 3 with 43 rules applied. Total rules applied 1968 place count 835 transition count 2179
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 2010 place count 793 transition count 2063
Iterating global reduction 3 with 42 rules applied. Total rules applied 2052 place count 793 transition count 2063
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 2094 place count 751 transition count 1979
Iterating global reduction 3 with 42 rules applied. Total rules applied 2136 place count 751 transition count 1979
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 2176 place count 711 transition count 1899
Iterating global reduction 3 with 40 rules applied. Total rules applied 2216 place count 711 transition count 1899
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 2256 place count 671 transition count 1819
Iterating global reduction 3 with 40 rules applied. Total rules applied 2296 place count 671 transition count 1819
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 2335 place count 632 transition count 1741
Iterating global reduction 3 with 39 rules applied. Total rules applied 2374 place count 632 transition count 1741
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 2388 place count 618 transition count 1713
Iterating global reduction 3 with 14 rules applied. Total rules applied 2402 place count 618 transition count 1713
Drop transitions removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 3 with 42 rules applied. Total rules applied 2444 place count 618 transition count 1671
Applied a total of 2444 rules in 1208 ms. Remains 618 /1628 variables (removed 1010) and now considering 1671/5962 (removed 4291) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1208 ms. Remains : 618/1628 places, 1671/5962 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 4) 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 4) seen :1
FORMULA FunctionPointer-PT-c002-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) 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 3) seen :1
FORMULA FunctionPointer-PT-c002-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
[2023-03-22 16:11:33] [INFO ] Flow matrix only has 1016 transitions (discarded 655 similar events)
// Phase 1: matrix 1016 rows 618 cols
[2023-03-22 16:11:33] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-22 16:11:33] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-22 16:11:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 16:11:33] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 16:11:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-22 16:11:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 16:11:33] [INFO ] After 282ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 16:11:33] [INFO ] State equation strengthened by 156 read => feed constraints.
[2023-03-22 16:11:34] [INFO ] After 160ms SMT Verify possible using 156 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 16:11:34] [INFO ] After 284ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-22 16:11:34] [INFO ] After 787ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 20 out of 618 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 618/618 places, 1671/1671 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 613 transition count 1661
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 613 transition count 1661
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 18 place count 613 transition count 1653
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 608 transition count 1641
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 608 transition count 1641
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 604 transition count 1633
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 604 transition count 1633
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 599 transition count 1617
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 599 transition count 1617
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 594 transition count 1607
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 594 transition count 1607
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 589 transition count 1597
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 589 transition count 1597
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 584 transition count 1587
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 584 transition count 1587
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 579 transition count 1577
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 579 transition count 1577
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 90 place count 575 transition count 1569
Iterating global reduction 1 with 4 rules applied. Total rules applied 94 place count 575 transition count 1569
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 100 place count 569 transition count 1551
Iterating global reduction 1 with 6 rules applied. Total rules applied 106 place count 569 transition count 1551
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 109 place count 566 transition count 1545
Iterating global reduction 1 with 3 rules applied. Total rules applied 112 place count 566 transition count 1545
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 115 place count 563 transition count 1539
Iterating global reduction 1 with 3 rules applied. Total rules applied 118 place count 563 transition count 1539
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 121 place count 560 transition count 1533
Iterating global reduction 1 with 3 rules applied. Total rules applied 124 place count 560 transition count 1533
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 127 place count 557 transition count 1527
Iterating global reduction 1 with 3 rules applied. Total rules applied 130 place count 557 transition count 1527
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 133 place count 554 transition count 1521
Iterating global reduction 1 with 3 rules applied. Total rules applied 136 place count 554 transition count 1521
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 552 transition count 1517
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 552 transition count 1517
Applied a total of 140 rules in 265 ms. Remains 552 /618 variables (removed 66) and now considering 1517/1671 (removed 154) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 265 ms. Remains : 552/618 places, 1517/1671 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 307197 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 307197 steps, saw 188381 distinct states, run finished after 3002 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-22 16:11:37] [INFO ] Flow matrix only has 909 transitions (discarded 608 similar events)
// Phase 1: matrix 909 rows 552 cols
[2023-03-22 16:11:37] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-22 16:11:37] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-22 16:11:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-22 16:11:37] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 16:11:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-22 16:11:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 16:11:38] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 16:11:38] [INFO ] State equation strengthened by 133 read => feed constraints.
[2023-03-22 16:11:38] [INFO ] After 129ms SMT Verify possible using 133 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 16:11:38] [INFO ] Deduced a trap composed of 139 places in 149 ms of which 1 ms to minimize.
[2023-03-22 16:11:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2023-03-22 16:11:38] [INFO ] After 435ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-22 16:11:38] [INFO ] After 862ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 20 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1517/1517 transitions.
Applied a total of 0 rules in 67 ms. Remains 552 /552 variables (removed 0) and now considering 1517/1517 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 552/552 places, 1517/1517 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1517/1517 transitions.
Applied a total of 0 rules in 64 ms. Remains 552 /552 variables (removed 0) and now considering 1517/1517 (removed 0) transitions.
[2023-03-22 16:11:38] [INFO ] Flow matrix only has 909 transitions (discarded 608 similar events)
[2023-03-22 16:11:38] [INFO ] Invariant cache hit.
[2023-03-22 16:11:39] [INFO ] Implicit Places using invariants in 370 ms returned []
[2023-03-22 16:11:39] [INFO ] Flow matrix only has 909 transitions (discarded 608 similar events)
[2023-03-22 16:11:39] [INFO ] Invariant cache hit.
[2023-03-22 16:11:39] [INFO ] State equation strengthened by 133 read => feed constraints.
[2023-03-22 16:11:40] [INFO ] Implicit Places using invariants and state equation in 1360 ms returned []
Implicit Place search using SMT with State Equation took 1731 ms to find 0 implicit places.
[2023-03-22 16:11:40] [INFO ] Redundant transitions in 98 ms returned []
[2023-03-22 16:11:40] [INFO ] Flow matrix only has 909 transitions (discarded 608 similar events)
[2023-03-22 16:11:40] [INFO ] Invariant cache hit.
[2023-03-22 16:11:41] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2376 ms. Remains : 552/552 places, 1517/1517 transitions.
Ensure Unique test removed 608 transitions
Reduce isomorphic transitions removed 608 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 625 rules applied. Total rules applied 625 place count 552 transition count 892
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 644 place count 535 transition count 890
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 646 place count 533 transition count 890
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 114 Pre rules applied. Total rules applied 646 place count 533 transition count 776
Deduced a syphon composed of 114 places in 0 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 228 rules applied. Total rules applied 874 place count 419 transition count 776
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 1 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 278 rules applied. Total rules applied 1152 place count 280 transition count 637
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 1216 place count 216 transition count 509
Iterating global reduction 3 with 64 rules applied. Total rules applied 1280 place count 216 transition count 509
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1281 place count 216 transition count 508
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1344 place count 153 transition count 382
Iterating global reduction 4 with 63 rules applied. Total rules applied 1407 place count 153 transition count 382
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1470 place count 90 transition count 256
Iterating global reduction 4 with 63 rules applied. Total rules applied 1533 place count 90 transition count 256
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1596 place count 90 transition count 193
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1596 place count 90 transition count 192
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 1598 place count 89 transition count 192
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 1600 place count 88 transition count 191
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 1620 place count 78 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1622 place count 78 transition count 198
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 6 with 21 rules applied. Total rules applied 1643 place count 78 transition count 177
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1644 place count 77 transition count 176
Iterating global reduction 6 with 1 rules applied. Total rules applied 1645 place count 77 transition count 176
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1651 place count 77 transition count 170
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1652 place count 77 transition count 170
Applied a total of 1652 rules in 86 ms. Remains 77 /552 variables (removed 475) and now considering 170/1517 (removed 1347) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 170 rows 77 cols
[2023-03-22 16:11:41] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-22 16:11:41] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 16:11:41] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 16:11:41] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 16:11:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 16:11:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 16:11:41] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 16:11:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 16:11:41] [INFO ] After 17ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 16:11:41] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-22 16:11:41] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-22 16:11:41] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 9 ms.
[2023-03-22 16:11:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 552 places, 1517 transitions and 6196 arcs took 7 ms.
[2023-03-22 16:11:41] [INFO ] Flatten gal took : 131 ms
Total runtime 16258 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running FunctionPointer (PT), instance c002
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 552 places, 1517 transitions, 6196 arcs.
Final Score: 139719.283
Took : 57 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: FunctionPointer-PT-c002-ReachabilityCardinality-02 (reachable & potential(( ( 2 ) <= (tk(P470)) )))
PROPERTY: FunctionPointer-PT-c002-ReachabilityCardinality-07 (reachable & potential(( ( (! ( ( 2 ) <= (tk(P404)) )) & ( (! ( (tk(P346)) <= ( 1 ) )) & ( (! ( (tk(P427)) <= (tk(P363)) )) | ( ( (tk(P389)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P473)) ) ) ) ) ) & ( ( ( ( 2 ) <= (tk(P460)) ) | ( ( (tk(P479)) <= ( 1 ) ) | ( ( ( 2 ) <= (tk(P483)) ) & ( ( 1 ) <= (tk(P458)) ) ) ) ) & ( ( (! ( ( 1 ) <= (tk(P206)) )) | ( (! ( ( 1 ) <= (tk(P412)) )) | ( ( 1 ) <= (tk(P468)) ) ) ) & ( ( (tk(P7)) <= (tk(P453)) ) | ( ( ( 2 ) <= (tk(P478)) ) & ( ( ( 1 ) <= (tk(P202)) ) & ( ( (tk(P452)) <= ( 2 ) ) | ( (tk(P204)) <= ( 2 ) ) ) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11957012 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16100224 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
Caught signal 15, terminating.

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="smartxred"
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 smartxred"
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 r171-tall-167838859000718"
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 ;