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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 7.1K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 11:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 11:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 11:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 25 11:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 11:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 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-b016-ReachabilityFireability-00
FORMULA_NAME FunctionPointer-PT-b016-ReachabilityFireability-01
FORMULA_NAME FunctionPointer-PT-b016-ReachabilityFireability-02
FORMULA_NAME FunctionPointer-PT-b016-ReachabilityFireability-03
FORMULA_NAME FunctionPointer-PT-b016-ReachabilityFireability-04
FORMULA_NAME FunctionPointer-PT-b016-ReachabilityFireability-05
FORMULA_NAME FunctionPointer-PT-b016-ReachabilityFireability-06
FORMULA_NAME FunctionPointer-PT-b016-ReachabilityFireability-07
FORMULA_NAME FunctionPointer-PT-b016-ReachabilityFireability-08
FORMULA_NAME FunctionPointer-PT-b016-ReachabilityFireability-09
FORMULA_NAME FunctionPointer-PT-b016-ReachabilityFireability-10
FORMULA_NAME FunctionPointer-PT-b016-ReachabilityFireability-11
FORMULA_NAME FunctionPointer-PT-b016-ReachabilityFireability-12
FORMULA_NAME FunctionPointer-PT-b016-ReachabilityFireability-13
FORMULA_NAME FunctionPointer-PT-b016-ReachabilityFireability-14
FORMULA_NAME FunctionPointer-PT-b016-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679497113002

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b016
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 14:58:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 14:58:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 14:58:34] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2023-03-22 14:58:34] [INFO ] Transformed 306 places.
[2023-03-22 14:58:34] [INFO ] Transformed 840 transitions.
[2023-03-22 14:58:34] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 150 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 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-b016-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 10 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 13) seen :8
FORMULA FunctionPointer-PT-b016-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b016-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b016-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b016-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b016-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b016-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b016-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b016-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :1
FORMULA FunctionPointer-PT-b016-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-22 14:58:35] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2023-03-22 14:58:35] [INFO ] Computed 4 place invariants in 16 ms
[2023-03-22 14:58:36] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-22 14:58:36] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-22 14:58:36] [INFO ] After 111ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:2
[2023-03-22 14:58:36] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-22 14:58:36] [INFO ] After 30ms SMT Verify possible using 65 Read/Feed constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-22 14:58:36] [INFO ] After 350ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-22 14:58:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 14:58:36] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 14:58:36] [INFO ] After 186ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-22 14:58:36] [INFO ] After 107ms SMT Verify possible using 65 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-22 14:58:36] [INFO ] After 250ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-22 14:58:36] [INFO ] After 614ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA FunctionPointer-PT-b016-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 42 ms.
Support contains 18 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 212 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.5 ms
Discarding 10 places :
Also discarding 0 output transitions
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 25 place count 188 transition count 550
Iterating global reduction 0 with 24 rules applied. Total rules applied 49 place count 188 transition count 550
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 0 with 68 rules applied. Total rules applied 117 place count 188 transition count 482
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 129 place count 176 transition count 458
Iterating global reduction 1 with 12 rules applied. Total rules applied 141 place count 176 transition count 458
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 161 place count 176 transition count 438
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 168 place count 169 transition count 424
Iterating global reduction 2 with 7 rules applied. Total rules applied 175 place count 169 transition count 424
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 181 place count 163 transition count 400
Iterating global reduction 2 with 6 rules applied. Total rules applied 187 place count 163 transition count 400
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 193 place count 157 transition count 388
Iterating global reduction 2 with 6 rules applied. Total rules applied 199 place count 157 transition count 388
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 201 place count 155 transition count 380
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 155 transition count 380
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 204 place count 154 transition count 376
Iterating global reduction 2 with 1 rules applied. Total rules applied 205 place count 154 transition count 376
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 206 place count 153 transition count 374
Iterating global reduction 2 with 1 rules applied. Total rules applied 207 place count 153 transition count 374
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 208 place count 152 transition count 372
Iterating global reduction 2 with 1 rules applied. Total rules applied 209 place count 152 transition count 372
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 210 place count 151 transition count 370
Iterating global reduction 2 with 1 rules applied. Total rules applied 211 place count 151 transition count 370
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 212 place count 150 transition count 368
Iterating global reduction 2 with 1 rules applied. Total rules applied 213 place count 150 transition count 368
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 214 place count 149 transition count 366
Iterating global reduction 2 with 1 rules applied. Total rules applied 215 place count 149 transition count 366
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 229 place count 149 transition count 352
Applied a total of 229 rules in 132 ms. Remains 149 /222 variables (removed 73) and now considering 352/648 (removed 296) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 149/222 places, 352/648 transitions.
Incomplete random walk after 10005 steps, including 14 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :1
FORMULA FunctionPointer-PT-b016-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 14:58:37] [INFO ] Flow matrix only has 242 transitions (discarded 110 similar events)
// Phase 1: matrix 242 rows 149 cols
[2023-03-22 14:58:37] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-22 14:58:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 14:58:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 14:58:37] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 14:58:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 14:58:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 14:58:37] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 14:58:37] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-22 14:58:37] [INFO ] After 57ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 14:58:37] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-22 14:58:37] [INFO ] After 302ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 17 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 352/352 transitions.
Applied a total of 0 rules in 11 ms. Remains 149 /149 variables (removed 0) and now considering 352/352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 149/149 places, 352/352 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :1
FORMULA FunctionPointer-PT-b016-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 14:58:37] [INFO ] Flow matrix only has 242 transitions (discarded 110 similar events)
[2023-03-22 14:58:37] [INFO ] Invariant cache hit.
[2023-03-22 14:58:37] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 14:58:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-22 14:58:37] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 14:58:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 14:58:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 14:58:37] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 14:58:37] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-22 14:58:37] [INFO ] After 29ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 14:58:37] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-22 14:58:37] [INFO ] After 208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 15 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 352/352 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 147 transition count 346
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 147 transition count 346
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 145 transition count 342
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 145 transition count 342
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 143 transition count 334
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 143 transition count 334
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 141 transition count 330
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 141 transition count 330
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 139 transition count 326
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 139 transition count 326
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 137 transition count 322
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 137 transition count 322
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 135 transition count 318
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 135 transition count 318
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 133 transition count 314
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 133 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 132 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 132 transition count 312
Applied a total of 34 rules in 48 ms. Remains 132 /149 variables (removed 17) and now considering 312/352 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 132/149 places, 312/352 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1450567 steps, run timeout after 3001 ms. (steps per millisecond=483 ) properties seen :{}
Probabilistic random walk after 1450567 steps, saw 933070 distinct states, run finished after 3002 ms. (steps per millisecond=483 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 14:58:40] [INFO ] Flow matrix only has 215 transitions (discarded 97 similar events)
// Phase 1: matrix 215 rows 132 cols
[2023-03-22 14:58:40] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-22 14:58:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 14:58:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 14:58:41] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 14:58:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 14:58:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 14:58:41] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 14:58:41] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-22 14:58:41] [INFO ] After 32ms SMT Verify possible using 51 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 14:58:41] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-22 14:58:41] [INFO ] After 194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 15 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 312/312 transitions.
Applied a total of 0 rules in 9 ms. Remains 132 /132 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 132/132 places, 312/312 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 312/312 transitions.
Applied a total of 0 rules in 7 ms. Remains 132 /132 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2023-03-22 14:58:41] [INFO ] Flow matrix only has 215 transitions (discarded 97 similar events)
[2023-03-22 14:58:41] [INFO ] Invariant cache hit.
[2023-03-22 14:58:41] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-22 14:58:41] [INFO ] Flow matrix only has 215 transitions (discarded 97 similar events)
[2023-03-22 14:58:41] [INFO ] Invariant cache hit.
[2023-03-22 14:58:41] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-22 14:58:41] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2023-03-22 14:58:41] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-22 14:58:41] [INFO ] Flow matrix only has 215 transitions (discarded 97 similar events)
[2023-03-22 14:58:41] [INFO ] Invariant cache hit.
[2023-03-22 14:58:41] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 395 ms. Remains : 132/132 places, 312/312 transitions.
Graph (trivial) has 170 edges and 132 vertex of which 21 / 132 are part of one of the 7 SCC in 3 ms
Free SCC test removed 14 places
Drop transitions removed 35 transitions
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 118 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 7 rules applied. Total rules applied 8 place count 118 transition count 187
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 111 transition count 186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 110 transition count 186
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 17 place count 110 transition count 166
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 57 place count 90 transition count 166
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 63 place count 84 transition count 160
Iterating global reduction 3 with 6 rules applied. Total rules applied 69 place count 84 transition count 160
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 81 place count 84 transition count 148
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 4 with 34 rules applied. Total rules applied 115 place count 67 transition count 131
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 122 place count 60 transition count 117
Iterating global reduction 4 with 7 rules applied. Total rules applied 129 place count 60 transition count 117
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 134 place count 55 transition count 107
Iterating global reduction 4 with 5 rules applied. Total rules applied 139 place count 55 transition count 107
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 143 place count 51 transition count 99
Iterating global reduction 4 with 4 rules applied. Total rules applied 147 place count 51 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 150 place count 51 transition count 96
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 160 place count 46 transition count 102
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 166 place count 46 transition count 96
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 168 place count 46 transition count 94
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 170 place count 44 transition count 94
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 171 place count 44 transition count 93
Applied a total of 171 rules in 30 ms. Remains 44 /132 variables (removed 88) and now considering 93/312 (removed 219) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 93 rows 44 cols
[2023-03-22 14:58:41] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-22 14:58:41] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 14:58:41] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 14:58:41] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 14:58:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 14:58:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 14:58:41] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 14:58:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 14:58:41] [INFO ] After 11ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 14:58:41] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-22 14:58:41] [INFO ] After 115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 14:58:41] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-22 14:58:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 132 places, 312 transitions and 1262 arcs took 4 ms.
[2023-03-22 14:58:42] [INFO ] Flatten gal took : 69 ms
Total runtime 7739 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running FunctionPointer (PT), instance b016
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 132 places, 312 transitions, 1262 arcs.
Final Score: 4343.717
Took : 12 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679497136216

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 1714:
syntax error

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-b016"
export BK_EXAMINATION="ReachabilityFireability"
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-b016, examination is ReachabilityFireability"
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-167838859000687"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b016.tgz
mv FunctionPointer-PT-b016 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;