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.r457-smll-167912649300455.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 StigmergyCommit-PT-05b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r457-smll-167912649300455
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 7.3K Feb 26 10:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 10:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 26 10:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 10:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 10:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 26 10:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 10:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 10:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.4M Mar 5 18:23 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 StigmergyCommit-PT-05b-ReachabilityFireability-00
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-01
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-02
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-03
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-04
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-05
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-06
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-07
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-08
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-09
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-10
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-11
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-12
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-13
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-14
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679444811788

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-05b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 00:26:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 00:26:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 00:26:55] [INFO ] Load time of PNML (sax parser for PT used): 539 ms
[2023-03-22 00:26:55] [INFO ] Transformed 1837 places.
[2023-03-22 00:26:55] [INFO ] Transformed 3460 transitions.
[2023-03-22 00:26:55] [INFO ] Found NUPN structural information;
[2023-03-22 00:26:55] [INFO ] Parsed PT model containing 1837 places and 3460 transitions and 22362 arcs in 767 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 90 resets, run finished after 749 ms. (steps per millisecond=13 ) properties (out of 16) seen :2
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 3460 rows 1837 cols
[2023-03-22 00:26:57] [INFO ] Computed 7 place invariants in 98 ms
[2023-03-22 00:27:00] [INFO ] [Real]Absence check using 7 positive place invariants in 24 ms returned sat
[2023-03-22 00:27:00] [INFO ] After 1629ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-22 00:27:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 19 ms returned sat
[2023-03-22 00:27:07] [INFO ] After 5051ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :10
[2023-03-22 00:27:09] [INFO ] Deduced a trap composed of 397 places in 2116 ms of which 13 ms to minimize.
[2023-03-22 00:27:11] [INFO ] Deduced a trap composed of 400 places in 1690 ms of which 33 ms to minimize.
[2023-03-22 00:27:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4296 ms
[2023-03-22 00:27:13] [INFO ] Deduced a trap composed of 398 places in 2056 ms of which 3 ms to minimize.
[2023-03-22 00:27:15] [INFO ] Deduced a trap composed of 400 places in 1406 ms of which 5 ms to minimize.
[2023-03-22 00:27:16] [INFO ] Deduced a trap composed of 400 places in 1142 ms of which 1 ms to minimize.
[2023-03-22 00:27:17] [INFO ] Deduced a trap composed of 402 places in 1091 ms of which 2 ms to minimize.
[2023-03-22 00:27:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 6251 ms
[2023-03-22 00:27:20] [INFO ] Deduced a trap composed of 400 places in 1121 ms of which 1 ms to minimize.
[2023-03-22 00:27:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1409 ms
[2023-03-22 00:27:22] [INFO ] Deduced a trap composed of 404 places in 1247 ms of which 2 ms to minimize.
[2023-03-22 00:27:23] [INFO ] Deduced a trap composed of 404 places in 1052 ms of which 1 ms to minimize.
[2023-03-22 00:27:25] [INFO ] Deduced a trap composed of 398 places in 1049 ms of which 3 ms to minimize.
[2023-03-22 00:27:26] [INFO ] Deduced a trap composed of 399 places in 1115 ms of which 1 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-22 00:27:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 00:27:26] [INFO ] After 25884ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 379 ms.
Support contains 109 out of 1837 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1837/1837 places, 3460/3460 transitions.
Graph (trivial) has 1552 edges and 1837 vertex of which 97 / 1837 are part of one of the 16 SCC in 12 ms
Free SCC test removed 81 places
Drop transitions removed 103 transitions
Reduce isomorphic transitions removed 103 transitions.
Graph (complete) has 2756 edges and 1756 vertex of which 1744 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.31 ms
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 1134 transitions
Trivial Post-agglo rules discarded 1134 transitions
Performed 1134 trivial Post agglomeration. Transition count delta: 1134
Iterating post reduction 0 with 1140 rules applied. Total rules applied 1142 place count 1744 transition count 2211
Reduce places removed 1134 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 1148 rules applied. Total rules applied 2290 place count 610 transition count 2197
Reduce places removed 7 places and 0 transitions.
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Iterating post reduction 2 with 88 rules applied. Total rules applied 2378 place count 603 transition count 2116
Reduce places removed 81 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 83 rules applied. Total rules applied 2461 place count 522 transition count 2114
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 92 Pre rules applied. Total rules applied 2461 place count 522 transition count 2022
Deduced a syphon composed of 92 places in 3 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 4 with 184 rules applied. Total rules applied 2645 place count 430 transition count 2022
Discarding 87 places :
Symmetric choice reduction at 4 with 87 rule applications. Total rules 2732 place count 343 transition count 1935
Iterating global reduction 4 with 87 rules applied. Total rules applied 2819 place count 343 transition count 1935
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 8 rules applied. Total rules applied 2827 place count 343 transition count 1927
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2828 place count 342 transition count 1927
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 2846 place count 324 transition count 1909
Iterating global reduction 6 with 18 rules applied. Total rules applied 2864 place count 324 transition count 1909
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 2867 place count 324 transition count 1906
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2872 place count 319 transition count 1901
Iterating global reduction 7 with 5 rules applied. Total rules applied 2877 place count 319 transition count 1901
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2881 place count 315 transition count 1897
Iterating global reduction 7 with 4 rules applied. Total rules applied 2885 place count 315 transition count 1897
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 2888 place count 315 transition count 1894
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 8 with 32 rules applied. Total rules applied 2920 place count 299 transition count 1878
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 2926 place count 293 transition count 1872
Iterating global reduction 8 with 6 rules applied. Total rules applied 2932 place count 293 transition count 1872
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 2937 place count 288 transition count 1867
Iterating global reduction 8 with 5 rules applied. Total rules applied 2942 place count 288 transition count 1867
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 2947 place count 283 transition count 1862
Iterating global reduction 8 with 5 rules applied. Total rules applied 2952 place count 283 transition count 1862
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 2976 place count 271 transition count 1880
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 2981 place count 271 transition count 1875
Free-agglomeration rule applied 22 times.
Iterating global reduction 8 with 22 rules applied. Total rules applied 3003 place count 271 transition count 1853
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 8 with 22 rules applied. Total rules applied 3025 place count 249 transition count 1853
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 3028 place count 249 transition count 1850
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 9 with 12 rules applied. Total rules applied 3040 place count 249 transition count 1850
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 3041 place count 249 transition count 1849
Applied a total of 3041 rules in 1156 ms. Remains 249 /1837 variables (removed 1588) and now considering 1849/3460 (removed 1611) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1157 ms. Remains : 249/1837 places, 1849/3460 transitions.
Incomplete random walk after 10000 steps, including 474 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 9) seen :2
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1849 rows 249 cols
[2023-03-22 00:27:28] [INFO ] Computed 7 place invariants in 47 ms
[2023-03-22 00:27:29] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2023-03-22 00:27:29] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 00:27:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-22 00:27:30] [INFO ] After 1254ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 00:27:30] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 00:27:31] [INFO ] After 810ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-22 00:27:32] [INFO ] Deduced a trap composed of 62 places in 697 ms of which 1 ms to minimize.
[2023-03-22 00:27:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 800 ms
[2023-03-22 00:27:33] [INFO ] Deduced a trap composed of 60 places in 677 ms of which 1 ms to minimize.
[2023-03-22 00:27:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 802 ms
[2023-03-22 00:27:34] [INFO ] Deduced a trap composed of 40 places in 759 ms of which 1 ms to minimize.
[2023-03-22 00:27:35] [INFO ] Deduced a trap composed of 65 places in 847 ms of which 1 ms to minimize.
[2023-03-22 00:27:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1769 ms
[2023-03-22 00:27:35] [INFO ] After 5007ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 725 ms.
[2023-03-22 00:27:36] [INFO ] After 7168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 36 ms.
Support contains 86 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 1849/1849 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 0 with 16 rules applied. Total rules applied 16 place count 249 transition count 1833
Reduce places removed 16 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 25 rules applied. Total rules applied 41 place count 233 transition count 1824
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 51 place count 224 transition count 1823
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 51 place count 224 transition count 1816
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 65 place count 217 transition count 1816
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 68 place count 214 transition count 1813
Iterating global reduction 3 with 3 rules applied. Total rules applied 71 place count 214 transition count 1813
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 80 place count 214 transition count 1804
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 88 place count 210 transition count 1800
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 91 place count 207 transition count 1797
Iterating global reduction 4 with 3 rules applied. Total rules applied 94 place count 207 transition count 1797
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 95 place count 207 transition count 1796
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 97 place count 205 transition count 1794
Iterating global reduction 5 with 2 rules applied. Total rules applied 99 place count 205 transition count 1794
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 101 place count 203 transition count 1792
Iterating global reduction 5 with 2 rules applied. Total rules applied 103 place count 203 transition count 1792
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 104 place count 203 transition count 1791
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 106 place count 203 transition count 1789
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 110 place count 203 transition count 1785
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 114 place count 199 transition count 1785
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 115 place count 199 transition count 1785
Applied a total of 115 rules in 322 ms. Remains 199 /249 variables (removed 50) and now considering 1785/1849 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 322 ms. Remains : 199/249 places, 1785/1849 transitions.
Incomplete random walk after 10000 steps, including 594 resets, run finished after 504 ms. (steps per millisecond=19 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 234112 steps, run timeout after 3002 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 234112 steps, saw 57398 distinct states, run finished after 3006 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1785 rows 199 cols
[2023-03-22 00:27:40] [INFO ] Computed 7 place invariants in 18 ms
[2023-03-22 00:27:41] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-22 00:27:41] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 00:27:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-22 00:27:42] [INFO ] After 1226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 00:27:42] [INFO ] State equation strengthened by 106 read => feed constraints.
[2023-03-22 00:27:43] [INFO ] After 867ms SMT Verify possible using 106 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-22 00:27:44] [INFO ] Deduced a trap composed of 52 places in 683 ms of which 1 ms to minimize.
[2023-03-22 00:27:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 787 ms
[2023-03-22 00:27:45] [INFO ] Deduced a trap composed of 49 places in 727 ms of which 1 ms to minimize.
[2023-03-22 00:27:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 844 ms
[2023-03-22 00:27:46] [INFO ] Deduced a trap composed of 49 places in 631 ms of which 1 ms to minimize.
[2023-03-22 00:27:47] [INFO ] Deduced a trap composed of 50 places in 688 ms of which 0 ms to minimize.
[2023-03-22 00:27:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1481 ms
[2023-03-22 00:27:47] [INFO ] After 4706ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 648 ms.
[2023-03-22 00:27:47] [INFO ] After 6754ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 57 ms.
Support contains 86 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 1785/1785 transitions.
Applied a total of 0 rules in 45 ms. Remains 199 /199 variables (removed 0) and now considering 1785/1785 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 199/199 places, 1785/1785 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 1785/1785 transitions.
Applied a total of 0 rules in 48 ms. Remains 199 /199 variables (removed 0) and now considering 1785/1785 (removed 0) transitions.
[2023-03-22 00:27:47] [INFO ] Invariant cache hit.
[2023-03-22 00:27:48] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-22 00:27:48] [INFO ] Invariant cache hit.
[2023-03-22 00:27:48] [INFO ] State equation strengthened by 106 read => feed constraints.
[2023-03-22 00:27:48] [INFO ] Implicit Places using invariants and state equation in 737 ms returned []
Implicit Place search using SMT with State Equation took 843 ms to find 0 implicit places.
[2023-03-22 00:27:48] [INFO ] Redundant transitions in 150 ms returned []
[2023-03-22 00:27:48] [INFO ] Invariant cache hit.
[2023-03-22 00:27:50] [INFO ] Dead Transitions using invariants and state equation in 1603 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2655 ms. Remains : 199/199 places, 1785/1785 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 199 transition count 1773
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 14 rules applied. Total rules applied 26 place count 187 transition count 1771
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 28 place count 185 transition count 1771
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 28 place count 185 transition count 1770
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 184 transition count 1770
Performed 11 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 52 place count 173 transition count 1753
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 66 place count 173 transition count 1739
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 68 place count 172 transition count 1741
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 73 place count 172 transition count 1736
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 77 place count 170 transition count 1734
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 80 place count 170 transition count 1731
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 83 place count 167 transition count 1731
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 84 place count 167 transition count 1730
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 95 place count 167 transition count 1730
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 97 place count 167 transition count 1728
Applied a total of 97 rules in 287 ms. Remains 167 /199 variables (removed 32) and now considering 1728/1785 (removed 57) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 1728 rows 167 cols
[2023-03-22 00:27:50] [INFO ] Computed 7 place invariants in 14 ms
[2023-03-22 00:27:51] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-22 00:27:51] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 00:27:51] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-22 00:27:52] [INFO ] After 1392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 00:27:53] [INFO ] Deduced a trap composed of 40 places in 682 ms of which 1 ms to minimize.
[2023-03-22 00:27:54] [INFO ] Deduced a trap composed of 45 places in 669 ms of which 1 ms to minimize.
[2023-03-22 00:27:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1493 ms
[2023-03-22 00:27:55] [INFO ] Deduced a trap composed of 40 places in 639 ms of which 1 ms to minimize.
[2023-03-22 00:27:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 755 ms
[2023-03-22 00:27:56] [INFO ] Deduced a trap composed of 53 places in 726 ms of which 0 ms to minimize.
[2023-03-22 00:27:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 813 ms
[2023-03-22 00:27:56] [INFO ] After 5252ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 691 ms.
[2023-03-22 00:27:57] [INFO ] After 6085ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2023-03-22 00:27:57] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-22 00:27:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 199 places, 1785 transitions and 19052 arcs took 23 ms.
[2023-03-22 00:27:58] [INFO ] Flatten gal took : 567 ms
Total runtime 63673 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 --inv-bin-par --invariant=/tmp/575/inv_0_ --invariant=/tmp/575/inv_1_ --invariant=/tmp/575/inv_2_ --invariant=/tmp/575/inv_3_ --invariant=/tmp/575/inv_4_ --invariant=/tmp/575/inv_5_ --invariant=/tmp/575/inv_6_ --inv-par
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679446820630

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name StigmergyCommit-PT-05b-ReachabilityFireability-00
rfs formula type EF
rfs formula formula --invariant=/tmp/575/inv_0_
rfs formula name StigmergyCommit-PT-05b-ReachabilityFireability-02
rfs formula type AG
rfs formula formula --invariant=/tmp/575/inv_1_
rfs formula name StigmergyCommit-PT-05b-ReachabilityFireability-03
rfs formula type EF
rfs formula formula --invariant=/tmp/575/inv_2_
rfs formula name StigmergyCommit-PT-05b-ReachabilityFireability-08
rfs formula type AG
rfs formula formula --invariant=/tmp/575/inv_3_
rfs formula name StigmergyCommit-PT-05b-ReachabilityFireability-09
rfs formula type EF
rfs formula formula --invariant=/tmp/575/inv_4_
rfs formula name StigmergyCommit-PT-05b-ReachabilityFireability-14
rfs formula type EF
rfs formula formula --invariant=/tmp/575/inv_5_
rfs formula name StigmergyCommit-PT-05b-ReachabilityFireability-15
rfs formula type EF
rfs formula formula --invariant=/tmp/575/inv_6_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 199 places, 1785 transitions and 19052 arcs
pnml2lts-sym: Petri net StigmergyCommit_PT_05b analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.040 real 0.030 user 0.010 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 1785->1749 groups
pnml2lts-sym: Regrouping took 2.110 real 2.110 user 0.000 sys
pnml2lts-sym: state vector length is 199; there are 1749 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/575/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/575/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/575/inv_2_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/575/inv_4_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/575/inv_5_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/575/inv_6_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/575/inv_3_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 1909.830 real 7623.620 user 2.910 sys
pnml2lts-sym: max token count: 1

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="StigmergyCommit-PT-05b"
export BK_EXAMINATION="ReachabilityFireability"
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 StigmergyCommit-PT-05b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r457-smll-167912649300455"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-05b.tgz
mv StigmergyCommit-PT-05b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;