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

About the Execution of Smart+red for FunctionPointer-PT-c008

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16115.495 1315181.00 1321253.00 16940.70 TTTTFF?TTFFFFFTT 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.r171-tall-167838859000734.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-c008, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r171-tall-167838859000734
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.6K Feb 25 11:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 11:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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 16K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 12:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 12:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 115K 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-c008-ReachabilityCardinality-00
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-01
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-02
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-03
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-04
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-05
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-06
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-07
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-08
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-09
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-10
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-11
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-12
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-13
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-14
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679505110933

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-c008
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 17:11:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 17:11:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 17:11:52] [INFO ] Load time of PNML (sax parser for PT used): 321 ms
[2023-03-22 17:11:52] [INFO ] Transformed 2826 places.
[2023-03-22 17:11:52] [INFO ] Transformed 8960 transitions.
[2023-03-22 17:11:52] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 499 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 52 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 545 ms. (steps per millisecond=18 ) properties (out of 9) seen :3
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-22 17:11:53] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2023-03-22 17:11:54] [INFO ] Computed 4 place invariants in 94 ms
[2023-03-22 17:11:54] [INFO ] After 520ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 17:11:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:11:54] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-22 17:11:56] [INFO ] After 1468ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 17:11:56] [INFO ] State equation strengthened by 479 read => feed constraints.
[2023-03-22 17:11:57] [INFO ] After 601ms SMT Verify possible using 479 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-22 17:11:58] [INFO ] After 1535ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 508 ms.
[2023-03-22 17:11:58] [INFO ] After 4118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 219 ms.
Support contains 21 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 1422 are kept as prefixes of interest. Removing 206 places using SCC suffix rule.14 ms
Discarding 206 places :
Also discarding 0 output transitions
Drop transitions removed 379 transitions
Reduce isomorphic transitions removed 379 transitions.
Iterating post reduction 0 with 379 rules applied. Total rules applied 380 place count 1422 transition count 5583
Discarding 294 places :
Symmetric choice reduction at 1 with 294 rule applications. Total rules 674 place count 1128 transition count 3327
Iterating global reduction 1 with 294 rules applied. Total rules applied 968 place count 1128 transition count 3327
Ensure Unique test removed 360 transitions
Reduce isomorphic transitions removed 360 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 1328 place count 1128 transition count 2967
Discarding 155 places :
Symmetric choice reduction at 2 with 155 rule applications. Total rules 1483 place count 973 transition count 2657
Iterating global reduction 2 with 155 rules applied. Total rules applied 1638 place count 973 transition count 2657
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 1710 place count 973 transition count 2585
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1724 place count 959 transition count 2557
Iterating global reduction 3 with 14 rules applied. Total rules applied 1738 place count 959 transition count 2557
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1752 place count 945 transition count 2529
Iterating global reduction 3 with 14 rules applied. Total rules applied 1766 place count 945 transition count 2529
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1780 place count 931 transition count 2501
Iterating global reduction 3 with 14 rules applied. Total rules applied 1794 place count 931 transition count 2501
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1807 place count 918 transition count 2475
Iterating global reduction 3 with 13 rules applied. Total rules applied 1820 place count 918 transition count 2475
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1832 place count 906 transition count 2451
Iterating global reduction 3 with 12 rules applied. Total rules applied 1844 place count 906 transition count 2451
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1856 place count 894 transition count 2427
Iterating global reduction 3 with 12 rules applied. Total rules applied 1868 place count 894 transition count 2427
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1880 place count 882 transition count 2403
Iterating global reduction 3 with 12 rules applied. Total rules applied 1892 place count 882 transition count 2403
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 1941 place count 833 transition count 2219
Iterating global reduction 3 with 49 rules applied. Total rules applied 1990 place count 833 transition count 2219
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 2045 place count 778 transition count 1999
Iterating global reduction 3 with 55 rules applied. Total rules applied 2100 place count 778 transition count 1999
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 2153 place count 725 transition count 1869
Iterating global reduction 3 with 53 rules applied. Total rules applied 2206 place count 725 transition count 1869
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 2259 place count 672 transition count 1763
Iterating global reduction 3 with 53 rules applied. Total rules applied 2312 place count 672 transition count 1763
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 2363 place count 621 transition count 1661
Iterating global reduction 3 with 51 rules applied. Total rules applied 2414 place count 621 transition count 1661
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 2465 place count 570 transition count 1559
Iterating global reduction 3 with 51 rules applied. Total rules applied 2516 place count 570 transition count 1559
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 2562 place count 524 transition count 1467
Iterating global reduction 3 with 46 rules applied. Total rules applied 2608 place count 524 transition count 1467
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 2620 place count 512 transition count 1443
Iterating global reduction 3 with 12 rules applied. Total rules applied 2632 place count 512 transition count 1443
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 2650 place count 512 transition count 1425
Applied a total of 2650 rules in 1087 ms. Remains 512 /1628 variables (removed 1116) and now considering 1425/5962 (removed 4537) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1091 ms. Remains : 512/1628 places, 1425/5962 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 5) 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 5) seen :1
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :3
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
[2023-03-22 17:12:00] [INFO ] Flow matrix only has 846 transitions (discarded 579 similar events)
// Phase 1: matrix 846 rows 512 cols
[2023-03-22 17:12:00] [INFO ] Computed 3 place invariants in 12 ms
[2023-03-22 17:12:00] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 17:12:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-22 17:12:00] [INFO ] After 262ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 17:12:00] [INFO ] State equation strengthened by 119 read => feed constraints.
[2023-03-22 17:12:00] [INFO ] After 72ms SMT Verify possible using 119 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 17:12:00] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-22 17:12:00] [INFO ] After 553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 14 out of 512 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 512/512 places, 1425/1425 transitions.
Graph (complete) has 2427 edges and 512 vertex of which 509 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 509 transition count 1420
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 504 transition count 1410
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 504 transition count 1410
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 20 place count 504 transition count 1406
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 499 transition count 1396
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 499 transition count 1396
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 33 place count 496 transition count 1388
Iterating global reduction 2 with 3 rules applied. Total rules applied 36 place count 496 transition count 1388
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 494 transition count 1384
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 494 transition count 1384
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 492 transition count 1380
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 492 transition count 1380
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 491 transition count 1378
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 491 transition count 1378
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 490 transition count 1376
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 490 transition count 1376
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 489 transition count 1374
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 489 transition count 1374
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 488 transition count 1372
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 488 transition count 1372
Applied a total of 52 rules in 323 ms. Remains 488 /512 variables (removed 24) and now considering 1372/1425 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 337 ms. Remains : 488/512 places, 1372/1425 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 517078 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :{}
Probabilistic random walk after 517078 steps, saw 318517 distinct states, run finished after 3002 ms. (steps per millisecond=172 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 17:12:04] [INFO ] Flow matrix only has 802 transitions (discarded 570 similar events)
// Phase 1: matrix 802 rows 488 cols
[2023-03-22 17:12:04] [INFO ] Computed 3 place invariants in 10 ms
[2023-03-22 17:12:04] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 17:12:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-22 17:12:04] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 17:12:04] [INFO ] State equation strengthened by 104 read => feed constraints.
[2023-03-22 17:12:04] [INFO ] After 47ms SMT Verify possible using 104 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 17:12:04] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-22 17:12:04] [INFO ] After 423ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 14 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 1372/1372 transitions.
Applied a total of 0 rules in 72 ms. Remains 488 /488 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 488/488 places, 1372/1372 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 1372/1372 transitions.
Applied a total of 0 rules in 53 ms. Remains 488 /488 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
[2023-03-22 17:12:04] [INFO ] Flow matrix only has 802 transitions (discarded 570 similar events)
[2023-03-22 17:12:04] [INFO ] Invariant cache hit.
[2023-03-22 17:12:05] [INFO ] Implicit Places using invariants in 330 ms returned []
[2023-03-22 17:12:05] [INFO ] Flow matrix only has 802 transitions (discarded 570 similar events)
[2023-03-22 17:12:05] [INFO ] Invariant cache hit.
[2023-03-22 17:12:05] [INFO ] State equation strengthened by 104 read => feed constraints.
[2023-03-22 17:12:06] [INFO ] Implicit Places using invariants and state equation in 953 ms returned []
Implicit Place search using SMT with State Equation took 1288 ms to find 0 implicit places.
[2023-03-22 17:12:06] [INFO ] Redundant transitions in 89 ms returned []
[2023-03-22 17:12:06] [INFO ] Flow matrix only has 802 transitions (discarded 570 similar events)
[2023-03-22 17:12:06] [INFO ] Invariant cache hit.
[2023-03-22 17:12:06] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1883 ms. Remains : 488/488 places, 1372/1372 transitions.
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 570 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 587 rules applied. Total rules applied 587 place count 488 transition count 785
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 604 place count 471 transition count 785
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 88 Pre rules applied. Total rules applied 604 place count 471 transition count 697
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 780 place count 383 transition count 697
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 0 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 1044 place count 251 transition count 565
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 1106 place count 189 transition count 441
Iterating global reduction 2 with 62 rules applied. Total rules applied 1168 place count 189 transition count 441
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1172 place count 189 transition count 437
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 1233 place count 128 transition count 315
Iterating global reduction 3 with 61 rules applied. Total rules applied 1294 place count 128 transition count 315
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 1355 place count 67 transition count 193
Iterating global reduction 3 with 61 rules applied. Total rules applied 1416 place count 67 transition count 193
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 3 with 61 rules applied. Total rules applied 1477 place count 67 transition count 132
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 4 with 2 rules applied. Total rules applied 1479 place count 66 transition count 131
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1487 place count 62 transition count 134
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 1497 place count 62 transition count 124
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1498 place count 62 transition count 124
Applied a total of 1498 rules in 62 ms. Remains 62 /488 variables (removed 426) and now considering 124/1372 (removed 1248) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 124 rows 62 cols
[2023-03-22 17:12:06] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-22 17:12:06] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 17:12:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 17:12:06] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 17:12:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 17:12:06] [INFO ] After 11ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 17:12:06] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-22 17:12:06] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 17:12:06] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-22 17:12:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 488 places, 1372 transitions and 5614 arcs took 13 ms.
[2023-03-22 17:12:07] [INFO ] Flatten gal took : 114 ms
Total runtime 14913 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running FunctionPointer (PT), instance c008
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: 488 places, 1372 transitions, 5614 arcs.
Final Score: 67884.866
Took : 66 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: FunctionPointer-PT-c008-ReachabilityCardinality-06 (reachable &!potential( ( ( ( ( (tk(P350)) <= (tk(P351)) ) | ( (tk(P249)) <= ( 0 ) ) ) & ( (! ( ( 5 ) <= (tk(P413)) )) | ( (! ( (tk(P332)) <= ( 0 ) )) | ( ( 1 ) <= (tk(P481)) ) ) ) ) | ( (! ( (tk(P420)) <= ( 4 ) )) & ( ( (! ( ( 5 ) <= (tk(P392)) )) | (! ( (tk(P405)) <= (tk(P390)) )) ) & ( ( ( 7 ) <= (tk(P374)) ) | ( ( (tk(P410)) <= ( 5 ) ) | ( (tk(P359)) <= (tk(P393)) ) ) ) ) ) )))

BK_STOP 1679506426114

--------------------
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
/home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//smart.sh: line 116: 539 Killed ${SMART}/smart ${INPUT_SM}

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

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