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.r233-tall-167856419400774.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 MultiCrashLeafsetExtension-PT-S16C05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419400774
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 14K Feb 26 02:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 02:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 02:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 02:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 02:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 02:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 02:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.6M 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 MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679608891082

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=MultiCrashLeafsetExtension-PT-S16C05
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 22:01:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 22:01:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 22:01:32] [INFO ] Load time of PNML (sax parser for PT used): 268 ms
[2023-03-23 22:01:32] [INFO ] Transformed 4914 places.
[2023-03-23 22:01:32] [INFO ] Transformed 6913 transitions.
[2023-03-23 22:01:32] [INFO ] Parsed PT model containing 4914 places and 6913 transitions and 26710 arcs in 433 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 192 resets, run finished after 611 ms. (steps per millisecond=16 ) properties (out of 16) seen :2
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 14) seen :2
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 12) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-23 22:01:34] [INFO ] Flow matrix only has 6641 transitions (discarded 272 similar events)
// Phase 1: matrix 6641 rows 4914 cols
[2023-03-23 22:01:35] [INFO ] Computed 535 place invariants in 333 ms
[2023-03-23 22:01:36] [INFO ] [Real]Absence check using 48 positive place invariants in 26 ms returned sat
[2023-03-23 22:01:37] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 223 ms returned sat
[2023-03-23 22:01:37] [INFO ] After 1793ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:8
[2023-03-23 22:01:38] [INFO ] [Nat]Absence check using 48 positive place invariants in 23 ms returned sat
[2023-03-23 22:01:38] [INFO ] [Nat]Absence check using 48 positive and 487 generalized place invariants in 212 ms returned sat
[2023-03-23 22:01:44] [INFO ] After 5531ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :2
[2023-03-23 22:01:44] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2023-03-23 22:01:55] [INFO ] After 11619ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :9 sat :1
[2023-03-23 22:02:03] [INFO ] Deduced a trap composed of 843 places in 5212 ms of which 19 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-23 22:02:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 22:02:03] [INFO ] After 26722ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0 real:8
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 28 out of 4914 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4914/4914 places, 6913/6913 transitions.
Graph (complete) has 15675 edges and 4914 vertex of which 4884 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.16 ms
Discarding 30 places :
Also discarding 0 output transitions
Drop transitions removed 1339 transitions
Trivial Post-agglo rules discarded 1339 transitions
Performed 1339 trivial Post agglomeration. Transition count delta: 1339
Iterating post reduction 0 with 1339 rules applied. Total rules applied 1340 place count 4884 transition count 5574
Reduce places removed 1339 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 1354 rules applied. Total rules applied 2694 place count 3545 transition count 5559
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 2709 place count 3530 transition count 5559
Performed 169 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 169 Pre rules applied. Total rules applied 2709 place count 3530 transition count 5390
Deduced a syphon composed of 169 places in 5 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 3 with 338 rules applied. Total rules applied 3047 place count 3361 transition count 5390
Discarding 1177 places :
Symmetric choice reduction at 3 with 1177 rule applications. Total rules 4224 place count 2184 transition count 4213
Iterating global reduction 3 with 1177 rules applied. Total rules applied 5401 place count 2184 transition count 4213
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 5401 place count 2184 transition count 4212
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5403 place count 2183 transition count 4212
Discarding 222 places :
Symmetric choice reduction at 3 with 222 rule applications. Total rules 5625 place count 1961 transition count 3102
Iterating global reduction 3 with 222 rules applied. Total rules applied 5847 place count 1961 transition count 3102
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 5881 place count 1944 transition count 3085
Free-agglomeration rule (complex) applied 167 times.
Iterating global reduction 3 with 167 rules applied. Total rules applied 6048 place count 1944 transition count 3698
Reduce places removed 167 places and 0 transitions.
Iterating post reduction 3 with 167 rules applied. Total rules applied 6215 place count 1777 transition count 3698
Partial Free-agglomeration rule applied 152 times.
Drop transitions removed 152 transitions
Iterating global reduction 4 with 152 rules applied. Total rules applied 6367 place count 1777 transition count 3698
Applied a total of 6367 rules in 1640 ms. Remains 1777 /4914 variables (removed 3137) and now considering 3698/6913 (removed 3215) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1644 ms. Remains : 1777/4914 places, 3698/6913 transitions.
Incomplete random walk after 10000 steps, including 311 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 56 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 59247 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59247 steps, saw 26553 distinct states, run finished after 3003 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 22:02:08] [INFO ] Flow matrix only has 3302 transitions (discarded 396 similar events)
// Phase 1: matrix 3302 rows 1777 cols
[2023-03-23 22:02:08] [INFO ] Computed 505 place invariants in 75 ms
[2023-03-23 22:02:09] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 22:02:09] [INFO ] [Nat]Absence check using 33 positive place invariants in 30 ms returned sat
[2023-03-23 22:02:09] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 101 ms returned sat
[2023-03-23 22:02:11] [INFO ] After 1540ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 22:02:11] [INFO ] State equation strengthened by 1798 read => feed constraints.
[2023-03-23 22:02:13] [INFO ] After 2526ms SMT Verify possible using 1798 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-23 22:02:15] [INFO ] Deduced a trap composed of 163 places in 1217 ms of which 3 ms to minimize.
[2023-03-23 22:02:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1473 ms
[2023-03-23 22:02:15] [INFO ] After 4431ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 379 ms.
[2023-03-23 22:02:16] [INFO ] After 6822ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 25 out of 1777 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1777/1777 places, 3698/3698 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1777 transition count 3697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1776 transition count 3697
Applied a total of 2 rules in 230 ms. Remains 1776 /1777 variables (removed 1) and now considering 3697/3698 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 231 ms. Remains : 1776/1777 places, 3697/3698 transitions.
Incomplete random walk after 10000 steps, including 312 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 66983 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66983 steps, saw 29988 distinct states, run finished after 3005 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 22:02:19] [INFO ] Flow matrix only has 3300 transitions (discarded 397 similar events)
// Phase 1: matrix 3300 rows 1776 cols
[2023-03-23 22:02:19] [INFO ] Computed 505 place invariants in 53 ms
[2023-03-23 22:02:19] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 22:02:19] [INFO ] [Nat]Absence check using 33 positive place invariants in 28 ms returned sat
[2023-03-23 22:02:20] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 114 ms returned sat
[2023-03-23 22:02:21] [INFO ] After 1268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 22:02:21] [INFO ] State equation strengthened by 1798 read => feed constraints.
[2023-03-23 22:02:21] [INFO ] After 569ms SMT Verify possible using 1798 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 22:02:22] [INFO ] After 1170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 281 ms.
[2023-03-23 22:02:22] [INFO ] After 3127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 25 out of 1776 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1776/1776 places, 3697/3697 transitions.
Applied a total of 0 rules in 106 ms. Remains 1776 /1776 variables (removed 0) and now considering 3697/3697 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 1776/1776 places, 3697/3697 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1776/1776 places, 3697/3697 transitions.
Applied a total of 0 rules in 104 ms. Remains 1776 /1776 variables (removed 0) and now considering 3697/3697 (removed 0) transitions.
[2023-03-23 22:02:23] [INFO ] Flow matrix only has 3300 transitions (discarded 397 similar events)
[2023-03-23 22:02:23] [INFO ] Invariant cache hit.
[2023-03-23 22:02:26] [INFO ] Implicit Places using invariants in 3197 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 18, 24, 32, 42, 54, 68, 83, 97, 98, 99, 100, 101, 102, 114, 124, 132, 138, 142, 144, 157, 163, 165, 166, 167, 168, 169, 170, 172, 176, 182, 190, 200, 212, 225, 237, 239, 240, 241, 242, 253, 261, 267, 271, 273, 275, 288, 294, 296, 297, 298, 299, 300, 301, 303, 305, 309, 315, 323, 333, 344, 355, 356, 357, 358, 359, 360, 368, 374, 378, 381, 383, 386, 399, 405, 407, 408, 410, 413, 416, 418, 422, 426, 432, 440, 449, 457, 458, 459, 461, 462, 468, 472, 475, 477, 479, 481, 494, 500, 502, 503, 504, 505, 506, 507, 509, 511, 513, 515, 519, 525, 532, 538, 539, 540, 541, 542, 543, 547, 549, 551, 553, 555, 557, 570, 576, 579, 580, 581, 582, 583, 584, 586, 588, 590, 592, 594, 598, 603, 607, 608, 609, 610, 611, 612, 614, 616, 618, 620, 622, 624, 637, 643, 645, 646, 647, 648, 649, 650, 652, 654, 656, 658, 660, 662, 665, 667, 668, 669, 670, 671, 672, 674, 676, 678, 680, 682, 684, 697, 703, 705, 706, 707, 708, 709, 710, 712, 714, 716, 718, 720, 722, 724, 727, 728, 729, 730, 731, 732, 734, 736, 738, 740, 744, 757, 759, 762, 764, 765, 766, 767, 768, 769, 771, 773, 775, 777, 779, 781, 783, 785, 786, 788, 789, 790, 792, 794, 796, 799, 801, 803, 816, 822, 824, 825, 826, 827, 828, 829, 831, 833, 835, 837, 839, 841, 843, 846, 847, 848, 849, 850, 851, 853, 855, 857, 859, 863, 876, 882, 884, 885, 886, 887, 888, 889, 891, 893, 895, 897, 899, 901, 903, 906, 908, 910, 911, 913, 917, 920, 922, 924, 926, 939, 945, 947, 948, 949, 951, 952, 954, 956, 958, 962, 964, 966, 970, 975, 976, 977, 978, 979, 980, 984, 986, 988, 990, 992, 994, 1007, 1013, 1015, 1016, 1017, 1018, 1019, 1020, 1022, 1024, 1026, 1028, 1030, 1035, 1041, 1048, 1049, 1050, 1051, 1052, 1053, 1059, 1063, 1065, 1067, 1069, 1071, 1084, 1090, 1092, 1095, 1096, 1097, 1100, 1102, 1105, 1107, 1111, 1117, 1125, 1134, 1135, 1136, 1137, 1138, 1139, 1147, 1153, 1157, 1159, 1161, 1163, 1176, 1182, 1184, 1185, 1186, 1187, 1188, 1189, 1191, 1193, 1195, 1199, 1205, 1213, 1223, 1234, 1235, 1236, 1237, 1239, 1250, 1258, 1264, 1268, 1270, 1272, 1285, 1291, 1293, 1295, 1296, 1297, 1298, 1300, 1302, 1306, 1314, 1322, 1332, 1344, 1358, 1359, 1360, 1361, 1362, 1374, 1384, 1394, 1400, 1404, 1406, 1420, 1422, 1425, 1427, 1428, 1429, 1430, 1431, 1432, 1434, 1439, 1445, 1453, 1463, 1475, 1489, 1504, 1505, 1506, 1507, 1508, 1509, 1523, 1535, 1545, 1553, 1559, 1563, 1576]
Discarding 447 places :
Implicit Place search using SMT only with invariants took 3208 ms to find 447 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1329/1776 places, 3697/3697 transitions.
Discarding 146 places :
Symmetric choice reduction at 0 with 146 rule applications. Total rules 146 place count 1183 transition count 3551
Iterating global reduction 0 with 146 rules applied. Total rules applied 292 place count 1183 transition count 3551
Discarding 145 places :
Symmetric choice reduction at 0 with 145 rule applications. Total rules 437 place count 1038 transition count 3406
Iterating global reduction 0 with 145 rules applied. Total rules applied 582 place count 1038 transition count 3406
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 584 place count 1036 transition count 3396
Iterating global reduction 0 with 2 rules applied. Total rules applied 586 place count 1036 transition count 3396
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 589 place count 1036 transition count 3393
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 592 place count 1033 transition count 3393
Applied a total of 592 rules in 244 ms. Remains 1033 /1329 variables (removed 296) and now considering 3393/3697 (removed 304) transitions.
[2023-03-23 22:02:26] [INFO ] Flow matrix only has 2996 transitions (discarded 397 similar events)
// Phase 1: matrix 2996 rows 1033 cols
[2023-03-23 22:02:26] [INFO ] Computed 58 place invariants in 46 ms
[2023-03-23 22:02:27] [INFO ] Implicit Places using invariants in 1160 ms returned []
[2023-03-23 22:02:27] [INFO ] Flow matrix only has 2996 transitions (discarded 397 similar events)
[2023-03-23 22:02:27] [INFO ] Invariant cache hit.
[2023-03-23 22:02:28] [INFO ] State equation strengthened by 1790 read => feed constraints.
[2023-03-23 22:02:46] [INFO ] Implicit Places using invariants and state equation in 18699 ms returned []
Implicit Place search using SMT with State Equation took 19869 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1033/1776 places, 3393/3697 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 23426 ms. Remains : 1033/1776 places, 3393/3697 transitions.
Incomplete random walk after 10000 steps, including 332 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 76907 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76907 steps, saw 32598 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 22:02:49] [INFO ] Flow matrix only has 2996 transitions (discarded 397 similar events)
[2023-03-23 22:02:49] [INFO ] Invariant cache hit.
[2023-03-23 22:02:49] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 22:02:49] [INFO ] [Nat]Absence check using 32 positive place invariants in 23 ms returned sat
[2023-03-23 22:02:49] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 4 ms returned sat
[2023-03-23 22:02:51] [INFO ] After 1216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 22:02:51] [INFO ] State equation strengthened by 1790 read => feed constraints.
[2023-03-23 22:02:51] [INFO ] After 377ms SMT Verify possible using 1790 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 22:02:51] [INFO ] After 567ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 394 ms.
[2023-03-23 22:02:52] [INFO ] After 2356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 25 out of 1033 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1033/1033 places, 3393/3393 transitions.
Applied a total of 0 rules in 83 ms. Remains 1033 /1033 variables (removed 0) and now considering 3393/3393 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 1033/1033 places, 3393/3393 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1033/1033 places, 3393/3393 transitions.
Applied a total of 0 rules in 77 ms. Remains 1033 /1033 variables (removed 0) and now considering 3393/3393 (removed 0) transitions.
[2023-03-23 22:02:52] [INFO ] Flow matrix only has 2996 transitions (discarded 397 similar events)
[2023-03-23 22:02:52] [INFO ] Invariant cache hit.
[2023-03-23 22:02:53] [INFO ] Implicit Places using invariants in 1138 ms returned []
[2023-03-23 22:02:53] [INFO ] Flow matrix only has 2996 transitions (discarded 397 similar events)
[2023-03-23 22:02:53] [INFO ] Invariant cache hit.
[2023-03-23 22:02:54] [INFO ] State equation strengthened by 1790 read => feed constraints.
[2023-03-23 22:03:11] [INFO ] Implicit Places using invariants and state equation in 17742 ms returned []
Implicit Place search using SMT with State Equation took 18885 ms to find 0 implicit places.
[2023-03-23 22:03:11] [INFO ] Redundant transitions in 234 ms returned []
[2023-03-23 22:03:11] [INFO ] Flow matrix only has 2996 transitions (discarded 397 similar events)
[2023-03-23 22:03:11] [INFO ] Invariant cache hit.
[2023-03-23 22:03:12] [INFO ] Dead Transitions using invariants and state equation in 1326 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20542 ms. Remains : 1033/1033 places, 3393/3393 transitions.
Graph (trivial) has 1065 edges and 1033 vertex of which 17 / 1033 are part of one of the 1 SCC in 4 ms
Free SCC test removed 16 places
Drop transitions removed 298 transitions
Ensure Unique test removed 371 transitions
Reduce isomorphic transitions removed 669 transitions.
Graph (complete) has 4133 edges and 1017 vertex of which 1003 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition Node6DetectsThatNode9CanReplaceNode8.Node9IsBecomingTheNewNodeMaster and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 97 rules applied. Total rules applied 99 place count 984 transition count 2627
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 1 with 284 rules applied. Total rules applied 383 place count 889 transition count 2438
Reduce places removed 94 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 94 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 2 with 258 rules applied. Total rules applied 641 place count 795 transition count 2274
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 3 with 208 rules applied. Total rules applied 849 place count 725 transition count 2136
Reduce places removed 68 places and 0 transitions.
Drop transitions removed 19 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 68 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 4 with 185 rules applied. Total rules applied 1034 place count 657 transition count 2019
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 5 with 145 rules applied. Total rules applied 1179 place count 608 transition count 1923
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 15 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 6 with 126 rules applied. Total rules applied 1305 place count 561 transition count 1844
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 7 with 94 rules applied. Total rules applied 1399 place count 529 transition count 1782
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 8 with 78 rules applied. Total rules applied 1477 place count 499 transition count 1734
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 52 rules applied. Total rules applied 1529 place count 481 transition count 1700
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 40 rules applied. Total rules applied 1569 place count 465 transition count 1676
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 22 rules applied. Total rules applied 1591 place count 457 transition count 1662
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 14 rules applied. Total rules applied 1605 place count 451 transition count 1654
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 13 with 6 rules applied. Total rules applied 1611 place count 449 transition count 1650
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 1615 place count 447 transition count 1648
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 23 Pre rules applied. Total rules applied 1615 place count 447 transition count 1625
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 15 with 46 rules applied. Total rules applied 1661 place count 424 transition count 1625
Discarding 251 places :
Symmetric choice reduction at 15 with 251 rule applications. Total rules 1912 place count 173 transition count 534
Iterating global reduction 15 with 251 rules applied. Total rules applied 2163 place count 173 transition count 534
Ensure Unique test removed 143 transitions
Reduce isomorphic transitions removed 143 transitions.
Iterating post reduction 15 with 143 rules applied. Total rules applied 2306 place count 173 transition count 391
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2306 place count 173 transition count 390
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2308 place count 172 transition count 390
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 16 with 32 rules applied. Total rules applied 2340 place count 156 transition count 374
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 2344 place count 156 transition count 370
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 2348 place count 154 transition count 384
Discarding 2 places :
Symmetric choice reduction at 17 with 2 rule applications. Total rules 2350 place count 152 transition count 374
Iterating global reduction 17 with 2 rules applied. Total rules applied 2352 place count 152 transition count 374
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 17 with 15 rules applied. Total rules applied 2367 place count 152 transition count 359
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 18 with 2 rules applied. Total rules applied 2369 place count 152 transition count 357
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 18 with 6 rules applied. Total rules applied 2375 place count 152 transition count 351
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 2381 place count 146 transition count 351
Partial Free-agglomeration rule applied 104 times.
Drop transitions removed 104 transitions
Iterating global reduction 19 with 104 rules applied. Total rules applied 2485 place count 146 transition count 351
Applied a total of 2485 rules in 586 ms. Remains 146 /1033 variables (removed 887) and now considering 351/3393 (removed 3042) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 351 rows 146 cols
[2023-03-23 22:03:13] [INFO ] Computed 26 place invariants in 11 ms
[2023-03-23 22:03:13] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 22:03:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 22:03:13] [INFO ] [Nat]Absence check using 3 positive and 23 generalized place invariants in 5 ms returned sat
[2023-03-23 22:03:13] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 22:03:13] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-23 22:03:13] [INFO ] After 194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-23 22:03:13] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-23 22:03:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1033 places, 3393 transitions and 16867 arcs took 21 ms.
[2023-03-23 22:03:14] [INFO ] Flatten gal took : 281 ms
Total runtime 101583 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/527/inv_0_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14950312 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16089240 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="MultiCrashLeafsetExtension-PT-S16C05"
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 MultiCrashLeafsetExtension-PT-S16C05, 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 r233-tall-167856419400774"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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