fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r169-tall-167838856000526
Last Updated
May 14, 2023

About the Execution of LTSMin+red for FlexibleBarrier-PT-14a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1027.871 305740.00 1202805.00 388.30 FFFFTFTFTTTFFFFF normal

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-167838856000526.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-14a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838856000526
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.7K Feb 25 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 12:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 12:48 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.7K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 13:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Feb 25 13:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 13:09 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 169K 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-14a-ReachabilityCardinality-00
FORMULA_NAME FlexibleBarrier-PT-14a-ReachabilityCardinality-01
FORMULA_NAME FlexibleBarrier-PT-14a-ReachabilityCardinality-02
FORMULA_NAME FlexibleBarrier-PT-14a-ReachabilityCardinality-03
FORMULA_NAME FlexibleBarrier-PT-14a-ReachabilityCardinality-04
FORMULA_NAME FlexibleBarrier-PT-14a-ReachabilityCardinality-05
FORMULA_NAME FlexibleBarrier-PT-14a-ReachabilityCardinality-06
FORMULA_NAME FlexibleBarrier-PT-14a-ReachabilityCardinality-07
FORMULA_NAME FlexibleBarrier-PT-14a-ReachabilityCardinality-08
FORMULA_NAME FlexibleBarrier-PT-14a-ReachabilityCardinality-09
FORMULA_NAME FlexibleBarrier-PT-14a-ReachabilityCardinality-10
FORMULA_NAME FlexibleBarrier-PT-14a-ReachabilityCardinality-11
FORMULA_NAME FlexibleBarrier-PT-14a-ReachabilityCardinality-12
FORMULA_NAME FlexibleBarrier-PT-14a-ReachabilityCardinality-13
FORMULA_NAME FlexibleBarrier-PT-14a-ReachabilityCardinality-14
FORMULA_NAME FlexibleBarrier-PT-14a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678561128183

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-14a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 18:58:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 18:58:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 18:58:49] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2023-03-11 18:58:49] [INFO ] Transformed 171 places.
[2023-03-11 18:58:49] [INFO ] Transformed 578 transitions.
[2023-03-11 18:58:49] [INFO ] Found NUPN structural information;
[2023-03-11 18:58:49] [INFO ] Parsed PT model containing 171 places and 578 transitions and 2719 arcs in 324 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 170 transitions
Reduce redundant transitions removed 170 transitions.
FORMULA FlexibleBarrier-PT-14a-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 12) seen :10
FORMULA FlexibleBarrier-PT-14a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14a-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14a-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14a-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14a-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14a-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 18:58:50] [INFO ] Flow matrix only has 394 transitions (discarded 14 similar events)
// Phase 1: matrix 394 rows 171 cols
[2023-03-11 18:58:50] [INFO ] Computed 16 place invariants in 14 ms
[2023-03-11 18:58:50] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 18:58:50] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2023-03-11 18:58:50] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-11 18:58:50] [INFO ] State equation strengthened by 253 read => feed constraints.
[2023-03-11 18:58:50] [INFO ] After 47ms SMT Verify possible using 253 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-11 18:58:50] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-11 18:58:50] [INFO ] After 336ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA FlexibleBarrier-PT-14a-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 20 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 408/408 transitions.
Graph (trivial) has 107 edges and 171 vertex of which 27 / 171 are part of one of the 9 SCC in 2 ms
Free SCC test removed 18 places
Drop transitions removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 0 with 64 rules applied. Total rules applied 65 place count 121 transition count 276
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 77 place count 121 transition count 264
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 86 place count 112 transition count 255
Iterating global reduction 1 with 9 rules applied. Total rules applied 95 place count 112 transition count 255
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 111 transition count 255
Drop transitions removed 91 transitions
Redundant transition composition rules discarded 91 transitions
Iterating global reduction 1 with 91 rules applied. Total rules applied 188 place count 111 transition count 164
Graph (complete) has 288 edges and 111 vertex of which 87 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 189 place count 87 transition count 156
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 213 place count 87 transition count 132
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 213 place count 87 transition count 129
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 219 place count 84 transition count 129
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 223 place count 84 transition count 125
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 227 place count 80 transition count 125
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 236 place count 80 transition count 125
Applied a total of 236 rules in 72 ms. Remains 80 /171 variables (removed 91) and now considering 125/408 (removed 283) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 80/171 places, 125/408 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2336274 steps, run timeout after 3001 ms. (steps per millisecond=778 ) properties seen :{}
Probabilistic random walk after 2336274 steps, saw 1355380 distinct states, run finished after 3002 ms. (steps per millisecond=778 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 125 rows 80 cols
[2023-03-11 18:58:54] [INFO ] Computed 12 place invariants in 4 ms
[2023-03-11 18:58:54] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 18:58:54] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-11 18:58:54] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 18:58:54] [INFO ] State equation strengthened by 88 read => feed constraints.
[2023-03-11 18:58:54] [INFO ] After 20ms SMT Verify possible using 88 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 18:58:54] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-11 18:58:54] [INFO ] After 150ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 19 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 125/125 transitions.
Applied a total of 0 rules in 17 ms. Remains 80 /80 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 80/80 places, 125/125 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 125/125 transitions.
Applied a total of 0 rules in 6 ms. Remains 80 /80 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-11 18:58:54] [INFO ] Invariant cache hit.
[2023-03-11 18:58:54] [INFO ] Implicit Places using invariants in 130 ms returned [78, 79]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 133 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 78/80 places, 125/125 transitions.
Graph (trivial) has 53 edges and 78 vertex of which 19 / 78 are part of one of the 8 SCC in 0 ms
Free SCC test removed 11 places
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 67 transition count 94
Reduce places removed 11 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 19 rules applied. Total rules applied 31 place count 56 transition count 86
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 12 rules applied. Total rules applied 43 place count 48 transition count 82
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 45 place count 46 transition count 82
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 46 place count 45 transition count 80
Iterating global reduction 4 with 1 rules applied. Total rules applied 47 place count 45 transition count 80
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 53 place count 42 transition count 77
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 56 place count 42 transition count 74
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 59 place count 42 transition count 71
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 61 place count 42 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 63 place count 40 transition count 69
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 64 place count 40 transition count 69
Applied a total of 64 rules in 30 ms. Remains 40 /78 variables (removed 38) and now considering 69/125 (removed 56) transitions.
// Phase 1: matrix 69 rows 40 cols
[2023-03-11 18:58:54] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-11 18:58:54] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-11 18:58:54] [INFO ] Invariant cache hit.
[2023-03-11 18:58:54] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 40/80 places, 69/125 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 241 ms. Remains : 40/80 places, 69/125 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 61452 steps, run visited all 1 properties in 65 ms. (steps per millisecond=945 )
Probabilistic random walk after 61452 steps, saw 30338 distinct states, run finished after 66 ms. (steps per millisecond=931 ) properties seen :1
FORMULA FlexibleBarrier-PT-14a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 5042 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/471/inv_0_ --invariant=/tmp/471/inv_1_ --invariant=/tmp/471/inv_2_ --invariant=/tmp/471/inv_3_ --invariant=/tmp/471/inv_4_ --invariant=/tmp/471/inv_5_ --invariant=/tmp/471/inv_6_ --invariant=/tmp/471/inv_7_ --invariant=/tmp/471/inv_8_ --invariant=/tmp/471/inv_9_ --invariant=/tmp/471/inv_10_ --invariant=/tmp/471/inv_11_ --invariant=/tmp/471/inv_12_ --invariant=/tmp/471/inv_13_ --invariant=/tmp/471/inv_14_ --invariant=/tmp/471/inv_15_ --inv-par
FORMULA FlexibleBarrier-PT-14a-ReachabilityCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-14a-ReachabilityCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-14a-ReachabilityCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-14a-ReachabilityCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-14a-ReachabilityCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-14a-ReachabilityCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-14a-ReachabilityCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-14a-ReachabilityCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-14a-ReachabilityCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-14a-ReachabilityCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-14a-ReachabilityCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-14a-ReachabilityCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-14a-ReachabilityCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-14a-ReachabilityCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-14a-ReachabilityCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-14a-ReachabilityCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678561433923

--------------------
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-14a-ReachabilityCardinality-00
rfs formula type AG
rfs formula formula --invariant=/tmp/471/inv_0_
rfs formula name FlexibleBarrier-PT-14a-ReachabilityCardinality-01
rfs formula type AG
rfs formula formula --invariant=/tmp/471/inv_1_
rfs formula name FlexibleBarrier-PT-14a-ReachabilityCardinality-02
rfs formula type EF
rfs formula formula --invariant=/tmp/471/inv_2_
rfs formula name FlexibleBarrier-PT-14a-ReachabilityCardinality-03
rfs formula type AG
rfs formula formula --invariant=/tmp/471/inv_3_
rfs formula name FlexibleBarrier-PT-14a-ReachabilityCardinality-04
rfs formula type EF
rfs formula formula --invariant=/tmp/471/inv_4_
rfs formula name FlexibleBarrier-PT-14a-ReachabilityCardinality-05
rfs formula type EF
rfs formula formula --invariant=/tmp/471/inv_5_
rfs formula name FlexibleBarrier-PT-14a-ReachabilityCardinality-06
rfs formula type EF
rfs formula formula --invariant=/tmp/471/inv_6_
rfs formula name FlexibleBarrier-PT-14a-ReachabilityCardinality-07
rfs formula type AG
rfs formula formula --invariant=/tmp/471/inv_7_
rfs formula name FlexibleBarrier-PT-14a-ReachabilityCardinality-08
rfs formula type EF
rfs formula formula --invariant=/tmp/471/inv_8_
rfs formula name FlexibleBarrier-PT-14a-ReachabilityCardinality-09
rfs formula type EF
rfs formula formula --invariant=/tmp/471/inv_9_
rfs formula name FlexibleBarrier-PT-14a-ReachabilityCardinality-10
rfs formula type AG
rfs formula formula --invariant=/tmp/471/inv_10_
rfs formula name FlexibleBarrier-PT-14a-ReachabilityCardinality-11
rfs formula type AG
rfs formula formula --invariant=/tmp/471/inv_11_
rfs formula name FlexibleBarrier-PT-14a-ReachabilityCardinality-12
rfs formula type EF
rfs formula formula --invariant=/tmp/471/inv_12_
rfs formula name FlexibleBarrier-PT-14a-ReachabilityCardinality-13
rfs formula type AG
rfs formula formula --invariant=/tmp/471/inv_13_
rfs formula name FlexibleBarrier-PT-14a-ReachabilityCardinality-14
rfs formula type AG
rfs formula formula --invariant=/tmp/471/inv_14_
rfs formula name FlexibleBarrier-PT-14a-ReachabilityCardinality-15
rfs formula type EF
rfs formula formula --invariant=/tmp/471/inv_15_
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 171 places, 578 transitions and 2719 arcs
pnml2lts-sym: Petri net FlexibleBarrier-PT-14a analyzed
pnml2lts-sym: There are 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: 578->381 groups
pnml2lts-sym: Regrouping took 0.160 real 0.160 user 0.000 sys
pnml2lts-sym: state vector length is 171; there are 381 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:
pnml2lts-sym: Invariant violation (/tmp/471/inv_3_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_4_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_7_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_6_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_14_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_13_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_8_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_9_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_11_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 19812185 group checks and 0 next state calls
pnml2lts-sym: reachability took 297.690 real 1186.120 user 3.320 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.100 real 0.390 user 0.000 sys
pnml2lts-sym: state space has 1.28391846454886e+15 states, 282667 nodes
pnml2lts-sym: group_next: 2894 nodes total
pnml2lts-sym: group_explored: 1804 nodes, 1367 short vectors total
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-14a"
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-14a, 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-167838856000526"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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