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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 6.9K Feb 25 12:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 12:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 12:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 25 12:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 12:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 25 12:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 374K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-00
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-01
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-02
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-03
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-04
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-05
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-06
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-07
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-08
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-09
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-10
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-11
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-12
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-13
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-14
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678556046992

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-10b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 17:34:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 17:34:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 17:34:08] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2023-03-11 17:34:08] [INFO ] Transformed 1402 places.
[2023-03-11 17:34:08] [INFO ] Transformed 1613 transitions.
[2023-03-11 17:34:08] [INFO ] Found NUPN structural information;
[2023-03-11 17:34:08] [INFO ] Parsed PT model containing 1402 places and 1613 transitions and 4025 arcs in 282 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-10b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 133 resets, run finished after 521 ms. (steps per millisecond=19 ) properties (out of 10) seen :1
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :1
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1613 rows 1402 cols
[2023-03-11 17:34:09] [INFO ] Computed 12 place invariants in 35 ms
[2023-03-11 17:34:10] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2023-03-11 17:34:10] [INFO ] After 666ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 17:34:11] [INFO ] [Nat]Absence check using 12 positive place invariants in 17 ms returned sat
[2023-03-11 17:34:12] [INFO ] After 1071ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-11 17:34:12] [INFO ] Deduced a trap composed of 62 places in 419 ms of which 8 ms to minimize.
[2023-03-11 17:34:13] [INFO ] Deduced a trap composed of 478 places in 337 ms of which 1 ms to minimize.
[2023-03-11 17:34:13] [INFO ] Deduced a trap composed of 443 places in 313 ms of which 1 ms to minimize.
[2023-03-11 17:34:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1299 ms
[2023-03-11 17:34:14] [INFO ] Deduced a trap composed of 62 places in 249 ms of which 2 ms to minimize.
[2023-03-11 17:34:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 370 ms
[2023-03-11 17:34:15] [INFO ] Deduced a trap composed of 481 places in 471 ms of which 1 ms to minimize.
[2023-03-11 17:34:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 593 ms
[2023-03-11 17:34:15] [INFO ] After 4017ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 480 ms.
[2023-03-11 17:34:15] [INFO ] After 5158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 80 ms.
Support contains 8 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1613/1613 transitions.
Graph (trivial) has 1359 edges and 1402 vertex of which 62 / 1402 are part of one of the 10 SCC in 7 ms
Free SCC test removed 52 places
Drop transitions removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Drop transitions removed 354 transitions
Trivial Post-agglo rules discarded 354 transitions
Performed 354 trivial Post agglomeration. Transition count delta: 354
Iterating post reduction 0 with 354 rules applied. Total rules applied 355 place count 1350 transition count 1196
Reduce places removed 354 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 356 rules applied. Total rules applied 711 place count 996 transition count 1194
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 713 place count 994 transition count 1194
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 713 place count 994 transition count 1108
Deduced a syphon composed of 86 places in 2 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 885 place count 908 transition count 1108
Discarding 505 places :
Symmetric choice reduction at 3 with 505 rule applications. Total rules 1390 place count 403 transition count 603
Iterating global reduction 3 with 505 rules applied. Total rules applied 1895 place count 403 transition count 603
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 1895 place count 403 transition count 595
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 1911 place count 395 transition count 595
Discarding 79 places :
Symmetric choice reduction at 3 with 79 rule applications. Total rules 1990 place count 316 transition count 516
Iterating global reduction 3 with 79 rules applied. Total rules applied 2069 place count 316 transition count 516
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 3 with 76 rules applied. Total rules applied 2145 place count 316 transition count 440
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 2255 place count 261 transition count 385
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 2275 place count 261 transition count 365
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 2285 place count 251 transition count 355
Iterating global reduction 5 with 10 rules applied. Total rules applied 2295 place count 251 transition count 355
Free-agglomeration rule applied 187 times.
Iterating global reduction 5 with 187 rules applied. Total rules applied 2482 place count 251 transition count 168
Reduce places removed 187 places and 0 transitions.
Drop transitions removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Graph (complete) has 174 edges and 64 vertex of which 54 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 268 rules applied. Total rules applied 2750 place count 54 transition count 88
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 2764 place count 54 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 2765 place count 53 transition count 73
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 40 edges and 52 vertex of which 16 / 52 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 2767 place count 44 transition count 73
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 2783 place count 44 transition count 57
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 8 Pre rules applied. Total rules applied 2783 place count 44 transition count 49
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 9 with 16 rules applied. Total rules applied 2799 place count 36 transition count 49
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 2807 place count 36 transition count 41
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 10 with 16 rules applied. Total rules applied 2823 place count 28 transition count 33
Free-agglomeration rule applied 8 times.
Iterating global reduction 10 with 8 rules applied. Total rules applied 2831 place count 28 transition count 25
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 20 rules applied. Total rules applied 2851 place count 16 transition count 17
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2852 place count 16 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 2853 place count 15 transition count 16
Applied a total of 2853 rules in 234 ms. Remains 15 /1402 variables (removed 1387) and now considering 16/1613 (removed 1597) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 234 ms. Remains : 15/1402 places, 16/1613 transitions.
Finished random walk after 45 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=22 )
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 7596 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/472/inv_0_ --invariant=/tmp/472/inv_1_ --invariant=/tmp/472/inv_2_ --invariant=/tmp/472/inv_3_ --invariant=/tmp/472/inv_4_ --invariant=/tmp/472/inv_5_ --invariant=/tmp/472/inv_6_ --invariant=/tmp/472/inv_7_ --invariant=/tmp/472/inv_8_ --invariant=/tmp/472/inv_9_ --invariant=/tmp/472/inv_10_ --invariant=/tmp/472/inv_11_ --invariant=/tmp/472/inv_12_ --invariant=/tmp/472/inv_13_ --invariant=/tmp/472/inv_14_ --invariant=/tmp/472/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 15430324 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16097800 kB
Could not compute solution for formula : FlexibleBarrier-PT-10b-ReachabilityCardinality-00
Could not compute solution for formula : FlexibleBarrier-PT-10b-ReachabilityCardinality-01
Could not compute solution for formula : FlexibleBarrier-PT-10b-ReachabilityCardinality-02
Could not compute solution for formula : FlexibleBarrier-PT-10b-ReachabilityCardinality-03
Could not compute solution for formula : FlexibleBarrier-PT-10b-ReachabilityCardinality-04
Could not compute solution for formula : FlexibleBarrier-PT-10b-ReachabilityCardinality-05
Could not compute solution for formula : FlexibleBarrier-PT-10b-ReachabilityCardinality-06
Could not compute solution for formula : FlexibleBarrier-PT-10b-ReachabilityCardinality-07
Could not compute solution for formula : FlexibleBarrier-PT-10b-ReachabilityCardinality-08
Could not compute solution for formula : FlexibleBarrier-PT-10b-ReachabilityCardinality-09
Could not compute solution for formula : FlexibleBarrier-PT-10b-ReachabilityCardinality-10
Could not compute solution for formula : FlexibleBarrier-PT-10b-ReachabilityCardinality-11
Could not compute solution for formula : FlexibleBarrier-PT-10b-ReachabilityCardinality-12
Could not compute solution for formula : FlexibleBarrier-PT-10b-ReachabilityCardinality-13
Could not compute solution for formula : FlexibleBarrier-PT-10b-ReachabilityCardinality-14
Could not compute solution for formula : FlexibleBarrier-PT-10b-ReachabilityCardinality-15

BK_STOP 1678559628453

--------------------
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-10b-ReachabilityCardinality-00
rfs formula type AG
rfs formula formula --invariant=/tmp/472/inv_0_
rfs formula name FlexibleBarrier-PT-10b-ReachabilityCardinality-01
rfs formula type EF
rfs formula formula --invariant=/tmp/472/inv_1_
rfs formula name FlexibleBarrier-PT-10b-ReachabilityCardinality-02
rfs formula type AG
rfs formula formula --invariant=/tmp/472/inv_2_
rfs formula name FlexibleBarrier-PT-10b-ReachabilityCardinality-03
rfs formula type EF
rfs formula formula --invariant=/tmp/472/inv_3_
rfs formula name FlexibleBarrier-PT-10b-ReachabilityCardinality-04
rfs formula type AG
rfs formula formula --invariant=/tmp/472/inv_4_
rfs formula name FlexibleBarrier-PT-10b-ReachabilityCardinality-05
rfs formula type AG
rfs formula formula --invariant=/tmp/472/inv_5_
rfs formula name FlexibleBarrier-PT-10b-ReachabilityCardinality-06
rfs formula type EF
rfs formula formula --invariant=/tmp/472/inv_6_
rfs formula name FlexibleBarrier-PT-10b-ReachabilityCardinality-07
rfs formula type EF
rfs formula formula --invariant=/tmp/472/inv_7_
rfs formula name FlexibleBarrier-PT-10b-ReachabilityCardinality-08
rfs formula type EF
rfs formula formula --invariant=/tmp/472/inv_8_
rfs formula name FlexibleBarrier-PT-10b-ReachabilityCardinality-09
rfs formula type AG
rfs formula formula --invariant=/tmp/472/inv_9_
rfs formula name FlexibleBarrier-PT-10b-ReachabilityCardinality-10
rfs formula type AG
rfs formula formula --invariant=/tmp/472/inv_10_
rfs formula name FlexibleBarrier-PT-10b-ReachabilityCardinality-11
rfs formula type AG
rfs formula formula --invariant=/tmp/472/inv_11_
rfs formula name FlexibleBarrier-PT-10b-ReachabilityCardinality-12
rfs formula type EF
rfs formula formula --invariant=/tmp/472/inv_12_
rfs formula name FlexibleBarrier-PT-10b-ReachabilityCardinality-13
rfs formula type EF
rfs formula formula --invariant=/tmp/472/inv_13_
rfs formula name FlexibleBarrier-PT-10b-ReachabilityCardinality-14
rfs formula type AG
rfs formula formula --invariant=/tmp/472/inv_14_
rfs formula name FlexibleBarrier-PT-10b-ReachabilityCardinality-15
rfs formula type EF
rfs formula formula --invariant=/tmp/472/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 1402 places, 1613 transitions and 4025 arcs
pnml2lts-sym: Petri net FlexibleBarrier-PT-10b analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.020 real 0.010 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: 1613->1613 groups
pnml2lts-sym: Regrouping took 1.460 real 1.450 user 0.010 sys
pnml2lts-sym: state vector length is 1402; there are 1613 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
Killing (15) : 478
Killing (9) : 478

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-10b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="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-10b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r169-tall-167838856000502"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-10b.tgz
mv FlexibleBarrier-PT-10b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;