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.r169-tall-167838855900486.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 ltsminxred
Input is FlexibleBarrier-PT-08b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855900486
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 12:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 12:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 12:28 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.9K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 12:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 12:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 12:29 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 241K 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-08b-ReachabilityCardinality-00
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-01
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-02
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-03
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-04
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-05
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-06
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-07
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-08
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-09
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-10
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-11
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-12
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-13
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-14
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678553708035

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-08b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 16:55:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 16:55:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 16:55:09] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2023-03-11 16:55:09] [INFO ] Transformed 920 places.
[2023-03-11 16:55:09] [INFO ] Transformed 1057 transitions.
[2023-03-11 16:55:09] [INFO ] Found NUPN structural information;
[2023-03-11 16:55:09] [INFO ] Parsed PT model containing 920 places and 1057 transitions and 2627 arcs in 158 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 161 resets, run finished after 623 ms. (steps per millisecond=16 ) properties (out of 14) seen :3
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 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 20 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 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 18 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :1
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 10 properties.
// Phase 1: matrix 1057 rows 920 cols
[2023-03-11 16:55:11] [INFO ] Computed 10 place invariants in 27 ms
[2023-03-11 16:55:11] [INFO ] After 554ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-11 16:55:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 65 ms returned sat
[2023-03-11 16:55:13] [INFO ] After 764ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2023-03-11 16:55:13] [INFO ] Deduced a trap composed of 52 places in 231 ms of which 7 ms to minimize.
[2023-03-11 16:55:13] [INFO ] Deduced a trap composed of 163 places in 114 ms of which 1 ms to minimize.
[2023-03-11 16:55:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 478 ms
[2023-03-11 16:55:13] [INFO ] Deduced a trap composed of 283 places in 176 ms of which 1 ms to minimize.
[2023-03-11 16:55:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2023-03-11 16:55:14] [INFO ] Deduced a trap composed of 313 places in 224 ms of which 2 ms to minimize.
[2023-03-11 16:55:14] [INFO ] Deduced a trap composed of 343 places in 183 ms of which 2 ms to minimize.
[2023-03-11 16:55:14] [INFO ] Deduced a trap composed of 281 places in 166 ms of which 1 ms to minimize.
[2023-03-11 16:55:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 757 ms
[2023-03-11 16:55:15] [INFO ] Deduced a trap composed of 316 places in 224 ms of which 1 ms to minimize.
[2023-03-11 16:55:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 312 ms
[2023-03-11 16:55:15] [INFO ] After 3142ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 425 ms.
[2023-03-11 16:55:15] [INFO ] After 4151ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 8 different solutions.
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 62 ms.
Support contains 87 out of 920 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 920/920 places, 1057/1057 transitions.
Graph (trivial) has 739 edges and 920 vertex of which 32 / 920 are part of one of the 5 SCC in 5 ms
Free SCC test removed 27 places
Drop transitions removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions removed 190 transitions
Trivial Post-agglo rules discarded 190 transitions
Performed 190 trivial Post agglomeration. Transition count delta: 190
Iterating post reduction 0 with 190 rules applied. Total rules applied 191 place count 893 transition count 834
Reduce places removed 190 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 1 with 211 rules applied. Total rules applied 402 place count 703 transition count 813
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 423 place count 682 transition count 813
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 423 place count 682 transition count 773
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 503 place count 642 transition count 773
Discarding 265 places :
Symmetric choice reduction at 3 with 265 rule applications. Total rules 768 place count 377 transition count 508
Iterating global reduction 3 with 265 rules applied. Total rules applied 1033 place count 377 transition count 508
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1033 place count 377 transition count 505
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1039 place count 374 transition count 505
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 1067 place count 346 transition count 477
Iterating global reduction 3 with 28 rules applied. Total rules applied 1095 place count 346 transition count 477
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 1114 place count 346 transition count 458
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 1196 place count 305 transition count 417
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1200 place count 305 transition count 413
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
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 1208 place count 301 transition count 450
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 1212 place count 301 transition count 446
Free-agglomeration rule applied 110 times.
Iterating global reduction 5 with 110 rules applied. Total rules applied 1322 place count 301 transition count 336
Reduce places removed 110 places and 0 transitions.
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 122 rules applied. Total rules applied 1444 place count 191 transition count 324
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 1455 place count 191 transition count 313
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1456 place count 191 transition count 312
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1457 place count 190 transition count 312
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 1459 place count 190 transition count 312
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1462 place count 190 transition count 312
Applied a total of 1462 rules in 285 ms. Remains 190 /920 variables (removed 730) and now considering 312/1057 (removed 745) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 287 ms. Remains : 190/920 places, 312/1057 transitions.
Incomplete random walk after 10000 steps, including 238 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 6) seen :2
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :1
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 16:55:16] [INFO ] Flow matrix only has 302 transitions (discarded 10 similar events)
// Phase 1: matrix 302 rows 190 cols
[2023-03-11 16:55:16] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-11 16:55:16] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 16:55:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-11 16:55:16] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 16:55:16] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-11 16:55:16] [INFO ] After 76ms SMT Verify possible using 79 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 16:55:16] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2023-03-11 16:55:16] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2023-03-11 16:55:16] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 0 ms to minimize.
[2023-03-11 16:55:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 247 ms
[2023-03-11 16:55:17] [INFO ] After 414ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-11 16:55:17] [INFO ] After 673ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 5 ms.
Support contains 72 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 312/312 transitions.
Graph (trivial) has 33 edges and 190 vertex of which 2 / 190 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 189 transition count 304
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 183 transition count 304
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 181 transition count 302
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 181 transition count 302
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 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 33 place count 173 transition count 294
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 41 place count 173 transition count 286
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 45 place count 169 transition count 280
Iterating global reduction 3 with 4 rules applied. Total rules applied 49 place count 169 transition count 280
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 169 transition count 279
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 63 place count 169 transition count 266
Free-agglomeration rule applied 13 times.
Iterating global reduction 4 with 13 rules applied. Total rules applied 76 place count 169 transition count 253
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 89 place count 156 transition count 253
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 94 place count 156 transition count 248
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 95 place count 156 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 96 place count 155 transition count 247
Applied a total of 96 rules in 54 ms. Remains 155 /190 variables (removed 35) and now considering 247/312 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 155/190 places, 247/312 transitions.
Incomplete random walk after 10000 steps, including 227 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 868865 steps, run timeout after 3001 ms. (steps per millisecond=289 ) properties seen :{}
Probabilistic random walk after 868865 steps, saw 194832 distinct states, run finished after 3002 ms. (steps per millisecond=289 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 16:55:20] [INFO ] Flow matrix only has 241 transitions (discarded 6 similar events)
// Phase 1: matrix 241 rows 155 cols
[2023-03-11 16:55:20] [INFO ] Computed 10 place invariants in 5 ms
[2023-03-11 16:55:20] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 16:55:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-11 16:55:20] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 16:55:20] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-11 16:55:20] [INFO ] After 61ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 16:55:20] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 0 ms to minimize.
[2023-03-11 16:55:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-03-11 16:55:20] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 0 ms to minimize.
[2023-03-11 16:55:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-11 16:55:20] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2023-03-11 16:55:20] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2023-03-11 16:55:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 138 ms
[2023-03-11 16:55:20] [INFO ] After 395ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-11 16:55:21] [INFO ] After 599ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 11 ms.
Support contains 72 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 247/247 transitions.
Applied a total of 0 rules in 8 ms. Remains 155 /155 variables (removed 0) and now considering 247/247 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 155/155 places, 247/247 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 247/247 transitions.
Applied a total of 0 rules in 7 ms. Remains 155 /155 variables (removed 0) and now considering 247/247 (removed 0) transitions.
[2023-03-11 16:55:21] [INFO ] Flow matrix only has 241 transitions (discarded 6 similar events)
[2023-03-11 16:55:21] [INFO ] Invariant cache hit.
[2023-03-11 16:55:21] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-11 16:55:21] [INFO ] Flow matrix only has 241 transitions (discarded 6 similar events)
[2023-03-11 16:55:21] [INFO ] Invariant cache hit.
[2023-03-11 16:55:21] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-11 16:55:21] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2023-03-11 16:55:21] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-11 16:55:21] [INFO ] Flow matrix only has 241 transitions (discarded 6 similar events)
[2023-03-11 16:55:21] [INFO ] Invariant cache hit.
[2023-03-11 16:55:21] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 312 ms. Remains : 155/155 places, 247/247 transitions.
Graph (trivial) has 58 edges and 155 vertex of which 14 / 155 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Drop transitions removed 18 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 20 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 148 transition count 220
Reduce places removed 7 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 141 transition count 215
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 27 place count 136 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 28 place count 135 transition count 213
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 28 place count 135 transition count 211
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 32 place count 133 transition count 211
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 34 place count 131 transition count 207
Iterating global reduction 4 with 2 rules applied. Total rules applied 36 place count 131 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 37 place count 131 transition count 206
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 49 place count 125 transition count 200
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 5 with 4 rules applied. Total rules applied 53 place count 123 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 54 place count 123 transition count 200
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 6 with 17 rules applied. Total rules applied 71 place count 123 transition count 183
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 75 place count 123 transition count 179
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 79 place count 119 transition count 179
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 80 place count 119 transition count 178
Applied a total of 80 rules in 31 ms. Remains 119 /155 variables (removed 36) and now considering 178/247 (removed 69) transitions.
Running SMT prover for 3 properties.
[2023-03-11 16:55:21] [INFO ] Flow matrix only has 174 transitions (discarded 4 similar events)
// Phase 1: matrix 174 rows 119 cols
[2023-03-11 16:55:21] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-11 16:55:21] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 16:55:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-11 16:55:21] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 16:55:21] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-11 16:55:21] [INFO ] After 227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-11 16:55:21] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-11 16:55:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 155 places, 247 transitions and 892 arcs took 2 ms.
[2023-03-11 16:55:21] [INFO ] Flatten gal took : 38 ms
Total runtime 12291 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/538/inv_0_ --invariant=/tmp/538/inv_1_ --invariant=/tmp/538/inv_2_ --inv-par
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678556841887

--------------------
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
mcc2023
rfs formula name FlexibleBarrier-PT-08b-ReachabilityCardinality-06
rfs formula type EF
rfs formula formula --invariant=/tmp/538/inv_0_
rfs formula name FlexibleBarrier-PT-08b-ReachabilityCardinality-09
rfs formula type EF
rfs formula formula --invariant=/tmp/538/inv_1_
rfs formula name FlexibleBarrier-PT-08b-ReachabilityCardinality-14
rfs formula type AG
rfs formula formula --invariant=/tmp/538/inv_2_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 155 places, 247 transitions and 892 arcs
pnml2lts-sym: Petri net FlexibleBarrier_PT_08b analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 247->208 groups
pnml2lts-sym: Regrouping took 0.040 real 0.040 user 0.010 sys
pnml2lts-sym: state vector length is 155; there are 208 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/538/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/538/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/538/inv_2_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 3117.820 real 12456.640 user 5.140 sys
pnml2lts-sym: max token count: 1

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-08b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is FlexibleBarrier-PT-08b, 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 r169-tall-167838855900486"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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