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.r106-tall-167814483000614.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 marciexred
Input is DLCflexbar-PT-8b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814483000614
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 7.6K Feb 25 14:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 14:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 14:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 14:56 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.9K Feb 25 15:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 15:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 15:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 14:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 14:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:52 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 20M 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-8b-ReachabilityCardinality-00
FORMULA_NAME DLCflexbar-PT-8b-ReachabilityCardinality-01
FORMULA_NAME DLCflexbar-PT-8b-ReachabilityCardinality-02
FORMULA_NAME DLCflexbar-PT-8b-ReachabilityCardinality-03
FORMULA_NAME DLCflexbar-PT-8b-ReachabilityCardinality-04
FORMULA_NAME DLCflexbar-PT-8b-ReachabilityCardinality-05
FORMULA_NAME DLCflexbar-PT-8b-ReachabilityCardinality-06
FORMULA_NAME DLCflexbar-PT-8b-ReachabilityCardinality-07
FORMULA_NAME DLCflexbar-PT-8b-ReachabilityCardinality-08
FORMULA_NAME DLCflexbar-PT-8b-ReachabilityCardinality-09
FORMULA_NAME DLCflexbar-PT-8b-ReachabilityCardinality-10
FORMULA_NAME DLCflexbar-PT-8b-ReachabilityCardinality-11
FORMULA_NAME DLCflexbar-PT-8b-ReachabilityCardinality-12
FORMULA_NAME DLCflexbar-PT-8b-ReachabilityCardinality-13
FORMULA_NAME DLCflexbar-PT-8b-ReachabilityCardinality-14
FORMULA_NAME DLCflexbar-PT-8b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678445523181

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCflexbar-PT-8b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 10:52:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 10:52:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 10:52:05] [INFO ] Load time of PNML (sax parser for PT used): 1140 ms
[2023-03-10 10:52:07] [INFO ] Transformed 47560 places.
[2023-03-10 10:52:07] [INFO ] Transformed 76160 transitions.
[2023-03-10 10:52:07] [INFO ] Found NUPN structural information;
[2023-03-10 10:52:10] [INFO ] Parsed PT model containing 47560 places and 76160 transitions and 216499 arcs in 6216 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 54 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCflexbar-PT-8b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-8b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-8b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 862 ms. (steps per millisecond=11 ) properties (out of 13) seen :1
FORMULA DLCflexbar-PT-8b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 61170 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61170 steps, saw 60602 distinct states, run finished after 3004 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 76160 rows 47560 cols
[2023-03-10 10:52:28] [INFO ] Computed 3040 place invariants in 696 ms
[2023-03-10 10:52:53] [INFO ] [Real]Absence check using 3040 positive place invariants in 2936 ms returned unknown
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
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-10 10:52:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 10:52:53] [INFO ] After 25176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 64 out of 47560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47560/47560 places, 76160/76160 transitions.
Graph (trivial) has 42438 edges and 47560 vertex of which 2784 / 47560 are part of one of the 179 SCC in 81 ms
Free SCC test removed 2605 places
Drop transitions removed 2943 transitions
Reduce isomorphic transitions removed 2943 transitions.
Drop transitions removed 20633 transitions
Trivial Post-agglo rules discarded 20633 transitions
Performed 20633 trivial Post agglomeration. Transition count delta: 20633
Iterating post reduction 0 with 20633 rules applied. Total rules applied 20634 place count 44955 transition count 52584
Reduce places removed 20633 places and 0 transitions.
Ensure Unique test removed 445 transitions
Reduce isomorphic transitions removed 445 transitions.
Drop transitions removed 435 transitions
Trivial Post-agglo rules discarded 435 transitions
Performed 435 trivial Post agglomeration. Transition count delta: 435
Iterating post reduction 1 with 21513 rules applied. Total rules applied 42147 place count 24322 transition count 51704
Reduce places removed 435 places and 0 transitions.
Ensure Unique test removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Drop transitions removed 135 transitions
Trivial Post-agglo rules discarded 135 transitions
Performed 135 trivial Post agglomeration. Transition count delta: 135
Iterating post reduction 2 with 707 rules applied. Total rules applied 42854 place count 23887 transition count 51432
Reduce places removed 135 places and 0 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Iterating post reduction 3 with 164 rules applied. Total rules applied 43018 place count 23752 transition count 51403
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 43047 place count 23723 transition count 51403
Performed 165 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 165 Pre rules applied. Total rules applied 43047 place count 23723 transition count 51238
Deduced a syphon composed of 165 places in 4561 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 5 with 330 rules applied. Total rules applied 43377 place count 23558 transition count 51238
Performed 13080 Post agglomeration using F-continuation condition.Transition count delta: 13080
Deduced a syphon composed of 13080 places in 29 ms
Reduce places removed 13080 places and 0 transitions.
Iterating global reduction 5 with 26160 rules applied. Total rules applied 69537 place count 10478 transition count 38158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 69538 place count 10478 transition count 38157
Renaming transitions due to excessive name length > 1024 char.
Discarding 350 places :
Symmetric choice reduction at 6 with 350 rule applications. Total rules 69888 place count 10128 transition count 24999
Iterating global reduction 6 with 350 rules applied. Total rules applied 70238 place count 10128 transition count 24999
Ensure Unique test removed 311 transitions
Reduce isomorphic transitions removed 311 transitions.
Iterating post reduction 6 with 311 rules applied. Total rules applied 70549 place count 10128 transition count 24688
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -897
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 7 with 202 rules applied. Total rules applied 70751 place count 10027 transition count 25585
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 7 with 48 rules applied. Total rules applied 70799 place count 10027 transition count 25537
Discarding 46 places :
Symmetric choice reduction at 8 with 46 rule applications. Total rules 70845 place count 9981 transition count 24617
Iterating global reduction 8 with 46 rules applied. Total rules applied 70891 place count 9981 transition count 24617
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 8 with 46 rules applied. Total rules applied 70937 place count 9981 transition count 24571
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -879
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 9 with 202 rules applied. Total rules applied 71139 place count 9880 transition count 25450
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 9 with 27 rules applied. Total rules applied 71166 place count 9880 transition count 25423
Discarding 27 places :
Symmetric choice reduction at 10 with 27 rule applications. Total rules 71193 place count 9853 transition count 24883
Iterating global reduction 10 with 27 rules applied. Total rules applied 71220 place count 9853 transition count 24883
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 10 with 26 rules applied. Total rules applied 71246 place count 9853 transition count 24857
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -889
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 11 with 202 rules applied. Total rules applied 71448 place count 9752 transition count 25746
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 11 with 35 rules applied. Total rules applied 71483 place count 9752 transition count 25711
Discarding 35 places :
Symmetric choice reduction at 12 with 35 rule applications. Total rules 71518 place count 9717 transition count 25011
Iterating global reduction 12 with 35 rules applied. Total rules applied 71553 place count 9717 transition count 25011
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 12 with 35 rules applied. Total rules applied 71588 place count 9717 transition count 24976
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -860
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 13 with 202 rules applied. Total rules applied 71790 place count 9616 transition count 25836
Drop transitions removed 20 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 13 with 48 rules applied. Total rules applied 71838 place count 9616 transition count 25788
Discarding 28 places :
Symmetric choice reduction at 14 with 28 rule applications. Total rules 71866 place count 9588 transition count 25225
Iterating global reduction 14 with 28 rules applied. Total rules applied 71894 place count 9588 transition count 25225
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 14 with 28 rules applied. Total rules applied 71922 place count 9588 transition count 25197
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: -478
Deduced a syphon composed of 63 places in 5 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 15 with 126 rules applied. Total rules applied 72048 place count 9525 transition count 25675
Drop transitions removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 15 with 54 rules applied. Total rules applied 72102 place count 9525 transition count 25621
Free-agglomeration rule applied 6122 times with reduction of 4186 identical transitions.
Iterating global reduction 16 with 6122 rules applied. Total rules applied 78224 place count 9525 transition count 15313
Reduce places removed 6122 places and 0 transitions.
Drop transitions removed 7152 transitions
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 7226 transitions.
Graph (complete) has 11440 edges and 3403 vertex of which 2220 are kept as prefixes of interest. Removing 1183 places using SCC suffix rule.6 ms
Discarding 1183 places :
Also discarding 1009 output transitions
Drop transitions removed 1009 transitions
Iterating post reduction 16 with 13349 rules applied. Total rules applied 91573 place count 2220 transition count 7078
Drop transitions removed 995 transitions
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 1057 transitions.
Iterating post reduction 17 with 1057 rules applied. Total rules applied 92630 place count 2220 transition count 6021
Discarding 1408 places :
Symmetric choice reduction at 18 with 1408 rule applications. Total rules 94038 place count 812 transition count 2454
Iterating global reduction 18 with 1408 rules applied. Total rules applied 95446 place count 812 transition count 2454
Drop transitions removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 18 with 64 rules applied. Total rules applied 95510 place count 812 transition count 2390
Discarding 29 places :
Symmetric choice reduction at 18 with 29 rule applications. Total rules 95539 place count 783 transition count 2343
Iterating global reduction 18 with 29 rules applied. Total rules applied 95568 place count 783 transition count 2343
Discarding 20 places :
Symmetric choice reduction at 18 with 20 rule applications. Total rules 95588 place count 763 transition count 1449
Iterating global reduction 18 with 20 rules applied. Total rules applied 95608 place count 763 transition count 1449
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 18 with 20 rules applied. Total rules applied 95628 place count 763 transition count 1429
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 19 with 20 rules applied. Total rules applied 95648 place count 753 transition count 1419
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 19 with 20 rules applied. Total rules applied 95668 place count 753 transition count 1399
Free-agglomeration rule applied 12 times.
Iterating global reduction 19 with 12 rules applied. Total rules applied 95680 place count 753 transition count 1387
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 418 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 427 transitions.
Graph (complete) has 1877 edges and 741 vertex of which 549 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 177 output transitions
Drop transitions removed 177 transitions
Iterating post reduction 19 with 440 rules applied. Total rules applied 96120 place count 549 transition count 783
Drop transitions removed 19 transitions
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 20 with 64 rules applied. Total rules applied 96184 place count 549 transition count 719
Discarding 247 places :
Symmetric choice reduction at 21 with 247 rule applications. Total rules 96431 place count 302 transition count 349
Iterating global reduction 21 with 247 rules applied. Total rules applied 96678 place count 302 transition count 349
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 21 with 2 rules applied. Total rules applied 96680 place count 302 transition count 347
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 96681 place count 301 transition count 347
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 96683 place count 300 transition count 346
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 96684 place count 300 transition count 345
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 23 with 1 rules applied. Total rules applied 96685 place count 299 transition count 344
Reduce places removed 10 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 23 with 14 rules applied. Total rules applied 96699 place count 289 transition count 340
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 24 with 4 rules applied. Total rules applied 96703 place count 285 transition count 340
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 25 with 3 Pre rules applied. Total rules applied 96703 place count 285 transition count 337
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 25 with 6 rules applied. Total rules applied 96709 place count 282 transition count 337
Performed 16 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 25 with 32 rules applied. Total rules applied 96741 place count 266 transition count 314
Drop transitions removed 20 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 25 with 50 rules applied. Total rules applied 96791 place count 266 transition count 264
Discarding 16 places :
Symmetric choice reduction at 26 with 16 rule applications. Total rules 96807 place count 250 transition count 243
Iterating global reduction 26 with 16 rules applied. Total rules applied 96823 place count 250 transition count 243
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 26 with 1 rules applied. Total rules applied 96824 place count 250 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 96825 place count 249 transition count 242
Free-agglomeration rule applied 1 times.
Iterating global reduction 27 with 1 rules applied. Total rules applied 96826 place count 249 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 96827 place count 248 transition count 241
Applied a total of 96827 rules in 38926 ms. Remains 248 /47560 variables (removed 47312) and now considering 241/76160 (removed 75919) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38927 ms. Remains : 248/47560 places, 241/76160 transitions.
Finished random walk after 2377 steps, including 0 resets, run visited all 12 properties in 30 ms. (steps per millisecond=79 )
FORMULA DLCflexbar-PT-8b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-8b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-8b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-8b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-8b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-8b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-8b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-8b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-8b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-8b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-8b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-8b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 88011 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: DLCflexbar_PT_8b
(NrP: 47560 NrTr: 76160 NrArc: 216499)

parse formulas
formulas created successfully
place and transition orderings generation:14m 7.006sec

net check time: 0m 0.033sec

init dd package: 0m 2.668sec


before gc: list nodes free: 1915754

after gc: idd nodes used:11314, unused:63988686; list nodes free:257870498

before gc: list nodes free: 1901699

after gc: idd nodes used:15999, unused:63984001; list nodes free:257837703

before gc: list nodes free: 1890914

after gc: idd nodes used:19594, unused:63980406; list nodes free:257812538

before gc: list nodes free: 1881824

after gc: idd nodes used:22624, unused:63977376; list nodes free:257791328

before gc: list nodes free: 1873814

after gc: idd nodes used:25294, unused:63974706; list nodes free:257772638

before gc: list nodes free: 1866572

after gc: idd nodes used:27708, unused:63972292; list nodes free:257755740

before gc: list nodes free: 1859915

after gc: idd nodes used:29927, unused:63970073; list nodes free:257740207

before gc: list nodes free: 1853717

after gc: idd nodes used:31993, unused:63968007; list nodes free:257725745

before gc: list nodes free: 1847897

after gc: idd nodes used:33933, unused:63966067; list nodes free:257712165

before gc: list nodes free: 1842392

after gc: idd nodes used:35768, unused:63964232; list nodes free:257699320

before gc: list nodes free: 1837157

after gc: idd nodes used:37513, unused:63962487; list nodes free:257687105

before gc: list nodes free: 1832153

after gc: idd nodes used:39181, unused:63960819; list nodes free:257675429

before gc: list nodes free: 1827356

after gc: idd nodes used:40780, unused:63959220; list nodes free:257664236

before gc: list nodes free: 1822739

after gc: idd nodes used:42319, unused:63957681; list nodes free:257653463

before gc: list nodes free: 1818284

after gc: idd nodes used:43804, unused:63956196; list nodes free:257643068

before gc: list nodes free: 1813976

after gc: idd nodes used:45240, unused:63954760; list nodes free:257633016

before gc: list nodes free: 1809800

after gc: idd nodes used:46632, unused:63953368; list nodes free:257623272

BK_STOP 1678447120575

--------------------
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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m49.421sec

/home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin//../BenchKit_head.sh: line 16: 470 Segmentation fault ${MARCIE} --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}

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-8b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is DLCflexbar-PT-8b, 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 r106-tall-167814483000614"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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