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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 8.6K Feb 25 14:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 14:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 14:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 14:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 14:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 25 14:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 14:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 14:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.1M 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 DLCflexbar-PT-4b-ReachabilityCardinality-00
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-01
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-02
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-03
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-04
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-05
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-06
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-07
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-08
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-09
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-10
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-11
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-12
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-13
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-14
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678388166698

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=DLCflexbar-PT-4b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 18:56:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 18:56:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 18:56:08] [INFO ] Load time of PNML (sax parser for PT used): 439 ms
[2023-03-09 18:56:09] [INFO ] Transformed 11440 places.
[2023-03-09 18:56:09] [INFO ] Transformed 17128 transitions.
[2023-03-09 18:56:09] [INFO ] Found NUPN structural information;
[2023-03-09 18:56:09] [INFO ] Parsed PT model containing 11440 places and 17128 transitions and 46731 arcs in 854 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 732 ms. (steps per millisecond=13 ) properties (out of 16) seen :5
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) 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 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 17128 rows 11440 cols
[2023-03-09 18:56:11] [INFO ] Computed 608 place invariants in 114 ms
[2023-03-09 18:56:16] [INFO ] [Real]Absence check using 608 positive place invariants in 1177 ms returned sat
[2023-03-09 18:56:16] [INFO ] After 5361ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-09 18:56:21] [INFO ] [Nat]Absence check using 608 positive place invariants in 1122 ms returned sat
[2023-03-09 18:56:41] [INFO ] After 18997ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-09 18:56:41] [INFO ] After 19029ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 18:56:41] [INFO ] After 25058ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 2 different solutions.
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 5 properties in 146 ms.
Support contains 175 out of 11440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11440/11440 places, 17128/17128 transitions.
Graph (trivial) has 10283 edges and 11440 vertex of which 900 / 11440 are part of one of the 67 SCC in 31 ms
Free SCC test removed 833 places
Drop transitions removed 941 transitions
Reduce isomorphic transitions removed 941 transitions.
Drop transitions removed 5052 transitions
Trivial Post-agglo rules discarded 5052 transitions
Performed 5052 trivial Post agglomeration. Transition count delta: 5052
Iterating post reduction 0 with 5052 rules applied. Total rules applied 5053 place count 10607 transition count 11135
Reduce places removed 5052 places and 0 transitions.
Ensure Unique test removed 143 transitions
Reduce isomorphic transitions removed 143 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 1 with 5333 rules applied. Total rules applied 10386 place count 5555 transition count 10854
Reduce places removed 138 places and 0 transitions.
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 2 with 219 rules applied. Total rules applied 10605 place count 5417 transition count 10773
Reduce places removed 38 places and 0 transitions.
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Iterating post reduction 3 with 123 rules applied. Total rules applied 10728 place count 5379 transition count 10688
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 88 rules applied. Total rules applied 10816 place count 5294 transition count 10685
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 10817 place count 5293 transition count 10685
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 104 Pre rules applied. Total rules applied 10817 place count 5293 transition count 10581
Deduced a syphon composed of 104 places in 147 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 6 with 208 rules applied. Total rules applied 11025 place count 5189 transition count 10581
Discarding 1340 places :
Symmetric choice reduction at 6 with 1340 rule applications. Total rules 12365 place count 3849 transition count 9241
Iterating global reduction 6 with 1340 rules applied. Total rules applied 13705 place count 3849 transition count 9241
Performed 531 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 531 Pre rules applied. Total rules applied 13705 place count 3849 transition count 8710
Deduced a syphon composed of 531 places in 141 ms
Reduce places removed 531 places and 0 transitions.
Iterating global reduction 6 with 1062 rules applied. Total rules applied 14767 place count 3318 transition count 8710
Discarding 97 places :
Symmetric choice reduction at 6 with 97 rule applications. Total rules 14864 place count 3221 transition count 6881
Iterating global reduction 6 with 97 rules applied. Total rules applied 14961 place count 3221 transition count 6881
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 6 with 73 rules applied. Total rules applied 15034 place count 3221 transition count 6808
Performed 801 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 801 places in 3 ms
Reduce places removed 801 places and 0 transitions.
Iterating global reduction 7 with 1602 rules applied. Total rules applied 16636 place count 2420 transition count 6002
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 16640 place count 2420 transition count 5998
Renaming transitions due to excessive name length > 1024 char.
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 16644 place count 2416 transition count 5802
Iterating global reduction 8 with 4 rules applied. Total rules applied 16648 place count 2416 transition count 5802
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 16649 place count 2416 transition count 5801
Performed 101 Post agglomeration using F-continuation condition with reduction of 138 identical transitions.
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 9 with 202 rules applied. Total rules applied 16851 place count 2315 transition count 6421
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 16853 place count 2315 transition count 6419
Discarding 32 places :
Symmetric choice reduction at 10 with 32 rule applications. Total rules 16885 place count 2283 transition count 6035
Iterating global reduction 10 with 32 rules applied. Total rules applied 16917 place count 2283 transition count 6035
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Iterating post reduction 10 with 132 rules applied. Total rules applied 17049 place count 2283 transition count 5903
Performed 101 Post agglomeration using F-continuation condition with reduction of 54 identical transitions.
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 11 with 202 rules applied. Total rules applied 17251 place count 2182 transition count 6603
Drop transitions removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Iterating post reduction 11 with 104 rules applied. Total rules applied 17355 place count 2182 transition count 6499
Discarding 7 places :
Symmetric choice reduction at 12 with 7 rule applications. Total rules 17362 place count 2175 transition count 6412
Iterating global reduction 12 with 7 rules applied. Total rules applied 17369 place count 2175 transition count 6412
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 12 with 38 rules applied. Total rules applied 17407 place count 2175 transition count 6374
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -61
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 13 with 14 rules applied. Total rules applied 17421 place count 2168 transition count 6435
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 17431 place count 2168 transition count 6425
Drop transitions removed 107 transitions
Redundant transition composition rules discarded 107 transitions
Iterating global reduction 14 with 107 rules applied. Total rules applied 17538 place count 2168 transition count 6318
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 17544 place count 2162 transition count 6312
Iterating global reduction 14 with 6 rules applied. Total rules applied 17550 place count 2162 transition count 6312
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 17556 place count 2156 transition count 5985
Iterating global reduction 14 with 6 rules applied. Total rules applied 17562 place count 2156 transition count 5985
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 17568 place count 2156 transition count 5979
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 15 with 12 rules applied. Total rules applied 17580 place count 2150 transition count 5973
Discarding 4 places :
Symmetric choice reduction at 15 with 4 rule applications. Total rules 17584 place count 2146 transition count 5757
Iterating global reduction 15 with 4 rules applied. Total rules applied 17588 place count 2146 transition count 5757
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 17592 place count 2146 transition count 5753
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 17594 place count 2145 transition count 5763
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 17595 place count 2145 transition count 5762
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 17 with 9 rules applied. Total rules applied 17604 place count 2145 transition count 5753
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 17606 place count 2144 transition count 5764
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 17607 place count 2144 transition count 5763
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 17608 place count 2144 transition count 5762
Free-agglomeration rule applied 1106 times with reduction of 603 identical transitions.
Iterating global reduction 18 with 1106 rules applied. Total rules applied 18714 place count 2144 transition count 4053
Reduce places removed 1106 places and 0 transitions.
Drop transitions removed 1479 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 1507 transitions.
Graph (complete) has 3277 edges and 1038 vertex of which 1019 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.2 ms
Discarding 19 places :
Also discarding 15 output transitions
Drop transitions removed 15 transitions
Iterating post reduction 18 with 2614 rules applied. Total rules applied 21328 place count 1019 transition count 2531
Drop transitions removed 25 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 19 with 33 rules applied. Total rules applied 21361 place count 1019 transition count 2498
Discarding 81 places :
Symmetric choice reduction at 20 with 81 rule applications. Total rules 21442 place count 938 transition count 2363
Iterating global reduction 20 with 81 rules applied. Total rules applied 21523 place count 938 transition count 2363
Drop transitions removed 206 transitions
Redundant transition composition rules discarded 206 transitions
Iterating global reduction 20 with 206 rules applied. Total rules applied 21729 place count 938 transition count 2157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 21730 place count 937 transition count 2157
Discarding 43 places :
Symmetric choice reduction at 21 with 43 rule applications. Total rules 21773 place count 894 transition count 2090
Iterating global reduction 21 with 43 rules applied. Total rules applied 21816 place count 894 transition count 2090
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 21 with 2 rules applied. Total rules applied 21818 place count 894 transition count 2185
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 21 with 82 rules applied. Total rules applied 21900 place count 892 transition count 2105
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 22 with 14 rules applied. Total rules applied 21914 place count 892 transition count 2091
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 21915 place count 892 transition count 2091
Applied a total of 21915 rules in 4902 ms. Remains 892 /11440 variables (removed 10548) and now considering 2091/17128 (removed 15037) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4904 ms. Remains : 892/11440 places, 2091/17128 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 6) seen :5
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 18:56:47] [INFO ] Flow matrix only has 1045 transitions (discarded 1046 similar events)
// Phase 1: matrix 1045 rows 892 cols
[2023-03-09 18:56:47] [INFO ] Computed 469 place invariants in 20 ms
[2023-03-09 18:56:47] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 18:56:47] [INFO ] [Nat]Absence check using 469 positive place invariants in 86 ms returned sat
[2023-03-09 18:56:48] [INFO ] After 440ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 18:56:48] [INFO ] State equation strengthened by 322 read => feed constraints.
[2023-03-09 18:56:48] [INFO ] After 254ms SMT Verify possible using 322 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 18:56:48] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 4 ms to minimize.
[2023-03-09 18:56:48] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2023-03-09 18:56:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 262 ms
[2023-03-09 18:56:48] [INFO ] After 640ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 145 ms.
[2023-03-09 18:56:48] [INFO ] After 1452ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 53 out of 892 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 892/892 places, 2091/2091 transitions.
Graph (trivial) has 248 edges and 892 vertex of which 25 / 892 are part of one of the 12 SCC in 1 ms
Free SCC test removed 13 places
Drop transitions removed 25 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 26 transitions.
Graph (complete) has 2820 edges and 879 vertex of which 791 are kept as prefixes of interest. Removing 88 places using SCC suffix rule.1 ms
Discarding 88 places :
Also discarding 116 output transitions
Drop transitions removed 116 transitions
Drop transitions removed 133 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 153 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 184 rules applied. Total rules applied 186 place count 791 transition count 1765
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 218 place count 760 transition count 1764
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 219 place count 759 transition count 1764
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 219 place count 759 transition count 1740
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 267 place count 735 transition count 1740
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 273 place count 735 transition count 1734
Discarding 68 places :
Symmetric choice reduction at 4 with 68 rule applications. Total rules 341 place count 667 transition count 1621
Iterating global reduction 4 with 68 rules applied. Total rules applied 409 place count 667 transition count 1621
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 415 place count 667 transition count 1615
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 415 place count 667 transition count 1614
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 417 place count 666 transition count 1614
Performed 42 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 84 rules applied. Total rules applied 501 place count 624 transition count 1568
Drop transitions removed 131 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 138 transitions.
Graph (complete) has 1961 edges and 624 vertex of which 603 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Discarding 21 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Iterating post reduction 5 with 139 rules applied. Total rules applied 640 place count 603 transition count 1411
Drop transitions removed 17 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 665 place count 603 transition count 1386
Discarding 57 places :
Symmetric choice reduction at 7 with 57 rule applications. Total rules 722 place count 546 transition count 1295
Iterating global reduction 7 with 57 rules applied. Total rules applied 779 place count 546 transition count 1295
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 793 place count 539 transition count 1322
Drop transitions removed 19 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 813 place count 539 transition count 1302
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 8 with 38 rules applied. Total rules applied 851 place count 539 transition count 1264
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 1758 edges and 538 vertex of which 533 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 8 with 2 rules applied. Total rules applied 853 place count 533 transition count 1262
Drop transitions removed 4 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 865 place count 533 transition count 1250
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 870 place count 528 transition count 1226
Iterating global reduction 10 with 5 rules applied. Total rules applied 875 place count 528 transition count 1226
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 10 with 17 rules applied. Total rules applied 892 place count 528 transition count 1209
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 894 place count 527 transition count 1215
Free-agglomeration rule applied 16 times.
Iterating global reduction 11 with 16 rules applied. Total rules applied 910 place count 527 transition count 1199
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 1653 edges and 511 vertex of which 490 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Discarding 21 places :
Also discarding 15 output transitions
Drop transitions removed 15 transitions
Iterating post reduction 11 with 38 rules applied. Total rules applied 948 place count 490 transition count 1163
Drop transitions removed 22 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 12 with 47 rules applied. Total rules applied 995 place count 490 transition count 1116
Discarding 17 places :
Symmetric choice reduction at 13 with 17 rule applications. Total rules 1012 place count 473 transition count 1084
Iterating global reduction 13 with 17 rules applied. Total rules applied 1029 place count 473 transition count 1084
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 1033 place count 471 transition count 1096
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 1034 place count 471 transition count 1095
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 13 with 4 rules applied. Total rules applied 1038 place count 471 transition count 1095
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 13 with 4 rules applied. Total rules applied 1042 place count 471 transition count 1091
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 1050 place count 467 transition count 1087
Applied a total of 1050 rules in 252 ms. Remains 467 /892 variables (removed 425) and now considering 1087/2091 (removed 1004) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 252 ms. Remains : 467/892 places, 1087/2091 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 487495 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :{}
Probabilistic random walk after 487495 steps, saw 424420 distinct states, run finished after 3004 ms. (steps per millisecond=162 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 18:56:52] [INFO ] Flow matrix only has 562 transitions (discarded 525 similar events)
// Phase 1: matrix 562 rows 467 cols
[2023-03-09 18:56:52] [INFO ] Computed 264 place invariants in 9 ms
[2023-03-09 18:56:52] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 18:56:52] [INFO ] [Nat]Absence check using 264 positive place invariants in 50 ms returned sat
[2023-03-09 18:56:52] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 18:56:52] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-09 18:56:52] [INFO ] After 135ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 18:56:53] [INFO ] After 251ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-09 18:56:53] [INFO ] After 708ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 53 out of 467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 1087/1087 transitions.
Applied a total of 0 rules in 19 ms. Remains 467 /467 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 467/467 places, 1087/1087 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 1087/1087 transitions.
Applied a total of 0 rules in 17 ms. Remains 467 /467 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
[2023-03-09 18:56:53] [INFO ] Flow matrix only has 562 transitions (discarded 525 similar events)
[2023-03-09 18:56:53] [INFO ] Invariant cache hit.
[2023-03-09 18:56:53] [INFO ] Implicit Places using invariants in 287 ms returned [95, 139, 291, 365, 404, 464, 465, 466]
Discarding 8 places :
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Implicit Place search using SMT only with invariants took 291 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 459/467 places, 1076/1087 transitions.
Graph (trivial) has 49 edges and 459 vertex of which 6 / 459 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 81 transitions
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 124 transitions.
Graph (complete) has 1379 edges and 454 vertex of which 446 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 8 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 17 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 18 rules applied. Total rules applied 20 place count 446 transition count 929
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 445 transition count 929
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 21 place count 445 transition count 928
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 23 place count 444 transition count 928
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 443 transition count 927
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 443 transition count 927
Performed 11 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 47 place count 432 transition count 907
Drop transitions removed 17 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 2 with 38 rules applied. Total rules applied 85 place count 432 transition count 869
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 95 place count 422 transition count 859
Iterating global reduction 3 with 10 rules applied. Total rules applied 105 place count 422 transition count 859
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 3 with 2 rules applied. Total rules applied 107 place count 421 transition count 858
Drop transitions removed 150 transitions
Redundant transition composition rules discarded 150 transitions
Iterating global reduction 3 with 150 rules applied. Total rules applied 257 place count 421 transition count 708
Reduce places removed 4 places and 0 transitions.
Graph (complete) has 1129 edges and 417 vertex of which 413 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 5 rules applied. Total rules applied 262 place count 413 transition count 708
Drop transitions removed 4 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 278 place count 413 transition count 692
Discarding 74 places :
Symmetric choice reduction at 5 with 74 rule applications. Total rules 352 place count 339 transition count 582
Iterating global reduction 5 with 74 rules applied. Total rules applied 426 place count 339 transition count 582
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 429 place count 339 transition count 582
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 430 place count 339 transition count 581
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 5 with 2 rules applied. Total rules applied 432 place count 338 transition count 580
Applied a total of 432 rules in 80 ms. Remains 338 /459 variables (removed 121) and now considering 580/1076 (removed 496) transitions.
[2023-03-09 18:56:53] [INFO ] Flow matrix only has 431 transitions (discarded 149 similar events)
// Phase 1: matrix 431 rows 338 cols
[2023-03-09 18:56:53] [INFO ] Computed 160 place invariants in 6 ms
[2023-03-09 18:56:53] [INFO ] Implicit Places using invariants in 169 ms returned [121]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 172 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 337/467 places, 580/1087 transitions.
Graph (trivial) has 25 edges and 337 vertex of which 2 / 337 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 29 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 36 transitions.
Graph (complete) has 944 edges and 336 vertex of which 312 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Drop transitions removed 12 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 312 transition count 508
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 43 place count 293 transition count 478
Iterating global reduction 1 with 19 rules applied. Total rules applied 62 place count 293 transition count 478
Applied a total of 62 rules in 12 ms. Remains 293 /337 variables (removed 44) and now considering 478/580 (removed 102) transitions.
[2023-03-09 18:56:53] [INFO ] Flow matrix only has 395 transitions (discarded 83 similar events)
// Phase 1: matrix 395 rows 293 cols
[2023-03-09 18:56:53] [INFO ] Computed 127 place invariants in 3 ms
[2023-03-09 18:56:53] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-09 18:56:53] [INFO ] Flow matrix only has 395 transitions (discarded 83 similar events)
[2023-03-09 18:56:53] [INFO ] Invariant cache hit.
[2023-03-09 18:56:53] [INFO ] State equation strengthened by 145 read => feed constraints.
[2023-03-09 18:56:54] [INFO ] Implicit Places using invariants and state equation in 482 ms returned [134]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 616 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 292/467 places, 478/1087 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 291 transition count 477
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 291 transition count 476
Applied a total of 3 rules in 13 ms. Remains 291 /292 variables (removed 1) and now considering 476/478 (removed 2) transitions.
[2023-03-09 18:56:54] [INFO ] Flow matrix only has 393 transitions (discarded 83 similar events)
// Phase 1: matrix 393 rows 291 cols
[2023-03-09 18:56:54] [INFO ] Computed 126 place invariants in 4 ms
[2023-03-09 18:56:54] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-09 18:56:54] [INFO ] Flow matrix only has 393 transitions (discarded 83 similar events)
[2023-03-09 18:56:54] [INFO ] Invariant cache hit.
[2023-03-09 18:56:54] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-09 18:56:54] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 291/467 places, 476/1087 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 1793 ms. Remains : 291/467 places, 476/1087 transitions.
Finished random walk after 6742 steps, including 2 resets, run visited all 1 properties in 48 ms. (steps per millisecond=140 )
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 46618 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DLCflexbar (PT), instance 4b
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: 11440 places, 17128 transitions, 46731 arcs.
Final Score: 1.7772837808E7
Took : 149 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: DLCflexbar-PT-4b-ReachabilityCardinality-00 (reachable &!potential( ( (tk(P10886)) <= (tk(P7446)) )))
PROPERTY: DLCflexbar-PT-4b-ReachabilityCardinality-01 (reachable & potential((! ( (! ( ( 1 ) <= (tk(P6663)) )) | ( (tk(P1384)) <= ( 0 ) ) ))))
PROPERTY: DLCflexbar-PT-4b-ReachabilityCardinality-02 (reachable &!potential( ( ( ( ( ( 1 ) <= (tk(P7745)) ) | ( (tk(P6877)) <= (tk(P4635)) ) ) | (! ( ( (tk(P4738)) <= ( 0 ) ) | ( (tk(P7540)) <= (tk(P10890)) ) )) ) | ( ( ( ( ( ( (tk(P6390)) <= ( 0 ) ) | ( ( (tk(P1608)) <= ( 1 ) ) | ( ( ( 1 ) <= (tk(P9361)) ) & ( ( (tk(P966)) <= (tk(P8291)) ) & ( ( 1 ) <= (tk(P5485)) ) ) ) ) ) & ( (tk(P4529)) <= ( 0 ) ) ) | ( ( (! ( ( (tk(P6263)) <= ( 1 ) ) & ( (tk(P7909)) <= ( 0 ) ) )) & ( (! ( (tk(P2473)) <= (tk(P6687)) )) | ( ( ( ( 1 ) <= (tk(P1016)) ) | ( ( 1 ) <= (tk(P11260)) ) ) | ( ( ( 1 ) <= (tk(P1286)) ) | ( (tk(P4240)) <= ( 1 ) ) ) ) ) ) | ( ( ( 1 ) <= (tk(P5198)) ) & ( ( ( ( (tk(P3543)) <= (tk(P1965)) ) & ( ( 1 ) <= (tk(P4853)) ) ) & ( ( (tk(P2346)) <= ( 0 ) ) & ( (tk(P5090)) <= ( 0 ) ) ) ) & ( ( ( ( 1 ) <= (tk(P683)) ) | ( ( 1 ) <= (tk(P7278)) ) ) | ( ( (tk(P9756)) <= (tk(P6660)) ) | ( ( 1 ) <= (tk(P2225)) ) ) ) ) ) ) ) & ( ( (! ( ( ( (tk(P2922)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P1652)) ) ) & ( (tk(P9427)) <= ( 1 ) ) )) | (! ( ( ( (tk(P7169)) <= ( 0 ) ) | ( ( (tk(P10715)) <= (tk(P1777)) ) & ( (tk(P9199)) <= (tk(P1899)) ) ) ) | ( ( ( ( 1 ) <= (tk(P2228)) ) | ( (tk(P5279)) <= ( 0 ) ) ) & ( ( ( 1 ) <= (tk(P7515)) ) & ( (tk(P466)) <= (tk(P1481)) ) ) ) )) ) | ( ( (tk(P4336)) <= ( 0 ) ) & ( ( ( 1 ) <= (tk(P8620)) ) | ( ( ( ( (tk(P5673)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P8186)) ) ) | ( ( 1 ) <= (tk(P5736)) ) ) & ( (! ( ( 1 ) <= (tk(P5234)) )) | (! ( ( 1 ) <= (tk(P9296)) )) ) ) ) ) ) ) & ( (! ( (! ( ( ( (tk(P11142)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P2501)) ) ) & ( ( (tk(P6100)) <= (tk(P10047)) ) | ( ( 1 ) <= (tk(P5967)) ) ) )) | ( (! ( (! ( ( 1 ) <= (tk(P4720)) )) | ( ( (tk(P6852)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P37)) ) ) )) & (! ( ( ( (tk(P4541)) <= ( 0 ) ) & ( (tk(P6016)) <= ( 1 ) ) ) & ( ( (tk(P570)) <= (tk(P4834)) ) | ( ( 1 ) <= (tk(P1045)) ) ) )) ) )) | ( ( 1 ) <= (tk(P698)) ) ) ) )))
PROPERTY: DLCflexbar-PT-4b-ReachabilityCardinality-03 (reachable & potential(( ( ( ( ( (tk(P2424)) <= (tk(P5190)) ) | ( (tk(P10453)) <= (tk(P1618)) ) ) & (! ( ( (! ( (! ( ( 1 ) <= (tk(P8813)) )) | ( ( (tk(P9964)) <= ( 1 ) ) | ( (tk(P7170)) <= ( 1 ) ) ) )) | ( ( ( ( (tk(P2796)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P6336)) ) ) & ( ( (tk(P1910)) <= (tk(P10106)) ) | ( (tk(P11247)) <= ( 0 ) ) ) ) & ( (tk(P9841)) <= ( 0 ) ) ) ) & ( ( ( ( ( 1 ) <= (tk(P2353)) ) & ( ( 1 ) <= (tk(P8258)) ) ) | ( (tk(P10783)) <= (tk(P3768)) ) ) | ( ( 1 ) <= (tk(P10147)) ) ) )) ) & ( ( ( (! ( ( 1 ) <= (tk(P848)) )) & ( (! ( (tk(P4182)) <= (tk(P9109)) )) | ( ( (! ( ( 1 ) <= (tk(P8340)) )) | ( ( ( 1 ) <= (tk(P8561)) ) | ( ( 1 ) <= (tk(P3194)) ) ) ) & ( ( ( 1 ) <= (tk(P4257)) ) | ( ( (tk(P10980)) <= ( 1 ) ) | ( (tk(P2246)) <= ( 0 ) ) ) ) ) ) ) | (! ( ( (tk(P9000)) <= (tk(P8364)) ) & ( ( 1 ) <= (tk(P8996)) ) )) ) & ( ( (tk(P11150)) <= ( 0 ) ) & (! ( ( (tk(P6350)) <= ( 0 ) ) | (! ( ( 1 ) <= (tk(P4079)) )) )) ) ) ) & ( (! ( ( (! ( ( ( ( 1 ) <= (tk(P4323)) ) & (! ( (tk(P9377)) <= (tk(P9767)) )) ) & ( (! ( (tk(P21)) <= (tk(P1590)) )) | ( ( (tk(P10054)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P6003)) ) ) ) )) & ( (! ( ( (tk(P4926)) <= (tk(P7759)) ) & ( (tk(P4260)) <= ( 0 ) ) )) | (! ( ( 1 ) <= (tk(P8025)) )) ) ) & ( ( ( 1 ) <= (tk(P520)) ) & ( (tk(P8543)) <= (tk(P3311)) ) ) )) | ( ( ( 1 ) <= (tk(P7729)) ) | (! ( (! ( (tk(P1758)) <= ( 1 ) )) | (! ( ( ( ( (tk(P11284)) <= ( 0 ) ) & ( (tk(P221)) <= ( 0 ) ) ) | (! ( (tk(P11264)) <= ( 0 ) )) ) | ( (tk(P7083)) <= (tk(P8029)) ) )) )) ) ) )))
PROPERTY: DLCflexbar-PT-4b-ReachabilityCardinality-04 (reachable & potential(( ( 1 ) <= (tk(P6051)) )))
PROPERTY: DLCflexbar-PT-4b-ReachabilityCardinality-05 (reachable & potential((! ( ( (tk(P9867)) <= (tk(P4645)) ) | (! ( ( 1 ) <= (tk(P9139)) )) ))))
PROPERTY: DLCflexbar-PT-4b-ReachabilityCardinality-06 (reachable & potential(( ( 1 ) <= (tk(P5209)) )))
PROPERTY: DLCflexbar-PT-4b-ReachabilityCardinality-07 (reachable & potential(( ( 1 ) <= (tk(P8080)) )))
PROPERTY: DLCflexbar-PT-4b-ReachabilityCardinality-08 (reachable &!potential( ( ( ( ( (! ( (! ( ( 1 ) <= (tk(P2403)) )) | ( ( (! ( (tk(P5031)) <= (tk(P1022)) )) & ( ( (tk(P7089)) <= (tk(P10287)) ) | ( ( 1 ) <= (tk(P10516)) ) ) ) & ( ( (tk(P2839)) <= (tk(P8471)) ) | (! ( (tk(P6451)) <= ( 1 ) )) ) ) )) & ( (tk(P9153)) <= ( 0 ) ) ) & ( (! ( (! ( (tk(P7654)) <= ( 0 ) )) & ( ( 1 ) <= (tk(P6054)) ) )) | ( ( (! ( (tk(P1466)) <= ( 1 ) )) | ( ( 1 ) <= (tk(P7627)) ) ) & (! ( (! ( (tk(P10044)) <= (tk(P9744)) )) | (! ( (tk(P8368)) <= ( 0 ) )) )) ) ) ) & ( ( (tk(P8973)) <= ( 1 ) ) | (! ( (tk(P8416)) <= ( 0 ) )) ) ) | (! ( ( ( ( ( ( ( ( (tk(P5094)) <= (tk(P11252)) ) & ( (tk(P10484)) <= (tk(P8201)) ) ) | ( (tk(P11131)) <= ( 0 ) ) ) | ( ( ( (tk(P1812)) <= (tk(P4704)) ) | ( (tk(P995)) <= (tk(P554)) ) ) & (! ( ( 1 ) <= (tk(P10517)) )) ) ) & ( (! ( (tk(P6625)) <= (tk(P9279)) )) & (! ( (tk(P10219)) <= ( 0 ) )) ) ) & ( ( ( 1 ) <= (tk(P5224)) ) | ( (tk(P8447)) <= ( 0 ) ) ) ) & ( ( ( (! ( ( (tk(P5996)) <= ( 1 ) ) & ( (tk(P8394)) <= (tk(P1746)) ) )) & ( ( ( (tk(P2869)) <= (tk(P2558)) ) | ( (tk(P4607)) <= ( 0 ) ) ) & ( ( (tk(P7782)) <= ( 0 ) ) | ( (tk(P10595)) <= ( 1 ) ) ) ) ) | ( ( 1 ) <= (tk(P7980)) ) ) & ( (! ( ( ( 1 ) <= (tk(P10868)) ) & ( (tk(P3023)) <= ( 1 ) ) )) | ( ( ( ( (tk(P8848)) <= (tk(P2728)) ) & ( (tk(P8202)) <= ( 1 ) ) ) & (! ( (tk(P8040)) <= ( 0 ) )) ) & ( ( ( 1 ) <= (tk(P1927)) ) & (! ( ( 1 ) <= (tk(P9139)) )) ) ) ) ) ) & ( (! ( ( ( ( ( ( 1 ) <= (tk(P4823)) ) | ( ( 1 ) <= (tk(P2878)) ) ) & (! ( (tk(P3053)) <= (tk(P2455)) )) ) & ( ( ( ( 1 ) <= (tk(P7129)) ) | ( (tk(P8487)) <= ( 1 ) ) ) | ( (tk(P954)) <= (tk(P9349)) ) ) ) | ( ( ( 1 ) <= (tk(P9397)) ) | (! ( (tk(P2770)) <= (tk(P5077)) )) ) )) | ( ( (tk(P7570)) <= (tk(P8492)) ) & ( (tk(P5058)) <= (tk(P2883)) ) ) ) )) )))
PROPERTY: DLCflexbar-PT-4b-ReachabilityCardinality-09 (reachable &!potential( ( (! ( ( 1 ) <= (tk(P4534)) )) | ( ( ( ( (! ( ( (! ( ( 1 ) <= (tk(P5098)) )) | (! ( (tk(P8904)) <= (tk(P6088)) )) ) & (! ( ( (tk(P8396)) <= (tk(P10674)) ) & ( ( 1 ) <= (tk(P9786)) ) )) )) & ( (tk(P3924)) <= (tk(P6159)) ) ) & ( ( ( (tk(P2756)) <= (tk(P816)) ) & ( ( 1 ) <= (tk(P3703)) ) ) & ( (tk(P1872)) <= ( 0 ) ) ) ) | ( (! ( ( 1 ) <= (tk(P7632)) )) | ( (tk(P3208)) <= ( 0 ) ) ) ) & ( (tk(P798)) <= ( 1 ) ) ) )))
PROPERTY: DLCflexbar-PT-4b-ReachabilityCardinality-10 (reachable &!potential( ( (! ( ( (! ( ( ( (tk(P3415)) <= ( 0 ) ) & ( ( (tk(P53)) <= (tk(P5222)) ) & ( (tk(P6128)) <= (tk(P10053)) ) ) ) & ( ( ( ( 1 ) <= (tk(P6931)) ) | ( (tk(P1695)) <= (tk(P10216)) ) ) & (! ( (tk(P6771)) <= ( 0 ) )) ) )) & ( ( ( (tk(P1225)) <= ( 0 ) ) | ( ( ( (tk(P9424)) <= ( 1 ) ) & ( (tk(P6054)) <= ( 1 ) ) ) & ( (tk(P5991)) <= (tk(P4134)) ) ) ) | ( (! ( ( ( 1 ) <= (tk(P9118)) ) & ( (tk(P5958)) <= (tk(P3959)) ) )) & (! ( ( 1 ) <= (tk(P7907)) )) ) ) ) | (! ( ( ( ( ( (tk(P850)) <= (tk(P30)) ) | ( (tk(P4392)) <= ( 1 ) ) ) | ( (tk(P9436)) <= ( 1 ) ) ) & ( ( ( (tk(P3210)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P10000)) ) ) & ( ( 1 ) <= (tk(P5658)) ) ) ) & ( ( ( ( (tk(P3233)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P9687)) ) ) & (! ( (tk(P4732)) <= ( 1 ) )) ) | ( (! ( (tk(P2095)) <= (tk(P5725)) )) & ( ( (tk(P848)) <= ( 1 ) ) | ( (tk(P9527)) <= (tk(P829)) ) ) ) ) )) )) | ( (tk(P11432)) <= ( 0 ) ) )))
PROPERTY: DLCflexbar-PT-4b-ReachabilityCardinality-11 (reachable & potential((! ( (tk(P1794)) <= ( 0 ) ))))
PROPERTY: DLCflexbar-PT-4b-ReachabilityCardinality-12 (reachable &!potential( ( (tk(P4922)) <= (tk(P5235)) )))
PROPERTY: DLCflexbar-PT-4b-ReachabilityCardinality-13 (reachable & potential(( ( 1 ) <= (tk(P8560)) )))
PROPERTY: DLCflexbar-PT-4b-ReachabilityCardinality-14 (reachable &!potential( (! ( (! ( ( ( (tk(P4320)) <= (tk(P6454)) ) & ( ( ( 1 ) <= (tk(P10593)) ) | ( ( ( ( 1 ) <= (tk(P6490)) ) | ( (tk(P119)) <= (tk(P4405)) ) ) & ( ( 1 ) <= (tk(P10988)) ) ) ) ) | ( ( ( ( ( (tk(P573)) <= ( 0 ) ) & ( (tk(P4774)) <= (tk(P1997)) ) ) | ( (tk(P1704)) <= (tk(P2403)) ) ) & ( ( ( ( 1 ) <= (tk(P21)) ) & ( (tk(P8656)) <= (tk(P1488)) ) ) & ( ( ( 1 ) <= (tk(P5510)) ) & ( ( 1 ) <= (tk(P8449)) ) ) ) ) & (! ( ( 1 ) <= (tk(P5100)) )) ) )) & ( ( 1 ) <= (tk(P9425)) ) ))))
PROPERTY: DLCflexbar-PT-4b-ReachabilityCardinality-15 (reachable &!potential( ( ( (tk(P7156)) <= (tk(P1651)) ) & ( ( (! ( ( ( 1 ) <= (tk(P5136)) ) & ( ( ( ( (tk(P4055)) <= (tk(P7777)) ) & ( ( (tk(P3465)) <= (tk(P10938)) ) | ( ( 1 ) <= (tk(P8533)) ) ) ) & ( (! ( (tk(P3456)) <= ( 0 ) )) | ( ( (tk(P7744)) <= (tk(P9820)) ) | ( ( 1 ) <= (tk(P1108)) ) ) ) ) & ( (tk(P8387)) <= (tk(P6085)) ) ) )) & ( ( (! ( ( ( 1 ) <= (tk(P10484)) ) & (! ( (tk(P9089)) <= (tk(P4963)) )) )) | (! ( ( ( 1 ) <= (tk(P9712)) ) & ( (! ( (tk(P3679)) <= (tk(P9853)) )) & ( ( (tk(P3345)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P2456)) ) ) ) )) ) | ( (! ( (tk(P7289)) <= ( 0 ) )) | ( (! ( ( ( 1 ) <= (tk(P6125)) ) | ( ( (tk(P7602)) <= (tk(P5609)) ) | ( ( 1 ) <= (tk(P8801)) ) ) )) & ( ( ( ( (tk(P2099)) <= (tk(P669)) ) | ( (tk(P6279)) <= ( 0 ) ) ) | ( ( (tk(P2864)) <= (tk(P6708)) ) & ( ( 1 ) <= (tk(P7721)) ) ) ) | (! ( ( ( 1 ) <= (tk(P107)) ) & ( (tk(P6782)) <= ( 0 ) ) )) ) ) ) ) ) | (! ( (! ( (! ( (tk(P1421)) <= (tk(P1356)) )) | ( ( (tk(P6355)) <= (tk(P7115)) ) & ( (tk(P4980)) <= (tk(P2622)) ) ) )) | ( (tk(P5361)) <= ( 0 ) ) )) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15339264 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16097660 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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="DLCflexbar-PT-4b"
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 DLCflexbar-PT-4b, 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 r107-tall-167814484400550"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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