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

About the Execution of LTSMin+red for DLCflexbar-PT-3b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2629.107 3600000.00 14108720.00 681.70 TFFFTTFFTFTFTFFT 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.r105-tall-167814481300534.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 DLCflexbar-PT-3b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481300534
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 6.0K Feb 25 15:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 15:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 15:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 15:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 15:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 15:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 15:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 15:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 2.5M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678323295581

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=DLCflexbar-PT-3b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-09 00:54:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 00:54:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 00:54:57] [INFO ] Load time of PNML (sax parser for PT used): 290 ms
[2023-03-09 00:54:57] [INFO ] Transformed 7245 places.
[2023-03-09 00:54:57] [INFO ] Transformed 10555 transitions.
[2023-03-09 00:54:57] [INFO ] Found NUPN structural information;
[2023-03-09 00:54:57] [INFO ] Parsed PT model containing 7245 places and 10555 transitions and 28284 arcs in 530 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 12) seen :8
FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 10555 rows 7245 cols
[2023-03-09 00:54:59] [INFO ] Computed 355 place invariants in 83 ms
[2023-03-09 00:55:00] [INFO ] After 1627ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 00:55:02] [INFO ] [Nat]Absence check using 355 positive place invariants in 445 ms returned sat
[2023-03-09 00:55:13] [INFO ] After 10076ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 00:55:18] [INFO ] Deduced a trap composed of 89 places in 5003 ms of which 14 ms to minimize.
[2023-03-09 00:55:23] [INFO ] Deduced a trap composed of 101 places in 4724 ms of which 6 ms to minimize.
[2023-03-09 00:55:28] [INFO ] Deduced a trap composed of 106 places in 4697 ms of which 5 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 00:55:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 00:55:28] [INFO ] After 27650ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 238 ms.
Support contains 15 out of 7245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7245/7245 places, 10555/10555 transitions.
Graph (trivial) has 6762 edges and 7245 vertex of which 720 / 7245 are part of one of the 48 SCC in 21 ms
Free SCC test removed 672 places
Drop transitions removed 756 transitions
Reduce isomorphic transitions removed 756 transitions.
Drop transitions removed 3342 transitions
Trivial Post-agglo rules discarded 3342 transitions
Performed 3342 trivial Post agglomeration. Transition count delta: 3342
Iterating post reduction 0 with 3342 rules applied. Total rules applied 3343 place count 6573 transition count 6457
Reduce places removed 3342 places and 0 transitions.
Ensure Unique test removed 103 transitions
Reduce isomorphic transitions removed 103 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 1 with 3543 rules applied. Total rules applied 6886 place count 3231 transition count 6256
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 2 with 154 rules applied. Total rules applied 7040 place count 3133 transition count 6200
Reduce places removed 28 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 3 with 41 rules applied. Total rules applied 7081 place count 3105 transition count 6187
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 7096 place count 3092 transition count 6185
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 33 Pre rules applied. Total rules applied 7096 place count 3092 transition count 6152
Deduced a syphon composed of 33 places in 58 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 7162 place count 3059 transition count 6152
Discarding 860 places :
Symmetric choice reduction at 5 with 860 rule applications. Total rules 8022 place count 2199 transition count 5292
Iterating global reduction 5 with 860 rules applied. Total rules applied 8882 place count 2199 transition count 5292
Performed 353 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 353 Pre rules applied. Total rules applied 8882 place count 2199 transition count 4939
Deduced a syphon composed of 353 places in 49 ms
Reduce places removed 353 places and 0 transitions.
Iterating global reduction 5 with 706 rules applied. Total rules applied 9588 place count 1846 transition count 4939
Discarding 91 places :
Symmetric choice reduction at 5 with 91 rule applications. Total rules 9679 place count 1755 transition count 3469
Iterating global reduction 5 with 91 rules applied. Total rules applied 9770 place count 1755 transition count 3469
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 5 with 66 rules applied. Total rules applied 9836 place count 1755 transition count 3403
Performed 446 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 446 places in 1 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 6 with 892 rules applied. Total rules applied 10728 place count 1309 transition count 2952
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 10733 place count 1309 transition count 2947
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition with reduction of 140 identical transitions.
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 7 with 202 rules applied. Total rules applied 10935 place count 1208 transition count 3453
Drop transitions removed 18 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 10955 place count 1208 transition count 3433
Discarding 30 places :
Symmetric choice reduction at 8 with 30 rule applications. Total rules 10985 place count 1178 transition count 3128
Iterating global reduction 8 with 30 rules applied. Total rules applied 11015 place count 1178 transition count 3128
Ensure Unique test removed 143 transitions
Reduce isomorphic transitions removed 143 transitions.
Iterating post reduction 8 with 143 rules applied. Total rules applied 11158 place count 1178 transition count 2985
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 11160 place count 1177 transition count 2996
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 11162 place count 1177 transition count 2994
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 10 with 44 rules applied. Total rules applied 11206 place count 1177 transition count 2950
Discarding 10 places :
Symmetric choice reduction at 10 with 10 rule applications. Total rules 11216 place count 1167 transition count 2940
Iterating global reduction 10 with 10 rules applied. Total rules applied 11226 place count 1167 transition count 2940
Discarding 10 places :
Symmetric choice reduction at 10 with 10 rule applications. Total rules 11236 place count 1157 transition count 2594
Iterating global reduction 10 with 10 rules applied. Total rules applied 11246 place count 1157 transition count 2594
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 11256 place count 1157 transition count 2584
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 11 with 10 rules applied. Total rules applied 11266 place count 1152 transition count 2579
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 11271 place count 1147 transition count 2406
Iterating global reduction 11 with 5 rules applied. Total rules applied 11276 place count 1147 transition count 2406
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 11281 place count 1147 transition count 2401
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 11285 place count 1145 transition count 2419
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 11288 place count 1145 transition count 2416
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 13 with 11 rules applied. Total rules applied 11299 place count 1145 transition count 2405
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 11301 place count 1144 transition count 2416
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 11302 place count 1144 transition count 2415
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 11304 place count 1144 transition count 2413
Free-agglomeration rule applied 718 times with reduction of 448 identical transitions.
Iterating global reduction 14 with 718 rules applied. Total rules applied 12022 place count 1144 transition count 1247
Reduce places removed 718 places and 0 transitions.
Drop transitions removed 783 transitions
Reduce isomorphic transitions removed 783 transitions.
Graph (complete) has 876 edges and 426 vertex of which 168 are kept as prefixes of interest. Removing 258 places using SCC suffix rule.2 ms
Discarding 258 places :
Also discarding 212 output transitions
Drop transitions removed 212 transitions
Iterating post reduction 14 with 1502 rules applied. Total rules applied 13524 place count 168 transition count 252
Drop transitions removed 10 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 15 with 39 rules applied. Total rules applied 13563 place count 168 transition count 213
Discarding 84 places :
Symmetric choice reduction at 16 with 84 rule applications. Total rules 13647 place count 84 transition count 90
Iterating global reduction 16 with 84 rules applied. Total rules applied 13731 place count 84 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 13732 place count 84 transition count 89
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 17 with 5 rules applied. Total rules applied 13737 place count 84 transition count 84
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 13739 place count 82 transition count 84
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 13740 place count 82 transition count 84
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 13741 place count 81 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 13742 place count 80 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 6 rules applied. Total rules applied 13748 place count 76 transition count 81
Drop transitions removed 3 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 4 edges and 76 vertex of which 2 / 76 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 19 with 6 rules applied. Total rules applied 13754 place count 75 transition count 76
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 137 edges and 75 vertex of which 74 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 20 with 5 rules applied. Total rules applied 13759 place count 74 transition count 72
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 13760 place count 74 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 13761 place count 73 transition count 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 22 with 1 Pre rules applied. Total rules applied 13761 place count 73 transition count 70
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 13763 place count 72 transition count 70
Applied a total of 13763 rules in 2654 ms. Remains 72 /7245 variables (removed 7173) and now considering 70/10555 (removed 10485) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2656 ms. Remains : 72/7245 places, 70/10555 transitions.
Finished random walk after 2310 steps, including 0 resets, run visited all 2 properties in 18 ms. (steps per millisecond=128 )
FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 33992 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/469/inv_0_ --invariant=/tmp/469/inv_1_ --invariant=/tmp/469/inv_2_ --invariant=/tmp/469/inv_3_ --invariant=/tmp/469/inv_4_ --invariant=/tmp/469/inv_5_ --invariant=/tmp/469/inv_6_ --invariant=/tmp/469/inv_7_ --invariant=/tmp/469/inv_8_ --invariant=/tmp/469/inv_9_ --invariant=/tmp/469/inv_10_ --invariant=/tmp/469/inv_11_ --invariant=/tmp/469/inv_12_ --invariant=/tmp/469/inv_13_ --invariant=/tmp/469/inv_14_ --invariant=/tmp/469/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13518936 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16097820 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DLCflexbar-PT-3b"
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 DLCflexbar-PT-3b, 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 r105-tall-167814481300534"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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