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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 6.6K Feb 25 12:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 12:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 12:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 12:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 25 12:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.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 FlexibleBarrier-PT-18b-ReachabilityCardinality-00
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-01
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-02
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-03
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-04
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-05
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-06
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-07
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-08
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-09
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-10
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-11
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-12
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-13
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-14
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679482105928

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=FlexibleBarrier-PT-18b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 10:48:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 10:48:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 10:48:27] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2023-03-22 10:48:27] [INFO ] Transformed 4370 places.
[2023-03-22 10:48:27] [INFO ] Transformed 5037 transitions.
[2023-03-22 10:48:27] [INFO ] Found NUPN structural information;
[2023-03-22 10:48:27] [INFO ] Parsed PT model containing 4370 places and 5037 transitions and 12657 arcs in 258 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 82 resets, run finished after 478 ms. (steps per millisecond=20 ) properties (out of 15) seen :2
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 13) seen :1
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :1
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 11 properties.
// Phase 1: matrix 5037 rows 4370 cols
[2023-03-22 10:48:28] [INFO ] Computed 20 place invariants in 148 ms
[2023-03-22 10:48:30] [INFO ] After 1618ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-22 10:48:31] [INFO ] [Nat]Absence check using 20 positive place invariants in 41 ms returned sat
[2023-03-22 10:48:36] [INFO ] After 4286ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2023-03-22 10:48:37] [INFO ] Deduced a trap composed of 327 places in 350 ms of which 8 ms to minimize.
[2023-03-22 10:48:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 659 ms
[2023-03-22 10:48:38] [INFO ] Deduced a trap composed of 30 places in 352 ms of which 1 ms to minimize.
[2023-03-22 10:48:38] [INFO ] Deduced a trap composed of 189 places in 343 ms of which 1 ms to minimize.
[2023-03-22 10:48:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1144 ms
[2023-03-22 10:48:41] [INFO ] Deduced a trap composed of 334 places in 2354 ms of which 2 ms to minimize.
[2023-03-22 10:48:44] [INFO ] Deduced a trap composed of 1624 places in 2430 ms of which 3 ms to minimize.
[2023-03-22 10:48:46] [INFO ] Deduced a trap composed of 1587 places in 2064 ms of which 3 ms to minimize.
[2023-03-22 10:48:48] [INFO ] Deduced a trap composed of 1540 places in 2076 ms of which 3 ms to minimize.
[2023-03-22 10:48:50] [INFO ] Deduced a trap composed of 1528 places in 1834 ms of which 2 ms to minimize.
[2023-03-22 10:48:52] [INFO ] Deduced a trap composed of 1492 places in 1986 ms of which 3 ms to minimize.
[2023-03-22 10:48:52] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 13803 ms
[2023-03-22 10:48:54] [INFO ] After 21825ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :9
Attempting to minimize the solution found.
Minimization took 1401 ms.
[2023-03-22 10:48:55] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :9
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 9 different solutions.
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 196 ms.
Support contains 96 out of 4370 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4370/4370 places, 5037/5037 transitions.
Graph (trivial) has 4147 edges and 4370 vertex of which 110 / 4370 are part of one of the 18 SCC in 16 ms
Free SCC test removed 92 places
Drop transitions removed 111 transitions
Reduce isomorphic transitions removed 111 transitions.
Drop transitions removed 988 transitions
Trivial Post-agglo rules discarded 988 transitions
Performed 988 trivial Post agglomeration. Transition count delta: 988
Iterating post reduction 0 with 988 rules applied. Total rules applied 989 place count 4278 transition count 3938
Reduce places removed 988 places and 0 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 1 with 1013 rules applied. Total rules applied 2002 place count 3290 transition count 3913
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 2027 place count 3265 transition count 3913
Performed 306 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 306 Pre rules applied. Total rules applied 2027 place count 3265 transition count 3607
Deduced a syphon composed of 306 places in 4 ms
Reduce places removed 306 places and 0 transitions.
Iterating global reduction 3 with 612 rules applied. Total rules applied 2639 place count 2959 transition count 3607
Discarding 1706 places :
Symmetric choice reduction at 3 with 1706 rule applications. Total rules 4345 place count 1253 transition count 1901
Iterating global reduction 3 with 1706 rules applied. Total rules applied 6051 place count 1253 transition count 1901
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 6051 place count 1253 transition count 1895
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 6063 place count 1247 transition count 1895
Discarding 248 places :
Symmetric choice reduction at 3 with 248 rule applications. Total rules 6311 place count 999 transition count 1647
Iterating global reduction 3 with 248 rules applied. Total rules applied 6559 place count 999 transition count 1647
Ensure Unique test removed 224 transitions
Reduce isomorphic transitions removed 224 transitions.
Iterating post reduction 3 with 224 rules applied. Total rules applied 6783 place count 999 transition count 1423
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 6985 place count 898 transition count 1322
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 4 with 36 rules applied. Total rules applied 7021 place count 898 transition count 1286
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 7037 place count 882 transition count 1270
Iterating global reduction 5 with 16 rules applied. Total rules applied 7053 place count 882 transition count 1270
Free-agglomeration rule applied 658 times.
Iterating global reduction 5 with 658 rules applied. Total rules applied 7711 place count 882 transition count 612
Reduce places removed 658 places and 0 transitions.
Drop transitions removed 251 transitions
Reduce isomorphic transitions removed 251 transitions.
Iterating post reduction 5 with 909 rules applied. Total rules applied 8620 place count 224 transition count 361
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 8621 place count 224 transition count 360
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 8623 place count 224 transition count 360
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 8624 place count 223 transition count 359
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t2.t3.t4.t4358.t3676.t3677.t3655.t3656 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 87 edges and 221 vertex of which 32 / 221 are part of one of the 16 SCC in 0 ms
Free SCC test removed 16 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 8628 place count 205 transition count 356
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 34 rules applied. Total rules applied 8662 place count 204 transition count 323
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 8663 place count 203 transition count 323
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 18 Pre rules applied. Total rules applied 8663 place count 203 transition count 305
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 9 with 36 rules applied. Total rules applied 8699 place count 185 transition count 305
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 8716 place count 185 transition count 288
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 10 with 34 rules applied. Total rules applied 8750 place count 168 transition count 271
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 8751 place count 168 transition count 270
Free-agglomeration rule applied 18 times.
Iterating global reduction 11 with 18 rules applied. Total rules applied 8769 place count 168 transition count 252
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 11 with 33 rules applied. Total rules applied 8802 place count 150 transition count 237
Applied a total of 8802 rules in 958 ms. Remains 150 /4370 variables (removed 4220) and now considering 237/5037 (removed 4800) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 958 ms. Remains : 150/4370 places, 237/5037 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 8) seen :1
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :1
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 6) seen :1
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 5) seen :1
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-22 10:48:57] [INFO ] Flow matrix only has 223 transitions (discarded 14 similar events)
// Phase 1: matrix 223 rows 150 cols
[2023-03-22 10:48:57] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-22 10:48:57] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 10:48:57] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-03-22 10:48:57] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 10:48:57] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-22 10:48:57] [INFO ] After 58ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 10:48:57] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 0 ms to minimize.
[2023-03-22 10:48:57] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
[2023-03-22 10:48:57] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2023-03-22 10:48:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 157 ms
[2023-03-22 10:48:57] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 0 ms to minimize.
[2023-03-22 10:48:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-22 10:48:57] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2023-03-22 10:48:58] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 0 ms to minimize.
[2023-03-22 10:48:58] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2023-03-22 10:48:58] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
[2023-03-22 10:48:58] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2023-03-22 10:48:58] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2023-03-22 10:48:58] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 0 ms to minimize.
[2023-03-22 10:48:58] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 0 ms to minimize.
[2023-03-22 10:48:58] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2023-03-22 10:48:58] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 428 ms
[2023-03-22 10:48:58] [INFO ] After 770ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-22 10:48:58] [INFO ] After 980ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 8 ms.
Support contains 35 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 237/237 transitions.
Graph (trivial) has 82 edges and 150 vertex of which 2 / 150 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 149 transition count 216
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 130 transition count 216
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 67 place count 102 transition count 188
Iterating global reduction 2 with 28 rules applied. Total rules applied 95 place count 102 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 102 transition count 187
Performed 17 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
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 130 place count 85 transition count 169
Drop transitions removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 3 with 55 rules applied. Total rules applied 185 place count 85 transition count 114
Free-agglomeration rule applied 16 times.
Iterating global reduction 4 with 16 rules applied. Total rules applied 201 place count 85 transition count 98
Reduce places removed 19 places and 0 transitions.
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 35 rules applied. Total rules applied 236 place count 66 transition count 82
Applied a total of 236 rules in 11 ms. Remains 66 /150 variables (removed 84) and now considering 82/237 (removed 155) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 66/150 places, 82/237 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :1
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-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.
// Phase 1: matrix 82 rows 66 cols
[2023-03-22 10:48:58] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-22 10:48:58] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 10:48:58] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 10:48:58] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 10:48:58] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-22 10:48:58] [INFO ] After 9ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 10:48:58] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2023-03-22 10:48:58] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2023-03-22 10:48:58] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2023-03-22 10:48:58] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2023-03-22 10:48:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 124 ms
[2023-03-22 10:48:58] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-22 10:48:58] [INFO ] After 209ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 23 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 82/82 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 66 transition count 77
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 61 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 60 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 60 transition count 76
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 30 place count 50 transition count 68
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 37 place count 50 transition count 61
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 40 place count 50 transition count 58
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 47 place count 46 transition count 55
Applied a total of 47 rules in 9 ms. Remains 46 /66 variables (removed 20) and now considering 55/82 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 46/66 places, 55/82 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) 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 1) seen :0
Finished probabilistic random walk after 6175 steps, run visited all 1 properties in 13 ms. (steps per millisecond=475 )
Probabilistic random walk after 6175 steps, saw 2287 distinct states, run finished after 14 ms. (steps per millisecond=441 ) properties seen :1
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 31460 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running FlexibleBarrier (PT), instance 18b
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: 4370 places, 5037 transitions, 12657 arcs.
Final Score: 3569270.79
Took : 38 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: FlexibleBarrier-PT-18b-ReachabilityCardinality-00 (reachable &!potential( ( ( (tk(P115)) <= ( 1 ) ) | ( (tk(P1437)) <= (tk(P2650)) ) )))
PROPERTY: FlexibleBarrier-PT-18b-ReachabilityCardinality-01 (reachable &!potential( (! ( ( ( 1 ) <= (tk(P2204)) ) & ( (! ( ( ( (! ( (tk(P2420)) <= ( 0 ) )) & (! ( (tk(P2265)) <= (tk(P1520)) )) ) | ( ( (tk(P1831)) <= (tk(P3549)) ) | ( ( ( 1 ) <= (tk(P1166)) ) | ( ( 1 ) <= (tk(P1460)) ) ) ) ) & ( (tk(P1205)) <= (tk(P182)) ) )) & ( (tk(P2006)) <= (tk(P286)) ) ) ))))
PROPERTY: FlexibleBarrier-PT-18b-ReachabilityCardinality-02 (reachable &!potential( (! ( ( (! ( ( (tk(P2603)) <= (tk(P2675)) ) | ( (! ( (tk(P106)) <= (tk(P3862)) )) | ( ( ( 1 ) <= (tk(P433)) ) | ( (! ( ( 1 ) <= (tk(P3864)) )) & ( (tk(P4124)) <= (tk(P2851)) ) ) ) ) )) | ( ( 1 ) <= (tk(P2586)) ) ) & (! ( ( (tk(P2953)) <= (tk(P3296)) ) | (! ( ( (tk(P1970)) <= ( 0 ) ) & ( ( (tk(P2824)) <= (tk(P2054)) ) | ( (tk(P3549)) <= ( 0 ) ) ) )) )) ))))
PROPERTY: FlexibleBarrier-PT-18b-ReachabilityCardinality-03 (reachable & potential(( (! ( (! ( ( ( ( (! ( (tk(P2447)) <= (tk(P1251)) )) | ( ( (tk(P561)) <= (tk(P462)) ) | ( (tk(P3561)) <= (tk(P1022)) ) ) ) | ( (tk(P3984)) <= (tk(P3627)) ) ) & (! ( ( (tk(P1706)) <= (tk(P1216)) ) | (! ( ( 1 ) <= (tk(P4359)) )) )) ) & ( (tk(P3429)) <= ( 1 ) ) )) | (! ( (tk(P117)) <= (tk(P1097)) )) )) & ( ( ( ( ( ( ( ( 1 ) <= (tk(P30)) ) | ( ( ( 1 ) <= (tk(P3963)) ) | ( ( ( 1 ) <= (tk(P2082)) ) | ( (tk(P3810)) <= ( 0 ) ) ) ) ) | (! ( (tk(P3535)) <= (tk(P251)) )) ) | ( (tk(P1627)) <= ( 0 ) ) ) | ( (! ( ( ( (tk(P2778)) <= (tk(P119)) ) & ( (tk(P2859)) <= (tk(P419)) ) ) | (! ( ( 1 ) <= (tk(P294)) )) )) & ( ( ( (tk(P2196)) <= (tk(P91)) ) & ( ( (tk(P1664)) <= (tk(P1222)) ) & ( ( (tk(P4235)) <= (tk(P4007)) ) & ( (tk(P4121)) <= (tk(P521)) ) ) ) ) | (! ( ( 1 ) <= (tk(P965)) )) ) ) ) | ( (! ( (tk(P1080)) <= ( 1 ) )) | ( ( ( ( ( (tk(P3798)) <= (tk(P3685)) ) & (! ( (tk(P2302)) <= ( 1 ) )) ) & (! ( ( (tk(P202)) <= (tk(P4245)) ) | ( ( 1 ) <= (tk(P416)) ) )) ) | ( (tk(P23)) <= (tk(P2833)) ) ) & ( ( 1 ) <= (tk(P3977)) ) ) ) ) & (! ( ( ( (! ( ( ( ( 1 ) <= (tk(P4139)) ) | ( (tk(P3949)) <= (tk(P714)) ) ) | ( (tk(P1995)) <= ( 0 ) ) )) | ( ( ( ( (tk(P2617)) <= (tk(P3237)) ) | ( ( 1 ) <= (tk(P3364)) ) ) | ( ( ( 1 ) <= (tk(P1043)) ) & ( (tk(P43)) <= (tk(P3029)) ) ) ) | ( (tk(P4240)) <= (tk(P1634)) ) ) ) | (! ( ( ( 1 ) <= (tk(P3252)) ) | ( ( (tk(P3184)) <= (tk(P1488)) ) & (! ( (tk(P43)) <= ( 1 ) )) ) )) ) | ( ( ( (! ( ( (tk(P3988)) <= (tk(P1935)) ) | ( (tk(P824)) <= ( 0 ) ) )) | ( ( (tk(P2762)) <= (tk(P101)) ) & ( ( ( 1 ) <= (tk(P3088)) ) | ( (tk(P2794)) <= (tk(P874)) ) ) ) ) | ( (tk(P783)) <= ( 0 ) ) ) | ( ( (tk(P2277)) <= ( 1 ) ) & (! ( ( 1 ) <= (tk(P2248)) )) ) ) )) ) )))
PROPERTY: FlexibleBarrier-PT-18b-ReachabilityCardinality-04 (reachable & potential((! ( (! ( ( ( (tk(P2996)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2837)) ) ) | ( (tk(P345)) <= ( 1 ) ) )) | ( (! ( ( ( (tk(P1837)) <= (tk(P3020)) ) & (! ( ( 1 ) <= (tk(P2044)) )) ) & (! ( ( ( (tk(P4010)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P295)) ) ) & ( (tk(P838)) <= ( 1 ) ) )) )) | ( ( ( (! ( ( ( (tk(P4104)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P696)) ) ) | (! ( (tk(P1713)) <= (tk(P1760)) )) )) & ( (! ( ( 1 ) <= (tk(P910)) )) & ( ( ( ( 1 ) <= (tk(P1576)) ) | ( ( 1 ) <= (tk(P1050)) ) ) & ( ( ( 1 ) <= (tk(P652)) ) & ( (tk(P4026)) <= (tk(P4121)) ) ) ) ) ) & ( ( ( ( ( ( 1 ) <= (tk(P466)) ) & ( (tk(P1360)) <= ( 1 ) ) ) | (! ( ( 1 ) <= (tk(P1736)) )) ) & (! ( (tk(P3903)) <= (tk(P668)) )) ) | ( (! ( ( (tk(P356)) <= ( 0 ) ) | ( (tk(P1406)) <= (tk(P4066)) ) )) & ( (! ( (tk(P2768)) <= ( 0 ) )) | ( ( (tk(P3855)) <= ( 0 ) ) & ( (tk(P3512)) <= ( 0 ) ) ) ) ) ) ) | ( ( ( ( ( 1 ) <= (tk(P3199)) ) & ( (! ( ( 1 ) <= (tk(P3799)) )) | ( ( ( 1 ) <= (tk(P3627)) ) | ( ( 1 ) <= (tk(P3144)) ) ) ) ) | ( ( (! ( ( 1 ) <= (tk(P3303)) )) | ( ( (tk(P1260)) <= ( 1 ) ) | ( (tk(P3325)) <= ( 0 ) ) ) ) & ( (! ( ( 1 ) <= (tk(P3852)) )) & ( ( (tk(P812)) <= (tk(P1779)) ) & ( (tk(P21)) <= (tk(P929)) ) ) ) ) ) | ( ( (tk(P2535)) <= (tk(P2753)) ) | (! ( (tk(P200)) <= (tk(P208)) )) ) ) ) ) ))))
PROPERTY: FlexibleBarrier-PT-18b-ReachabilityCardinality-05 (reachable &!potential( ( (tk(P123)) <= (tk(P519)) )))
PROPERTY: FlexibleBarrier-PT-18b-ReachabilityCardinality-06 (reachable & potential((! ( ( ( 1 ) <= (tk(P3420)) ) | ( (tk(P688)) <= ( 0 ) ) ))))
PROPERTY: FlexibleBarrier-PT-18b-ReachabilityCardinality-07 (reachable & potential(( ( (! ( ( (tk(P1650)) <= (tk(P2572)) ) & ( ( (tk(P4020)) <= (tk(P3119)) ) | ( (! ( (! ( (tk(P3083)) <= ( 0 ) )) & (! ( (tk(P3275)) <= (tk(P2601)) )) )) & ( ( ( ( (tk(P1899)) <= (tk(P4273)) ) | ( (tk(P1668)) <= ( 0 ) ) ) | ( ( ( 1 ) <= (tk(P3902)) ) | ( ( 1 ) <= (tk(P3064)) ) ) ) & (! ( ( ( 1 ) <= (tk(P3018)) ) & ( (tk(P2986)) <= ( 1 ) ) )) ) ) ) )) & ( (tk(P2240)) <= (tk(P2516)) ) ) & ( (tk(P1003)) <= (tk(P2866)) ) )))
PROPERTY: FlexibleBarrier-PT-18b-ReachabilityCardinality-08 (reachable & potential((! ( ( (tk(P2131)) <= (tk(P3503)) ) | ( ( ( ( ( ( ( ( ( 1 ) <= (tk(P4323)) ) | ( (tk(P2557)) <= (tk(P1287)) ) ) & ( ( (tk(P2356)) <= (tk(P3653)) ) & ( (tk(P93)) <= ( 0 ) ) ) ) & ( (tk(P2212)) <= ( 1 ) ) ) | (! ( ( ( 1 ) <= (tk(P1128)) ) & ( ( (tk(P842)) <= ( 1 ) ) | ( (tk(P3159)) <= (tk(P1292)) ) ) )) ) & ( ( (! ( (tk(P409)) <= (tk(P2714)) )) | (! ( ( 1 ) <= (tk(P1788)) )) ) & ( ( 1 ) <= (tk(P1144)) ) ) ) | ( ( ( 1 ) <= (tk(P3079)) ) | (! ( (! ( (tk(P837)) <= ( 1 ) )) | ( (! ( (tk(P3652)) <= (tk(P2838)) )) & ( (tk(P620)) <= ( 1 ) ) ) )) ) ) | ( ( ( ( ( (! ( (tk(P2865)) <= (tk(P3796)) )) & ( ( (tk(P2293)) <= (tk(P2706)) ) & ( (tk(P3215)) <= (tk(P2060)) ) ) ) & ( (tk(P2773)) <= ( 1 ) ) ) & (! ( ( ( 1 ) <= (tk(P3680)) ) | ( (tk(P47)) <= ( 0 ) ) )) ) | (! ( ( 1 ) <= (tk(P4333)) )) ) | ( ( 1 ) <= (tk(P1602)) ) ) ) ))))
PROPERTY: FlexibleBarrier-PT-18b-ReachabilityCardinality-09 (reachable & potential(( (! ( (tk(P3903)) <= (tk(P3354)) )) & ( ( (tk(P1210)) <= (tk(P2221)) ) & ( (tk(P3109)) <= (tk(P3381)) ) ) )))
PROPERTY: FlexibleBarrier-PT-18b-ReachabilityCardinality-10 (reachable & potential((! ( (tk(P817)) <= ( 0 ) ))))
PROPERTY: FlexibleBarrier-PT-18b-ReachabilityCardinality-11 (reachable &!potential( ( (tk(P3613)) <= (tk(P2762)) )))
PROPERTY: FlexibleBarrier-PT-18b-ReachabilityCardinality-12 (reachable &!potential( (! ( ( ( 1 ) <= (tk(P462)) ) & ( (! ( (tk(P330)) <= ( 0 ) )) | ( ( ( (tk(P1064)) <= (tk(P1423)) ) & ( ( ( 1 ) <= (tk(P51)) ) & ( ( 1 ) <= (tk(P1605)) ) ) ) | (! ( ( ( ( ( (tk(P520)) <= (tk(P44)) ) | ( (tk(P2692)) <= ( 1 ) ) ) & ( (tk(P919)) <= ( 1 ) ) ) & ( (! ( ( 1 ) <= (tk(P2768)) )) & ( ( (tk(P2027)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P435)) ) ) ) ) | ( ( ( 1 ) <= (tk(P2583)) ) & ( ( ( (tk(P4153)) <= (tk(P3794)) ) & ( ( 1 ) <= (tk(P3508)) ) ) | ( ( (tk(P328)) <= (tk(P2630)) ) | ( (tk(P1041)) <= (tk(P2952)) ) ) ) ) )) ) ) ))))
PROPERTY: FlexibleBarrier-PT-18b-ReachabilityCardinality-13 (reachable & potential(( ( 1 ) <= (tk(P2276)) )))
PROPERTY: FlexibleBarrier-PT-18b-ReachabilityCardinality-14 (reachable & potential((! ( ( ( ( ( 1 ) <= (tk(P1194)) ) | ( (tk(P3153)) <= (tk(P1334)) ) ) | ( (! ( ( (! ( (tk(P3184)) <= (tk(P1167)) )) | ( ( ( (tk(P1440)) <= (tk(P1889)) ) | ( (tk(P3070)) <= (tk(P2488)) ) ) & ( ( ( 1 ) <= (tk(P1219)) ) | ( ( 1 ) <= (tk(P4128)) ) ) ) ) & ( (tk(P1893)) <= (tk(P3564)) ) )) | ( ( ( ( (! ( ( 1 ) <= (tk(P3010)) )) & (! ( (tk(P3835)) <= (tk(P1618)) )) ) & (! ( ( (tk(P2967)) <= (tk(P523)) ) & ( (tk(P228)) <= (tk(P4218)) ) )) ) | ( (tk(P3705)) <= ( 0 ) ) ) & ( (tk(P119)) <= (tk(P437)) ) ) ) ) | ( ( ( 1 ) <= (tk(P741)) ) & ( ( (! ( (tk(P1437)) <= ( 1 ) )) & ( ( ( 1 ) <= (tk(P1437)) ) & ( ( (tk(P2951)) <= ( 0 ) ) & (! ( ( (tk(P2398)) <= ( 1 ) ) & ( (tk(P3273)) <= (tk(P3742)) ) )) ) ) ) & (! ( ( (tk(P4262)) <= ( 1 ) ) & ( (! ( (tk(P1625)) <= ( 0 ) )) & (! ( ( ( 1 ) <= (tk(P3896)) ) | ( ( 1 ) <= (tk(P1000)) ) )) ) )) ) ) ))))
PROPERTY: FlexibleBarrier-PT-18b-ReachabilityCardinality-15 (reachable &!potential( ( ( (! ( ( (! ( (tk(P2341)) <= ( 0 ) )) & ( (! ( ( 1 ) <= (tk(P1483)) )) | ( (tk(P729)) <= (tk(P2389)) ) ) ) | ( (! ( (tk(P1846)) <= (tk(P3368)) )) | (! ( ( (tk(P1778)) <= ( 1 ) ) | ( (! ( (tk(P4234)) <= (tk(P3975)) )) | ( (tk(P892)) <= (tk(P2202)) ) ) )) ) )) & ( (tk(P2348)) <= (tk(P3783)) ) ) & ( (tk(P1590)) <= (tk(P2113)) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12548032 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16106832 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="FlexibleBarrier-PT-18b"
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 FlexibleBarrier-PT-18b, 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-167838858800566"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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