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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 6.9K Feb 25 12:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 12:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 12:20 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 24K 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 19K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 25 12:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 12:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 25 12:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 374K 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-10b-ReachabilityCardinality-00
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-01
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-02
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-03
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-04
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-05
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-06
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-07
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-08
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-09
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-10
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-11
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-12
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-13
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-14
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679477531984

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-10b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 09:32:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 09:32:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 09:32:13] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2023-03-22 09:32:13] [INFO ] Transformed 1402 places.
[2023-03-22 09:32:13] [INFO ] Transformed 1613 transitions.
[2023-03-22 09:32:13] [INFO ] Found NUPN structural information;
[2023-03-22 09:32:13] [INFO ] Parsed PT model containing 1402 places and 1613 transitions and 4025 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 134 resets, run finished after 545 ms. (steps per millisecond=18 ) properties (out of 10) seen :2
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1613 rows 1402 cols
[2023-03-22 09:32:14] [INFO ] Computed 12 place invariants in 44 ms
[2023-03-22 09:32:15] [INFO ] [Real]Absence check using 12 positive place invariants in 47 ms returned sat
[2023-03-22 09:32:15] [INFO ] After 765ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 09:32:16] [INFO ] [Nat]Absence check using 12 positive place invariants in 15 ms returned sat
[2023-03-22 09:32:17] [INFO ] After 986ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 09:32:17] [INFO ] Deduced a trap composed of 62 places in 384 ms of which 8 ms to minimize.
[2023-03-22 09:32:18] [INFO ] Deduced a trap composed of 478 places in 306 ms of which 1 ms to minimize.
[2023-03-22 09:32:18] [INFO ] Deduced a trap composed of 443 places in 301 ms of which 1 ms to minimize.
[2023-03-22 09:32:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1200 ms
[2023-03-22 09:32:19] [INFO ] Deduced a trap composed of 62 places in 226 ms of which 1 ms to minimize.
[2023-03-22 09:32:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 327 ms
[2023-03-22 09:32:20] [INFO ] Deduced a trap composed of 481 places in 408 ms of which 1 ms to minimize.
[2023-03-22 09:32:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 522 ms
[2023-03-22 09:32:20] [INFO ] After 3676ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 447 ms.
[2023-03-22 09:32:20] [INFO ] After 5118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 85 ms.
Support contains 43 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1613/1613 transitions.
Graph (trivial) has 1305 edges and 1402 vertex of which 38 / 1402 are part of one of the 6 SCC in 7 ms
Free SCC test removed 32 places
Drop transitions removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Drop transitions removed 337 transitions
Trivial Post-agglo rules discarded 337 transitions
Performed 337 trivial Post agglomeration. Transition count delta: 337
Iterating post reduction 0 with 337 rules applied. Total rules applied 338 place count 1370 transition count 1237
Reduce places removed 337 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 348 rules applied. Total rules applied 686 place count 1033 transition count 1226
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 697 place count 1022 transition count 1226
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 81 Pre rules applied. Total rules applied 697 place count 1022 transition count 1145
Deduced a syphon composed of 81 places in 2 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 859 place count 941 transition count 1145
Discarding 478 places :
Symmetric choice reduction at 3 with 478 rule applications. Total rules 1337 place count 463 transition count 667
Iterating global reduction 3 with 478 rules applied. Total rules applied 1815 place count 463 transition count 667
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1815 place count 463 transition count 662
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1825 place count 458 transition count 662
Discarding 67 places :
Symmetric choice reduction at 3 with 67 rule applications. Total rules 1892 place count 391 transition count 595
Iterating global reduction 3 with 67 rules applied. Total rules applied 1959 place count 391 transition count 595
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 3 with 61 rules applied. Total rules applied 2020 place count 391 transition count 534
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 2154 place count 324 transition count 467
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 2168 place count 324 transition count 453
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 2175 place count 317 transition count 446
Iterating global reduction 5 with 7 rules applied. Total rules applied 2182 place count 317 transition count 446
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 2190 place count 313 transition count 478
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 2193 place count 313 transition count 475
Free-agglomeration rule applied 194 times.
Iterating global reduction 5 with 194 rules applied. Total rules applied 2387 place count 313 transition count 281
Reduce places removed 194 places and 0 transitions.
Drop transitions removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 5 with 231 rules applied. Total rules applied 2618 place count 119 transition count 244
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 6 with 39 rules applied. Total rules applied 2657 place count 119 transition count 205
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 2659 place count 119 transition count 205
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2660 place count 119 transition count 204
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 2661 place count 119 transition count 204
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 2662 place count 118 transition count 203
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t2.t3.t4.t1399.t705.t706.t776.t777.t690.t691 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 52 edges and 116 vertex of which 8 / 116 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 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 7 with 4 rules applied. Total rules applied 2666 place count 112 transition count 200
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 10 rules applied. Total rules applied 2676 place count 111 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2677 place count 110 transition count 191
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 10 Pre rules applied. Total rules applied 2677 place count 110 transition count 181
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 10 with 20 rules applied. Total rules applied 2697 place count 100 transition count 181
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 2705 place count 100 transition count 173
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 11 with 28 rules applied. Total rules applied 2733 place count 86 transition count 159
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 2734 place count 86 transition count 158
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 2738 place count 84 transition count 158
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 2742 place count 84 transition count 154
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 2743 place count 84 transition count 153
Free-agglomeration rule applied 7 times.
Iterating global reduction 13 with 7 rules applied. Total rules applied 2750 place count 84 transition count 146
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 11 rules applied. Total rules applied 2761 place count 77 transition count 142
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 2764 place count 77 transition count 139
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 2765 place count 77 transition count 139
Applied a total of 2765 rules in 327 ms. Remains 77 /1402 variables (removed 1325) and now considering 139/1613 (removed 1474) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 328 ms. Remains : 77/1402 places, 139/1613 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 6) seen :2
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :2
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 09:32:21] [INFO ] Flow matrix only has 127 transitions (discarded 12 similar events)
// Phase 1: matrix 127 rows 77 cols
[2023-03-22 09:32:21] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-22 09:32:21] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 09:32:21] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 09:32:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 1 ms returned sat
[2023-03-22 09:32:21] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 09:32:21] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-22 09:32:21] [INFO ] After 20ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 09:32:21] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2023-03-22 09:32:21] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2023-03-22 09:32:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 80 ms
[2023-03-22 09:32:21] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-22 09:32:21] [INFO ] After 221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 0 ms.
Support contains 38 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 139/139 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 76 transition count 138
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 76 transition count 138
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 72 transition count 134
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 72 transition count 132
Applied a total of 12 rules in 6 ms. Remains 72 /77 variables (removed 5) and now considering 132/139 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 72/77 places, 132/139 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :1
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
[2023-03-22 09:32:21] [INFO ] Flow matrix only has 118 transitions (discarded 14 similar events)
// Phase 1: matrix 118 rows 72 cols
[2023-03-22 09:32:21] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-22 09:32:21] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 09:32:21] [INFO ] After 24ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 09:32:21] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-22 09:32:21] [INFO ] After 8ms SMT Verify possible using 10 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:32:21] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:32:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 09:32:21] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:32:21] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:32:21] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2023-03-22 09:32:21] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2023-03-22 09:32:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 69 ms
[2023-03-22 09:32:21] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-22 09:32:21] [INFO ] After 139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 132/132 transitions.
Graph (trivial) has 66 edges and 72 vertex of which 17 / 72 are part of one of the 6 SCC in 0 ms
Free SCC test removed 11 places
Drop transitions removed 18 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 19 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 61 transition count 106
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 54 transition count 106
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 15 place count 54 transition count 105
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 53 transition count 105
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 29 place count 41 transition count 92
Iterating global reduction 2 with 12 rules applied. Total rules applied 41 place count 41 transition count 92
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 59 place count 31 transition count 84
Drop transitions removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 71 place count 31 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 75 place count 29 transition count 71
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 80 place count 29 transition count 66
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 4 with 27 rules applied. Total rules applied 107 place count 29 transition count 39
Graph (complete) has 66 edges and 29 vertex of which 27 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 4 with 1 rules applied. Total rules applied 108 place count 27 transition count 38
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 109 place count 27 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 112 place count 25 transition count 36
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 113 place count 25 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 115 place count 24 transition count 34
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 117 place count 24 transition count 32
Free-agglomeration rule applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 125 place count 24 transition count 24
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 26 edges and 14 vertex of which 12 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 7 with 18 rules applied. Total rules applied 143 place count 12 transition count 17
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 145 place count 12 transition count 15
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 146 place count 12 transition count 14
Applied a total of 146 rules in 15 ms. Remains 12 /72 variables (removed 60) and now considering 14/132 (removed 118) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 12/72 places, 14/132 transitions.
Finished random walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 8509 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running FlexibleBarrier (PT), instance 10b
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: 1402 places, 1613 transitions, 4025 arcs.
Final Score: 192399.567
Took : 59 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: FlexibleBarrier-PT-10b-ReachabilityCardinality-00 (reachable &!potential( ( (! ( ( ( ( ( (tk(P1125)) <= (tk(P636)) ) & ( ( 1 ) <= (tk(P1336)) ) ) & ( ( ( ( ( (tk(P646)) <= ( 1 ) ) & ( (tk(P725)) <= ( 0 ) ) ) & ( ( ( 1 ) <= (tk(P688)) ) | ( (tk(P593)) <= ( 1 ) ) ) ) & ( ( ( (tk(P1135)) <= ( 1 ) ) | ( (tk(P597)) <= (tk(P1161)) ) ) & ( ( ( 1 ) <= (tk(P985)) ) & ( ( 1 ) <= (tk(P44)) ) ) ) ) & ( ( ( (tk(P573)) <= ( 1 ) ) & ( (tk(P141)) <= (tk(P872)) ) ) & ( (! ( ( 1 ) <= (tk(P625)) )) & ( (tk(P759)) <= ( 1 ) ) ) ) ) ) & (! ( ( (tk(P6)) <= (tk(P804)) ) & (! ( ( ( (tk(P512)) <= ( 1 ) ) | ( (tk(P344)) <= (tk(P1213)) ) ) | ( (tk(P556)) <= (tk(P205)) ) )) )) ) | ( ( 1 ) <= (tk(P161)) ) )) | ( (tk(P212)) <= ( 1 ) ) )))
PROPERTY: FlexibleBarrier-PT-10b-ReachabilityCardinality-01 (reachable & potential((! ( ( ( (! ( (! ( ( ( (tk(P223)) <= ( 1 ) ) | ( (tk(P1158)) <= ( 0 ) ) ) & ( (tk(P354)) <= ( 0 ) ) )) & ( ( (tk(P554)) <= (tk(P275)) ) & (! ( ( (tk(P61)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P718)) ) )) ) )) & ( ( 1 ) <= (tk(P746)) ) ) & (! ( (! ( (! ( (tk(P379)) <= ( 1 ) )) & (! ( ( 1 ) <= (tk(P803)) )) )) | ( ( ( (tk(P1210)) <= (tk(P1165)) ) & ( (! ( (tk(P752)) <= ( 1 ) )) & ( ( ( 1 ) <= (tk(P402)) ) & ( (tk(P392)) <= (tk(P1387)) ) ) ) ) & ( ( (! ( ( 1 ) <= (tk(P640)) )) | ( ( ( 1 ) <= (tk(P403)) ) | ( (tk(P1398)) <= (tk(P441)) ) ) ) & (! ( ( ( 1 ) <= (tk(P27)) ) | ( (tk(P561)) <= (tk(P665)) ) )) ) ) )) ) | ( (! ( ( 1 ) <= (tk(P1291)) )) | ( ( ( 1 ) <= (tk(P110)) ) | (! ( ( 1 ) <= (tk(P105)) )) ) ) ))))
PROPERTY: FlexibleBarrier-PT-10b-ReachabilityCardinality-02 (reachable &!potential( ( (tk(P159)) <= (tk(P1350)) )))
PROPERTY: FlexibleBarrier-PT-10b-ReachabilityCardinality-03 (reachable & potential(( ( 1 ) <= (tk(P112)) )))
PROPERTY: FlexibleBarrier-PT-10b-ReachabilityCardinality-04 (reachable &!potential( ( (tk(P158)) <= ( 1 ) )))
PROPERTY: FlexibleBarrier-PT-10b-ReachabilityCardinality-05 (reachable &!potential( (! ( ( 1 ) <= (tk(P919)) ))))
PROPERTY: FlexibleBarrier-PT-10b-ReachabilityCardinality-06 (reachable & potential(( ( ( ( ( ( 1 ) <= (tk(P611)) ) & ( (! ( (! ( ( (tk(P1162)) <= ( 1 ) ) | ( (tk(P595)) <= (tk(P145)) ) )) | ( (! ( (tk(P241)) <= ( 1 ) )) & ( ( (tk(P497)) <= (tk(P1264)) ) | ( (tk(P598)) <= (tk(P329)) ) ) ) )) & (! ( (! ( (tk(P420)) <= (tk(P756)) )) & (! ( (tk(P225)) <= (tk(P1310)) )) )) ) ) | ( (tk(P1001)) <= ( 0 ) ) ) & (! ( ( ( ( ( ( (tk(P679)) <= ( 1 ) ) | ( (tk(P500)) <= (tk(P506)) ) ) & (! ( (tk(P533)) <= ( 0 ) )) ) | (! ( ( ( 1 ) <= (tk(P30)) ) & ( (tk(P945)) <= (tk(P1402)) ) )) ) | ( ( (! ( ( ( 1 ) <= (tk(P531)) ) & ( (tk(P1131)) <= ( 0 ) ) )) & ( ( ( (tk(P577)) <= (tk(P304)) ) & ( ( 1 ) <= (tk(P932)) ) ) | ( ( ( 1 ) <= (tk(P986)) ) & ( ( 1 ) <= (tk(P1038)) ) ) ) ) | ( ( ( (tk(P352)) <= ( 1 ) ) | (! ( (tk(P697)) <= ( 0 ) )) ) | ( ( ( 1 ) <= (tk(P1347)) ) & ( ( (tk(P557)) <= (tk(P940)) ) | ( (tk(P679)) <= ( 0 ) ) ) ) ) ) ) | (! ( (tk(P1338)) <= (tk(P1278)) )) )) ) & (! ( ( ( ( (! ( (tk(P1156)) <= ( 0 ) )) | ( ( (! ( ( 1 ) <= (tk(P315)) )) & (! ( (tk(P699)) <= (tk(P565)) )) ) & (! ( ( ( 1 ) <= (tk(P379)) ) & ( (tk(P366)) <= ( 0 ) ) )) ) ) & (! ( ( ( ( (tk(P1228)) <= (tk(P1191)) ) | ( (tk(P285)) <= ( 0 ) ) ) & ( ( (tk(P500)) <= ( 1 ) ) | ( (tk(P1060)) <= ( 1 ) ) ) ) & (! ( ( (tk(P81)) <= ( 0 ) ) | ( (tk(P104)) <= (tk(P253)) ) )) )) ) | ( (tk(P938)) <= ( 0 ) ) ) & ( (! ( ( ( 1 ) <= (tk(P1061)) ) & (! ( ( (tk(P467)) <= ( 1 ) ) & ( ( (tk(P1137)) <= (tk(P133)) ) & ( (tk(P1303)) <= (tk(P138)) ) ) )) )) | ( (! ( ( 1 ) <= (tk(P1113)) )) | ( (! ( ( ( (tk(P1027)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P279)) ) ) & ( (tk(P684)) <= (tk(P334)) ) )) & ( ( ( (tk(P1000)) <= (tk(P1134)) ) & ( ( 1 ) <= (tk(P1011)) ) ) | (! ( ( (tk(P1147)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P838)) ) )) ) ) ) ) )) )))
PROPERTY: FlexibleBarrier-PT-10b-ReachabilityCardinality-07 (reachable & potential(( ( ( ( ( ( ( ( ( ( (tk(P835)) <= ( 0 ) ) | ( (tk(P471)) <= ( 1 ) ) ) | ( ( (tk(P1026)) <= ( 0 ) ) | ( (tk(P338)) <= (tk(P250)) ) ) ) & (! ( (tk(P326)) <= (tk(P1031)) )) ) & ( ( ( ( ( 1 ) <= (tk(P1087)) ) & ( (tk(P149)) <= ( 1 ) ) ) | ( (tk(P992)) <= ( 1 ) ) ) | (! ( ( (tk(P760)) <= (tk(P58)) ) | ( ( 1 ) <= (tk(P879)) ) )) ) ) & ( ( ( ( ( 1 ) <= (tk(P411)) ) | ( (tk(P1150)) <= ( 0 ) ) ) | ( ( 1 ) <= (tk(P1156)) ) ) & ( (! ( (tk(P1109)) <= (tk(P905)) )) & ( (! ( (tk(P177)) <= ( 1 ) )) & (! ( (tk(P1100)) <= ( 0 ) )) ) ) ) ) & ( (tk(P221)) <= ( 1 ) ) ) | (! ( ( ( 1 ) <= (tk(P727)) ) | ( (! ( ( ( 1 ) <= (tk(P222)) ) | ( ( 1 ) <= (tk(P488)) ) )) & (! ( ( 1 ) <= (tk(P346)) )) ) )) ) & (! ( (tk(P1265)) <= ( 1 ) )) ) & ( ( ( ( (! ( ( (tk(P573)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P1301)) ) )) & (! ( ( ( ( ( 1 ) <= (tk(P1067)) ) & ( (tk(P826)) <= ( 0 ) ) ) | ( ( (tk(P576)) <= (tk(P267)) ) & ( (tk(P1094)) <= (tk(P983)) ) ) ) & ( (tk(P1239)) <= ( 0 ) ) )) ) | ( ( ( 1 ) <= (tk(P1167)) ) & ( (tk(P879)) <= ( 0 ) ) ) ) | (! ( (tk(P468)) <= ( 1 ) )) ) & (! ( (tk(P1170)) <= ( 0 ) )) ) )))
PROPERTY: FlexibleBarrier-PT-10b-ReachabilityCardinality-08 (reachable & potential(( ( ( (tk(P1012)) <= ( 1 ) ) & ( ( ( 1 ) <= (tk(P447)) ) & ( (tk(P1123)) <= ( 1 ) ) ) ) | ( (! ( (tk(P635)) <= ( 1 ) )) & ( (tk(P737)) <= ( 0 ) ) ) )))
PROPERTY: FlexibleBarrier-PT-10b-ReachabilityCardinality-09 (reachable &!potential( ( ( (! ( (! ( ( (tk(P601)) <= (tk(P1368)) ) | ( (! ( ( 1 ) <= (tk(P242)) )) & ( (! ( (tk(P157)) <= ( 0 ) )) & ( ( 1 ) <= (tk(P171)) ) ) ) )) & (! ( (! ( ( (tk(P707)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1324)) ) )) | ( ( ( ( (tk(P1109)) <= (tk(P319)) ) & ( ( 1 ) <= (tk(P54)) ) ) & ( (tk(P651)) <= (tk(P719)) ) ) | ( ( ( (tk(P55)) <= ( 0 ) ) & ( (tk(P343)) <= (tk(P100)) ) ) & ( ( (tk(P776)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1036)) ) ) ) ) )) )) | ( (tk(P441)) <= ( 1 ) ) ) | ( ( ( ( ( ( ( ( ( (tk(P251)) <= (tk(P41)) ) & ( ( 1 ) <= (tk(P445)) ) ) & ( (tk(P1146)) <= ( 0 ) ) ) & ( ( ( (tk(P305)) <= (tk(P137)) ) & ( (tk(P1222)) <= ( 0 ) ) ) | ( ( (tk(P1211)) <= (tk(P453)) ) & ( ( 1 ) <= (tk(P1273)) ) ) ) ) | ( ( (! ( (tk(P1244)) <= ( 0 ) )) & ( ( ( 1 ) <= (tk(P582)) ) & ( ( 1 ) <= (tk(P618)) ) ) ) & ( ( 1 ) <= (tk(P234)) ) ) ) | (! ( (! ( (tk(P11)) <= ( 0 ) )) | (! ( (tk(P541)) <= (tk(P52)) )) )) ) & ( ( ( ( 1 ) <= (tk(P703)) ) & (! ( (tk(P835)) <= ( 1 ) )) ) | ( (tk(P414)) <= ( 0 ) ) ) ) & ( (tk(P1343)) <= (tk(P400)) ) ) & (! ( (tk(P1013)) <= (tk(P884)) )) ) )))
PROPERTY: FlexibleBarrier-PT-10b-ReachabilityCardinality-10 (reachable &!potential( ( ( (tk(P1307)) <= ( 1 ) ) & ( (tk(P206)) <= ( 0 ) ) )))
PROPERTY: FlexibleBarrier-PT-10b-ReachabilityCardinality-11 (reachable &!potential( ( (! ( ( ( 1 ) <= (tk(P1343)) ) | ( ( ( 1 ) <= (tk(P749)) ) & ( (! ( ( 1 ) <= (tk(P710)) )) | (! ( ( ( 1 ) <= (tk(P1210)) ) & ( (tk(P185)) <= (tk(P497)) ) )) ) ) )) & ( ( ( ( (tk(P447)) <= ( 0 ) ) & ( (! ( ( (tk(P574)) <= (tk(P470)) ) | (! ( (tk(P328)) <= (tk(P225)) )) )) | ( (tk(P1399)) <= ( 1 ) ) ) ) | (! ( (! ( ( (tk(P740)) <= (tk(P986)) ) | ( (tk(P663)) <= ( 0 ) ) )) | (! ( ( ( (tk(P1400)) <= ( 1 ) ) | ( (tk(P456)) <= (tk(P671)) ) ) | ( (! ( (tk(P179)) <= ( 0 ) )) & ( ( ( 1 ) <= (tk(P1001)) ) & ( ( 1 ) <= (tk(P1216)) ) ) ) )) )) ) | ( ( ( ( ( (tk(P984)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P12)) ) ) & ( ( (tk(P180)) <= (tk(P535)) ) & ( ( (! ( ( 1 ) <= (tk(P1227)) )) & ( ( ( 1 ) <= (tk(P799)) ) | ( ( 1 ) <= (tk(P881)) ) ) ) & ( ( (tk(P660)) <= (tk(P652)) ) | ( ( (tk(P933)) <= ( 1 ) ) & ( (tk(P879)) <= (tk(P884)) ) ) ) ) ) ) | ( ( ( (! ( ( (tk(P299)) <= ( 0 ) ) & ( (tk(P810)) <= ( 0 ) ) )) & ( ( ( ( 1 ) <= (tk(P689)) ) & ( (tk(P316)) <= ( 0 ) ) ) | ( ( (tk(P671)) <= ( 0 ) ) & ( (tk(P116)) <= ( 0 ) ) ) ) ) & (! ( (tk(P540)) <= ( 0 ) )) ) | (! ( (! ( ( 1 ) <= (tk(P655)) )) & (! ( ( (tk(P1258)) <= (tk(P1264)) ) & ( (tk(P765)) <= ( 1 ) ) )) )) ) ) & ( ( ( (tk(P268)) <= ( 1 ) ) & ( (! ( (tk(P938)) <= ( 0 ) )) & ( ( ( 1 ) <= (tk(P1008)) ) | ( ( ( 1 ) <= (tk(P845)) ) | ( (tk(P1011)) <= ( 1 ) ) ) ) ) ) | (! ( (! ( (tk(P873)) <= (tk(P1326)) )) & (! ( ( (tk(P96)) <= ( 0 ) ) & ( (tk(P147)) <= ( 1 ) ) )) )) ) ) ) )))
PROPERTY: FlexibleBarrier-PT-10b-ReachabilityCardinality-12 (reachable & potential(( (! ( ( ( 1 ) <= (tk(P138)) ) | ( ( ( ( (! ( (tk(P754)) <= ( 1 ) )) & ( (tk(P840)) <= ( 0 ) ) ) | ( ( ( ( (tk(P1284)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P1100)) ) ) | ( ( (tk(P1173)) <= (tk(P318)) ) | ( (tk(P804)) <= (tk(P449)) ) ) ) & ( (tk(P399)) <= ( 0 ) ) ) ) & ( ( ( 1 ) <= (tk(P1123)) ) | ( ( (tk(P644)) <= ( 1 ) ) | ( ( (tk(P116)) <= ( 1 ) ) & ( (tk(P1276)) <= (tk(P537)) ) ) ) ) ) | ( ( ( ( ( 1 ) <= (tk(P357)) ) & ( ( ( (tk(P352)) <= (tk(P423)) ) | ( (tk(P1339)) <= ( 0 ) ) ) & ( ( 1 ) <= (tk(P60)) ) ) ) | ( (! ( ( ( 1 ) <= (tk(P81)) ) | ( (tk(P943)) <= ( 1 ) ) )) | (! ( (tk(P128)) <= (tk(P87)) )) ) ) | ( ( 1 ) <= (tk(P860)) ) ) ) )) | ( (! ( (tk(P969)) <= ( 1 ) )) | ( ( 1 ) <= (tk(P1145)) ) ) )))
PROPERTY: FlexibleBarrier-PT-10b-ReachabilityCardinality-13 (reachable & potential(( ( 1 ) <= (tk(P846)) )))
PROPERTY: FlexibleBarrier-PT-10b-ReachabilityCardinality-14 (reachable &!potential( ( ( (! ( (tk(P645)) <= ( 1 ) )) & ( ( 1 ) <= (tk(P1056)) ) ) | ( ( (tk(P725)) <= ( 0 ) ) | (! ( ( ( (! ( ( ( (tk(P324)) <= (tk(P540)) ) & ( (tk(P356)) <= (tk(P1202)) ) ) | ( ( 1 ) <= (tk(P199)) ) )) & ( ( (! ( ( 1 ) <= (tk(P790)) )) & (! ( (tk(P723)) <= (tk(P473)) )) ) | ( ( (tk(P814)) <= (tk(P724)) ) | ( ( (tk(P996)) <= ( 0 ) ) & ( (tk(P747)) <= ( 1 ) ) ) ) ) ) & ( ( ( ( ( ( 1 ) <= (tk(P737)) ) & ( ( 1 ) <= (tk(P1200)) ) ) & ( ( ( 1 ) <= (tk(P830)) ) & ( ( 1 ) <= (tk(P735)) ) ) ) & ( (! ( (tk(P448)) <= (tk(P759)) )) | (! ( ( 1 ) <= (tk(P954)) )) ) ) & ( ( ( ( ( 1 ) <= (tk(P198)) ) | ( ( 1 ) <= (tk(P657)) ) ) & ( ( ( 1 ) <= (tk(P856)) ) & ( ( 1 ) <= (tk(P118)) ) ) ) & ( (! ( (tk(P894)) <= ( 0 ) )) | ( (tk(P1330)) <= ( 0 ) ) ) ) ) ) | (! ( ( (tk(P1240)) <= ( 0 ) ) & (! ( (tk(P997)) <= (tk(P33)) )) )) )) ) )))
PROPERTY: FlexibleBarrier-PT-10b-ReachabilityCardinality-15 (reachable & potential((! ( (tk(P989)) <= ( 1 ) ))))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10597480 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16108108 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-10b"
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-10b, 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-167838858700502"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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