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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1741.027 3600000.00 14148986.00 614.20 TTFTTFFFTTTFFFTF 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-167814481700822.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 DLCshifumi-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-167814481700822
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 5.7K Feb 26 08:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Feb 26 08:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 08:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 08:03 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.7K Feb 25 15:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 08:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 08:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 08:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 08:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:54 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.3M 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 DLCshifumi-PT-3b-ReachabilityCardinality-00
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityCardinality-01
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityCardinality-02
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityCardinality-03
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityCardinality-04
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityCardinality-05
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityCardinality-06
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityCardinality-07
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityCardinality-08
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityCardinality-09
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityCardinality-10
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityCardinality-11
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityCardinality-12
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityCardinality-13
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityCardinality-14
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678387746493

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=DLCshifumi-PT-3b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-09 18:49:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 18:49:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 18:49:08] [INFO ] Load time of PNML (sax parser for PT used): 286 ms
[2023-03-09 18:49:08] [INFO ] Transformed 7058 places.
[2023-03-09 18:49:08] [INFO ] Transformed 9611 transitions.
[2023-03-09 18:49:08] [INFO ] Found NUPN structural information;
[2023-03-09 18:49:08] [INFO ] Parsed PT model containing 7058 places and 9611 transitions and 24573 arcs in 541 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 683 ms. (steps per millisecond=14 ) properties (out of 12) seen :3
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 9611 rows 7058 cols
[2023-03-09 18:49:10] [INFO ] Computed 282 place invariants in 82 ms
[2023-03-09 18:49:12] [INFO ] [Real]Absence check using 282 positive place invariants in 325 ms returned sat
[2023-03-09 18:49:12] [INFO ] After 2487ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-09 18:49:15] [INFO ] [Nat]Absence check using 282 positive place invariants in 308 ms returned sat
[2023-03-09 18:49:25] [INFO ] After 8949ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-09 18:49:28] [INFO ] Deduced a trap composed of 116 places in 3322 ms of which 28 ms to minimize.
[2023-03-09 18:49:32] [INFO ] Deduced a trap composed of 86 places in 3301 ms of which 13 ms to minimize.
[2023-03-09 18:49:35] [INFO ] Deduced a trap composed of 108 places in 2847 ms of which 4 ms to minimize.
[2023-03-09 18:49:38] [INFO ] Deduced a trap composed of 111 places in 2854 ms of which 7 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 18:49:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 18:49:38] [INFO ] After 25747ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 5 properties in 679 ms.
Support contains 36 out of 7058 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7058/7058 places, 9611/9611 transitions.
Graph (trivial) has 6728 edges and 7058 vertex of which 740 / 7058 are part of one of the 48 SCC in 42 ms
Free SCC test removed 692 places
Drop transitions removed 781 transitions
Reduce isomorphic transitions removed 781 transitions.
Drop transitions removed 3501 transitions
Trivial Post-agglo rules discarded 3501 transitions
Performed 3501 trivial Post agglomeration. Transition count delta: 3501
Iterating post reduction 0 with 3501 rules applied. Total rules applied 3502 place count 6366 transition count 5329
Reduce places removed 3501 places and 0 transitions.
Ensure Unique test removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Drop transitions removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 1 with 3748 rules applied. Total rules applied 7250 place count 2865 transition count 5082
Reduce places removed 122 places and 0 transitions.
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 2 with 198 rules applied. Total rules applied 7448 place count 2743 transition count 5006
Reduce places removed 38 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 3 with 53 rules applied. Total rules applied 7501 place count 2705 transition count 4991
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 7516 place count 2690 transition count 4991
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 52 Pre rules applied. Total rules applied 7516 place count 2690 transition count 4939
Deduced a syphon composed of 52 places in 31 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 5 with 104 rules applied. Total rules applied 7620 place count 2638 transition count 4939
Discarding 725 places :
Symmetric choice reduction at 5 with 725 rule applications. Total rules 8345 place count 1913 transition count 4214
Iterating global reduction 5 with 725 rules applied. Total rules applied 9070 place count 1913 transition count 4214
Performed 269 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 269 Pre rules applied. Total rules applied 9070 place count 1913 transition count 3945
Deduced a syphon composed of 269 places in 27 ms
Reduce places removed 269 places and 0 transitions.
Iterating global reduction 5 with 538 rules applied. Total rules applied 9608 place count 1644 transition count 3945
Discarding 90 places :
Symmetric choice reduction at 5 with 90 rule applications. Total rules 9698 place count 1554 transition count 2915
Iterating global reduction 5 with 90 rules applied. Total rules applied 9788 place count 1554 transition count 2915
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 5 with 76 rules applied. Total rules applied 9864 place count 1554 transition count 2839
Performed 384 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 384 places in 3 ms
Reduce places removed 384 places and 0 transitions.
Iterating global reduction 6 with 768 rules applied. Total rules applied 10632 place count 1170 transition count 2452
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 10635 place count 1170 transition count 2449
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 10636 place count 1169 transition count 2408
Iterating global reduction 7 with 1 rules applied. Total rules applied 10637 place count 1169 transition count 2408
Performed 101 Post agglomeration using F-continuation condition with reduction of 84 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 10839 place count 1068 transition count 2614
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 10841 place count 1068 transition count 2612
Discarding 27 places :
Symmetric choice reduction at 8 with 27 rule applications. Total rules 10868 place count 1041 transition count 2450
Iterating global reduction 8 with 27 rules applied. Total rules applied 10895 place count 1041 transition count 2450
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 8 with 75 rules applied. Total rules applied 10970 place count 1041 transition count 2375
Performed 49 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 9 with 98 rules applied. Total rules applied 11068 place count 992 transition count 2657
Drop transitions removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 9 with 53 rules applied. Total rules applied 11121 place count 992 transition count 2604
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 11127 place count 986 transition count 2565
Iterating global reduction 10 with 6 rules applied. Total rules applied 11133 place count 986 transition count 2565
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 10 with 20 rules applied. Total rules applied 11153 place count 986 transition count 2545
Drop transitions removed 73 transitions
Redundant transition composition rules discarded 73 transitions
Iterating global reduction 11 with 73 rules applied. Total rules applied 11226 place count 986 transition count 2472
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 11231 place count 981 transition count 2467
Iterating global reduction 11 with 5 rules applied. Total rules applied 11236 place count 981 transition count 2467
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 11241 place count 976 transition count 2236
Iterating global reduction 11 with 5 rules applied. Total rules applied 11246 place count 976 transition count 2236
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 11251 place count 976 transition count 2231
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 11257 place count 973 transition count 2228
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 11260 place count 970 transition count 2091
Iterating global reduction 12 with 3 rules applied. Total rules applied 11263 place count 970 transition count 2091
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 11266 place count 970 transition count 2088
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 11270 place count 968 transition count 2093
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 11272 place count 968 transition count 2091
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 14 with 5 rules applied. Total rules applied 11277 place count 968 transition count 2086
Free-agglomeration rule applied 538 times with reduction of 304 identical transitions.
Iterating global reduction 14 with 538 rules applied. Total rules applied 11815 place count 968 transition count 1244
Reduce places removed 538 places and 0 transitions.
Drop transitions removed 590 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 594 transitions.
Graph (complete) has 1016 edges and 430 vertex of which 255 are kept as prefixes of interest. Removing 175 places using SCC suffix rule.13 ms
Discarding 175 places :
Also discarding 145 output transitions
Drop transitions removed 145 transitions
Iterating post reduction 14 with 1133 rules applied. Total rules applied 12948 place count 255 transition count 505
Drop transitions removed 45 transitions
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 15 with 98 rules applied. Total rules applied 13046 place count 255 transition count 407
Discarding 54 places :
Symmetric choice reduction at 16 with 54 rule applications. Total rules 13100 place count 201 transition count 328
Iterating global reduction 16 with 54 rules applied. Total rules applied 13154 place count 201 transition count 328
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 13155 place count 201 transition count 327
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 17 with 12 rules applied. Total rules applied 13167 place count 201 transition count 315
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 13169 place count 199 transition count 315
Discarding 2 places :
Symmetric choice reduction at 18 with 2 rule applications. Total rules 13171 place count 197 transition count 313
Iterating global reduction 18 with 2 rules applied. Total rules applied 13173 place count 197 transition count 313
Free-agglomeration rule applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 13174 place count 197 transition count 312
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 13175 place count 196 transition count 312
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 13176 place count 196 transition count 312
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 13177 place count 195 transition count 311
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 19 with 3 rules applied. Total rules applied 13180 place count 193 transition count 310
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 13181 place count 192 transition count 310
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 1 Pre rules applied. Total rules applied 13181 place count 192 transition count 309
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 13183 place count 191 transition count 309
Performed 12 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 21 with 24 rules applied. Total rules applied 13207 place count 179 transition count 281
Drop transitions removed 22 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 21 with 49 rules applied. Total rules applied 13256 place count 179 transition count 232
Discarding 12 places :
Symmetric choice reduction at 22 with 12 rule applications. Total rules 13268 place count 167 transition count 209
Iterating global reduction 22 with 12 rules applied. Total rules applied 13280 place count 167 transition count 209
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 22 with 6 rules applied. Total rules applied 13286 place count 163 transition count 207
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 22 with 5 rules applied. Total rules applied 13291 place count 163 transition count 202
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 23 with 18 rules applied. Total rules applied 13309 place count 163 transition count 184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 13310 place count 162 transition count 184
Discarding 15 places :
Symmetric choice reduction at 24 with 15 rule applications. Total rules 13325 place count 147 transition count 155
Iterating global reduction 24 with 15 rules applied. Total rules applied 13340 place count 147 transition count 155
Free-agglomeration rule applied 3 times.
Iterating global reduction 24 with 3 rules applied. Total rules applied 13343 place count 147 transition count 152
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 24 with 3 rules applied. Total rules applied 13346 place count 144 transition count 152
Applied a total of 13346 rules in 2834 ms. Remains 144 /7058 variables (removed 6914) and now considering 152/9611 (removed 9459) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2834 ms. Remains : 144/7058 places, 152/9611 transitions.
Finished random walk after 5426 steps, including 1 resets, run visited all 4 properties in 37 ms. (steps per millisecond=146 )
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 34010 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/474/inv_0_ --invariant=/tmp/474/inv_1_ --invariant=/tmp/474/inv_2_ --invariant=/tmp/474/inv_3_ --invariant=/tmp/474/inv_4_ --invariant=/tmp/474/inv_5_ --invariant=/tmp/474/inv_6_ --invariant=/tmp/474/inv_7_ --invariant=/tmp/474/inv_8_ --invariant=/tmp/474/inv_9_ --invariant=/tmp/474/inv_10_ --invariant=/tmp/474/inv_11_ --invariant=/tmp/474/inv_12_ --invariant=/tmp/474/inv_13_ --invariant=/tmp/474/inv_14_ --invariant=/tmp/474/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14405824 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16099060 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
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="DLCshifumi-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 DLCshifumi-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-167814481700822"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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