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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 876K
-rw-r--r-- 1 mcc users 5.8K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 11:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Feb 25 11:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Feb 25 11:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:08 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 391K 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-b004-ReachabilityCardinality-00
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-01
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-02
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-03
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-04
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-05
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-06
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-07
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-08
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-09
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-10
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-11
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-12
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-13
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-14
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679493498989

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-b004
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 13:58:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 13:58:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 13:58:20] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2023-03-22 13:58:20] [INFO ] Transformed 306 places.
[2023-03-22 13:58:20] [INFO ] Transformed 840 transitions.
[2023-03-22 13:58:20] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 168 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 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 12 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 12) seen :4
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :2
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :1
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :1
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 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 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-22 13:58:21] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2023-03-22 13:58:21] [INFO ] Computed 4 place invariants in 26 ms
[2023-03-22 13:58:21] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 13:58:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 13:58:21] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 13:58:21] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-22 13:58:21] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-22 13:58:21] [INFO ] After 101ms SMT Verify possible using 65 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2023-03-22 13:58:21] [INFO ] After 171ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-22 13:58:21] [INFO ] After 424ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 10 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 648/648 transitions.
Graph (complete) has 932 edges and 222 vertex of which 195 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.3 ms
Discarding 27 places :
Also discarding 0 output transitions
Drop transitions removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 195 transition count 611
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 65 place count 168 transition count 465
Iterating global reduction 1 with 27 rules applied. Total rules applied 92 place count 168 transition count 465
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 132 place count 168 transition count 425
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 145 place count 155 transition count 399
Iterating global reduction 2 with 13 rules applied. Total rules applied 158 place count 155 transition count 399
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 166 place count 155 transition count 391
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 172 place count 149 transition count 379
Iterating global reduction 3 with 6 rules applied. Total rules applied 178 place count 149 transition count 379
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 183 place count 144 transition count 359
Iterating global reduction 3 with 5 rules applied. Total rules applied 188 place count 144 transition count 359
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 193 place count 139 transition count 349
Iterating global reduction 3 with 5 rules applied. Total rules applied 198 place count 139 transition count 349
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 201 place count 136 transition count 337
Iterating global reduction 3 with 3 rules applied. Total rules applied 204 place count 136 transition count 337
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 207 place count 133 transition count 325
Iterating global reduction 3 with 3 rules applied. Total rules applied 210 place count 133 transition count 325
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 213 place count 130 transition count 319
Iterating global reduction 3 with 3 rules applied. Total rules applied 216 place count 130 transition count 319
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 219 place count 127 transition count 313
Iterating global reduction 3 with 3 rules applied. Total rules applied 222 place count 127 transition count 313
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 225 place count 124 transition count 307
Iterating global reduction 3 with 3 rules applied. Total rules applied 228 place count 124 transition count 307
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 231 place count 121 transition count 301
Iterating global reduction 3 with 3 rules applied. Total rules applied 234 place count 121 transition count 301
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 236 place count 119 transition count 297
Iterating global reduction 3 with 2 rules applied. Total rules applied 238 place count 119 transition count 297
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 248 place count 119 transition count 287
Applied a total of 248 rules in 124 ms. Remains 119 /222 variables (removed 103) and now considering 287/648 (removed 361) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 119/222 places, 287/648 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 609615 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :{}
Probabilistic random walk after 609615 steps, saw 397289 distinct states, run finished after 3002 ms. (steps per millisecond=203 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-22 13:58:25] [INFO ] Flow matrix only has 190 transitions (discarded 97 similar events)
// Phase 1: matrix 190 rows 119 cols
[2023-03-22 13:58:25] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-22 13:58:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 13:58:25] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-22 13:58:25] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 13:58:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 13:58:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 13:58:25] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 13:58:25] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 13:58:25] [INFO ] After 22ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 13:58:25] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-22 13:58:25] [INFO ] After 162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 10 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 287/287 transitions.
Applied a total of 0 rules in 17 ms. Remains 119 /119 variables (removed 0) and now considering 287/287 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 119/119 places, 287/287 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 287/287 transitions.
Applied a total of 0 rules in 9 ms. Remains 119 /119 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2023-03-22 13:58:25] [INFO ] Flow matrix only has 190 transitions (discarded 97 similar events)
[2023-03-22 13:58:25] [INFO ] Invariant cache hit.
[2023-03-22 13:58:25] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-22 13:58:25] [INFO ] Flow matrix only has 190 transitions (discarded 97 similar events)
[2023-03-22 13:58:25] [INFO ] Invariant cache hit.
[2023-03-22 13:58:25] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 13:58:25] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2023-03-22 13:58:25] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-22 13:58:25] [INFO ] Flow matrix only has 190 transitions (discarded 97 similar events)
[2023-03-22 13:58:25] [INFO ] Invariant cache hit.
[2023-03-22 13:58:25] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 415 ms. Remains : 119/119 places, 287/287 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 119 transition count 183
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 113 place count 112 transition count 181
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 115 place count 110 transition count 181
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 115 place count 110 transition count 154
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 169 place count 83 transition count 154
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 203 place count 66 transition count 137
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 210 place count 59 transition count 123
Iterating global reduction 3 with 7 rules applied. Total rules applied 217 place count 59 transition count 123
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 222 place count 54 transition count 113
Iterating global reduction 3 with 5 rules applied. Total rules applied 227 place count 54 transition count 113
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 231 place count 50 transition count 105
Iterating global reduction 3 with 4 rules applied. Total rules applied 235 place count 50 transition count 105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 239 place count 50 transition count 101
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 249 place count 45 transition count 104
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 251 place count 45 transition count 102
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 252 place count 45 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 253 place count 44 transition count 101
Applied a total of 253 rules in 25 ms. Remains 44 /119 variables (removed 75) and now considering 101/287 (removed 186) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 101 rows 44 cols
[2023-03-22 13:58:25] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-22 13:58:25] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 13:58:25] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 13:58:25] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 13:58:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 13:58:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 13:58:25] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 13:58:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 13:58:25] [INFO ] After 8ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 13:58:25] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-22 13:58:25] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-22 13:58:25] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2023-03-22 13:58:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 119 places, 287 transitions and 1164 arcs took 3 ms.
[2023-03-22 13:58:26] [INFO ] Flatten gal took : 44 ms
Total runtime 5703 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running FunctionPointer (PT), instance b004
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: 119 places, 287 transitions, 1164 arcs.
Final Score: 4255.33
Took : 9 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: FunctionPointer-PT-b004-ReachabilityCardinality-06 (reachable & potential((! ( (tk(P104)) <= ( 4 ) ))))
PROPERTY: FunctionPointer-PT-b004-ReachabilityCardinality-14 (reachable &!potential( ( ( (! ( (tk(P22)) <= ( 4 ) )) | ( (tk(P29)) <= (tk(P57)) ) ) | ( ( (! ( ( 3 ) <= (tk(P25)) )) & ( ( ( 2 ) <= (tk(P93)) ) | (! ( ( 2 ) <= (tk(P33)) )) ) ) | ( ( ( (tk(P111)) <= ( 0 ) ) & (! ( (tk(P91)) <= ( 1 ) )) ) | ( (! ( (tk(P32)) <= ( 2 ) )) & ( (tk(P91)) <= ( 0 ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8272980 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16107176 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-b004"
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-b004, 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-167838858900670"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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