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.r394-oct2-167903717600167.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldIIPs-PT-100A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717600167
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 9.3K Feb 25 16:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 16:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 15:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 25 15:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 16:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 868K 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 ShieldIIPs-PT-100A-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679496231789

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-100A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 14:43:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 14:43:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 14:43:54] [INFO ] Load time of PNML (sax parser for PT used): 250 ms
[2023-03-22 14:43:54] [INFO ] Transformed 2503 places.
[2023-03-22 14:43:54] [INFO ] Transformed 2403 transitions.
[2023-03-22 14:43:54] [INFO ] Found NUPN structural information;
[2023-03-22 14:43:54] [INFO ] Parsed PT model containing 2503 places and 2403 transitions and 10806 arcs in 439 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 611 ms. (steps per millisecond=16 ) properties (out of 16) seen :10
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-22 14:43:56] [INFO ] Computed 901 place invariants in 43 ms
[2023-03-22 14:43:58] [INFO ] [Real]Absence check using 901 positive place invariants in 523 ms returned sat
[2023-03-22 14:43:58] [INFO ] After 1836ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 14:43:59] [INFO ] [Nat]Absence check using 901 positive place invariants in 239 ms returned sat
[2023-03-22 14:44:13] [INFO ] After 13057ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-22 14:44:13] [INFO ] Deduced a trap composed of 9 places in 215 ms of which 20 ms to minimize.
[2023-03-22 14:44:13] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 2 ms to minimize.
[2023-03-22 14:44:14] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 16 ms to minimize.
[2023-03-22 14:44:14] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2023-03-22 14:44:14] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 1 ms to minimize.
[2023-03-22 14:44:14] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2023-03-22 14:44:15] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2023-03-22 14:44:15] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 1 ms to minimize.
[2023-03-22 14:44:15] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2237 ms
[2023-03-22 14:44:23] [INFO ] Deduced a trap composed of 9 places in 324 ms of which 1 ms to minimize.
[2023-03-22 14:44:23] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 963 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
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 14:44:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 14:44:23] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 1866 ms.
Support contains 217 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 24 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 590 times.
Drop transitions removed 590 transitions
Iterating global reduction 0 with 590 rules applied. Total rules applied 594 place count 2501 transition count 2401
Applied a total of 594 rules in 658 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 659 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 444 ms. (steps per millisecond=22 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 62190 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 62190 steps, saw 58938 distinct states, run finished after 3003 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-22 14:44:30] [INFO ] Computed 901 place invariants in 65 ms
[2023-03-22 14:44:32] [INFO ] [Real]Absence check using 873 positive place invariants in 734 ms returned sat
[2023-03-22 14:44:32] [INFO ] [Real]Absence check using 873 positive and 28 generalized place invariants in 7 ms returned sat
[2023-03-22 14:44:32] [INFO ] After 1425ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 14:44:33] [INFO ] [Nat]Absence check using 873 positive place invariants in 297 ms returned sat
[2023-03-22 14:44:33] [INFO ] [Nat]Absence check using 873 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-22 14:44:54] [INFO ] After 20922ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 14:44:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 14:44:57] [INFO ] After 2847ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 14:44:57] [INFO ] After 2847ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-22 14:44:57] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1538 ms.
Support contains 217 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 85 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 101 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-22 14:44:58] [INFO ] Invariant cache hit.
[2023-03-22 14:45:01] [INFO ] Implicit Places using invariants in 2030 ms returned []
[2023-03-22 14:45:01] [INFO ] Invariant cache hit.
[2023-03-22 14:45:02] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 14:45:06] [INFO ] Implicit Places using invariants and state equation in 5930 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 8000 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 122 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8225 ms. Remains : 2500/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 54084 steps, run timeout after 3009 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 54084 steps, saw 51372 distinct states, run finished after 3009 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-22 14:45:11] [INFO ] Computed 900 place invariants in 53 ms
[2023-03-22 14:45:12] [INFO ] [Real]Absence check using 872 positive place invariants in 279 ms returned sat
[2023-03-22 14:45:12] [INFO ] [Real]Absence check using 872 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-22 14:45:12] [INFO ] After 973ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 14:45:13] [INFO ] [Nat]Absence check using 872 positive place invariants in 287 ms returned sat
[2023-03-22 14:45:13] [INFO ] [Nat]Absence check using 872 positive and 28 generalized place invariants in 6 ms returned sat
[2023-03-22 14:45:32] [INFO ] After 19020ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 14:45:32] [INFO ] Deduced a trap composed of 5 places in 265 ms of which 1 ms to minimize.
[2023-03-22 14:45:33] [INFO ] Deduced a trap composed of 5 places in 219 ms of which 0 ms to minimize.
[2023-03-22 14:45:33] [INFO ] Deduced a trap composed of 8 places in 437 ms of which 1 ms to minimize.
[2023-03-22 14:45:34] [INFO ] Deduced a trap composed of 5 places in 252 ms of which 1 ms to minimize.
[2023-03-22 14:45:34] [INFO ] Deduced a trap composed of 5 places in 475 ms of which 1 ms to minimize.
[2023-03-22 14:45:35] [INFO ] Deduced a trap composed of 18 places in 324 ms of which 0 ms to minimize.
[2023-03-22 14:45:35] [INFO ] Deduced a trap composed of 6 places in 249 ms of which 1 ms to minimize.
[2023-03-22 14:45:35] [INFO ] Deduced a trap composed of 8 places in 364 ms of which 1 ms to minimize.
[2023-03-22 14:45:36] [INFO ] Deduced a trap composed of 15 places in 305 ms of which 0 ms to minimize.
[2023-03-22 14:45:36] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 0 ms to minimize.
[2023-03-22 14:45:36] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 1 ms to minimize.
[2023-03-22 14:45:37] [INFO ] Deduced a trap composed of 5 places in 375 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 14:45:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 14:45:37] [INFO ] After 25233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 851 ms.
Support contains 217 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 77 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 72 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-22 14:45:38] [INFO ] Invariant cache hit.
[2023-03-22 14:45:40] [INFO ] Implicit Places using invariants in 2182 ms returned []
[2023-03-22 14:45:40] [INFO ] Invariant cache hit.
[2023-03-22 14:45:47] [INFO ] Implicit Places using invariants and state equation in 6378 ms returned []
Implicit Place search using SMT with State Equation took 8566 ms to find 0 implicit places.
[2023-03-22 14:45:47] [INFO ] Redundant transitions in 552 ms returned []
[2023-03-22 14:45:47] [INFO ] Invariant cache hit.
[2023-03-22 14:45:50] [INFO ] Dead Transitions using invariants and state equation in 2546 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11777 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 83 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-22 14:45:50] [INFO ] Invariant cache hit.
[2023-03-22 14:45:51] [INFO ] [Real]Absence check using 872 positive place invariants in 181 ms returned sat
[2023-03-22 14:45:51] [INFO ] [Real]Absence check using 872 positive and 28 generalized place invariants in 26 ms returned sat
[2023-03-22 14:45:51] [INFO ] After 991ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 14:45:52] [INFO ] [Nat]Absence check using 872 positive place invariants in 265 ms returned sat
[2023-03-22 14:45:52] [INFO ] [Nat]Absence check using 872 positive and 28 generalized place invariants in 7 ms returned sat
[2023-03-22 14:46:17] [INFO ] After 25021ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 14:46:19] [INFO ] Deduced a trap composed of 8 places in 213 ms of which 1 ms to minimize.
[2023-03-22 14:46:19] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 1 ms to minimize.
[2023-03-22 14:46:20] [INFO ] Deduced a trap composed of 5 places in 301 ms of which 0 ms to minimize.
[2023-03-22 14:46:20] [INFO ] Deduced a trap composed of 8 places in 227 ms of which 0 ms to minimize.
[2023-03-22 14:46:20] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 1 ms to minimize.
[2023-03-22 14:46:26] [INFO ] Deduced a trap composed of 5 places in 303 ms of which 0 ms to minimize.
[2023-03-22 14:46:26] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 1 ms to minimize.
[2023-03-22 14:46:26] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 1 ms to minimize.
[2023-03-22 14:46:26] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 1 ms to minimize.
[2023-03-22 14:46:27] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 1 ms to minimize.
[2023-03-22 14:46:27] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 1 ms to minimize.
[2023-03-22 14:46:27] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 0 ms to minimize.
[2023-03-22 14:46:27] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 15 ms to minimize.
[2023-03-22 14:46:27] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2023-03-22 14:46:28] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 1 ms to minimize.
[2023-03-22 14:46:28] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 1 ms to minimize.
[2023-03-22 14:46:28] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 1 ms to minimize.
[2023-03-22 14:46:29] [INFO ] Deduced a trap composed of 6 places in 276 ms of which 1 ms to minimize.
[2023-03-22 14:46:30] [INFO ] Deduced a trap composed of 5 places in 267 ms of which 1 ms to minimize.
[2023-03-22 14:46:30] [INFO ] Deduced a trap composed of 5 places in 176 ms of which 1 ms to minimize.
[2023-03-22 14:46:31] [INFO ] Deduced a trap composed of 12 places in 262 ms of which 1 ms to minimize.
[2023-03-22 14:46:31] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 0 ms to minimize.
[2023-03-22 14:46:31] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 1 ms to minimize.
[2023-03-22 14:46:31] [INFO ] Deduced a trap composed of 5 places in 294 ms of which 0 ms to minimize.
[2023-03-22 14:46:32] [INFO ] Deduced a trap composed of 5 places in 223 ms of which 1 ms to minimize.
[2023-03-22 14:46:32] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 0 ms to minimize.
[2023-03-22 14:46:32] [INFO ] Deduced a trap composed of 6 places in 254 ms of which 1 ms to minimize.
[2023-03-22 14:46:33] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 0 ms to minimize.
[2023-03-22 14:46:33] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 1 ms to minimize.
[2023-03-22 14:46:33] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 13 ms to minimize.
[2023-03-22 14:46:34] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2023-03-22 14:46:34] [INFO ] Deduced a trap composed of 15 places in 222 ms of which 1 ms to minimize.
[2023-03-22 14:46:34] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 0 ms to minimize.
[2023-03-22 14:46:34] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 1 ms to minimize.
[2023-03-22 14:46:35] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 15947 ms
[2023-03-22 14:46:35] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 0 ms to minimize.
[2023-03-22 14:46:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 386 ms
[2023-03-22 14:46:45] [INFO ] Deduced a trap composed of 9 places in 414 ms of which 1 ms to minimize.
[2023-03-22 14:46:45] [INFO ] Deduced a trap composed of 15 places in 406 ms of which 1 ms to minimize.
[2023-03-22 14:46:46] [INFO ] Deduced a trap composed of 12 places in 375 ms of which 0 ms to minimize.
[2023-03-22 14:46:47] [INFO ] Deduced a trap composed of 13 places in 406 ms of which 0 ms to minimize.
[2023-03-22 14:46:47] [INFO ] Deduced a trap composed of 9 places in 342 ms of which 0 ms to minimize.
[2023-03-22 14:46:48] [INFO ] Deduced a trap composed of 9 places in 381 ms of which 1 ms to minimize.
[2023-03-22 14:46:48] [INFO ] Deduced a trap composed of 9 places in 510 ms of which 0 ms to minimize.
[2023-03-22 14:46:49] [INFO ] Deduced a trap composed of 9 places in 426 ms of which 2 ms to minimize.
[2023-03-22 14:46:50] [INFO ] Deduced a trap composed of 9 places in 354 ms of which 1 ms to minimize.
[2023-03-22 14:46:50] [INFO ] Deduced a trap composed of 9 places in 504 ms of which 13 ms to minimize.
[2023-03-22 14:46:51] [INFO ] Deduced a trap composed of 15 places in 450 ms of which 1 ms to minimize.
[2023-03-22 14:46:52] [INFO ] Deduced a trap composed of 9 places in 442 ms of which 11 ms to minimize.
[2023-03-22 14:46:52] [INFO ] Deduced a trap composed of 21 places in 340 ms of which 1 ms to minimize.
[2023-03-22 14:46:53] [INFO ] Deduced a trap composed of 15 places in 331 ms of which 1 ms to minimize.
[2023-03-22 14:46:53] [INFO ] Deduced a trap composed of 14 places in 323 ms of which 0 ms to minimize.
[2023-03-22 14:46:54] [INFO ] Deduced a trap composed of 9 places in 331 ms of which 2 ms to minimize.
[2023-03-22 14:46:54] [INFO ] Deduced a trap composed of 27 places in 332 ms of which 1 ms to minimize.
[2023-03-22 14:46:55] [INFO ] Deduced a trap composed of 9 places in 344 ms of which 1 ms to minimize.
[2023-03-22 14:46:55] [INFO ] Deduced a trap composed of 9 places in 236 ms of which 0 ms to minimize.
[2023-03-22 14:46:56] [INFO ] Deduced a trap composed of 17 places in 366 ms of which 1 ms to minimize.
[2023-03-22 14:46:56] [INFO ] Deduced a trap composed of 17 places in 252 ms of which 0 ms to minimize.
[2023-03-22 14:46:56] [INFO ] Deduced a trap composed of 9 places in 255 ms of which 1 ms to minimize.
[2023-03-22 14:46:57] [INFO ] Deduced a trap composed of 15 places in 258 ms of which 1 ms to minimize.
[2023-03-22 14:46:57] [INFO ] Deduced a trap composed of 15 places in 252 ms of which 1 ms to minimize.
[2023-03-22 14:46:59] [INFO ] Deduced a trap composed of 9 places in 333 ms of which 0 ms to minimize.
[2023-03-22 14:46:59] [INFO ] Deduced a trap composed of 9 places in 326 ms of which 0 ms to minimize.
[2023-03-22 14:47:00] [INFO ] Deduced a trap composed of 9 places in 289 ms of which 1 ms to minimize.
[2023-03-22 14:47:00] [INFO ] Deduced a trap composed of 12 places in 289 ms of which 1 ms to minimize.
[2023-03-22 14:47:01] [INFO ] Deduced a trap composed of 9 places in 578 ms of which 1 ms to minimize.
[2023-03-22 14:47:02] [INFO ] Deduced a trap composed of 9 places in 514 ms of which 1 ms to minimize.
[2023-03-22 14:47:02] [INFO ] Deduced a trap composed of 15 places in 514 ms of which 0 ms to minimize.
[2023-03-22 14:47:03] [INFO ] Deduced a trap composed of 9 places in 408 ms of which 1 ms to minimize.
[2023-03-22 14:47:03] [INFO ] Deduced a trap composed of 9 places in 253 ms of which 0 ms to minimize.
[2023-03-22 14:47:04] [INFO ] Deduced a trap composed of 9 places in 226 ms of which 0 ms to minimize.
[2023-03-22 14:47:05] [INFO ] Deduced a trap composed of 12 places in 448 ms of which 1 ms to minimize.
[2023-03-22 14:47:05] [INFO ] Deduced a trap composed of 9 places in 317 ms of which 1 ms to minimize.
[2023-03-22 14:47:05] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 0 ms to minimize.
[2023-03-22 14:47:06] [INFO ] Deduced a trap composed of 31 places in 230 ms of which 0 ms to minimize.
[2023-03-22 14:47:06] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 1 ms to minimize.
[2023-03-22 14:47:07] [INFO ] Deduced a trap composed of 14 places in 484 ms of which 0 ms to minimize.
[2023-03-22 14:47:07] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 0 ms to minimize.
[2023-03-22 14:47:08] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 0 ms to minimize.
[2023-03-22 14:47:08] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 1 ms to minimize.
[2023-03-22 14:47:08] [INFO ] Deduced a trap composed of 21 places in 168 ms of which 0 ms to minimize.
[2023-03-22 14:47:09] [INFO ] Deduced a trap composed of 21 places in 186 ms of which 1 ms to minimize.
[2023-03-22 14:47:09] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 1 ms to minimize.
[2023-03-22 14:47:10] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 0 ms to minimize.
[2023-03-22 14:47:10] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2023-03-22 14:47:10] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2023-03-22 14:47:10] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2023-03-22 14:47:11] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 0 ms to minimize.
[2023-03-22 14:47:14] [INFO ] Deduced a trap composed of 9 places in 401 ms of which 1 ms to minimize.
[2023-03-22 14:47:14] [INFO ] Deduced a trap composed of 9 places in 338 ms of which 1 ms to minimize.
[2023-03-22 14:47:15] [INFO ] Deduced a trap composed of 10 places in 317 ms of which 0 ms to minimize.
[2023-03-22 14:47:15] [INFO ] Deduced a trap composed of 9 places in 420 ms of which 1 ms to minimize.
[2023-03-22 14:47:16] [INFO ] Deduced a trap composed of 12 places in 371 ms of which 1 ms to minimize.
[2023-03-22 14:47:16] [INFO ] Deduced a trap composed of 15 places in 306 ms of which 1 ms to minimize.
[2023-03-22 14:47:17] [INFO ] Deduced a trap composed of 15 places in 512 ms of which 1 ms to minimize.
[2023-03-22 14:47:18] [INFO ] Deduced a trap composed of 15 places in 214 ms of which 0 ms to minimize.
[2023-03-22 14:47:18] [INFO ] Deduced a trap composed of 9 places in 229 ms of which 0 ms to minimize.
[2023-03-22 14:47:18] [INFO ] Deduced a trap composed of 13 places in 321 ms of which 1 ms to minimize.
[2023-03-22 14:47:19] [INFO ] Deduced a trap composed of 12 places in 310 ms of which 0 ms to minimize.
[2023-03-22 14:47:19] [INFO ] Deduced a trap composed of 9 places in 252 ms of which 1 ms to minimize.
[2023-03-22 14:47:20] [INFO ] Deduced a trap composed of 17 places in 311 ms of which 1 ms to minimize.
[2023-03-22 14:47:20] [INFO ] Deduced a trap composed of 9 places in 232 ms of which 1 ms to minimize.
[2023-03-22 14:47:21] [INFO ] Deduced a trap composed of 15 places in 399 ms of which 0 ms to minimize.
[2023-03-22 14:47:21] [INFO ] Deduced a trap composed of 9 places in 275 ms of which 1 ms to minimize.
[2023-03-22 14:47:22] [INFO ] Deduced a trap composed of 9 places in 308 ms of which 1 ms to minimize.
[2023-03-22 14:47:23] [INFO ] Deduced a trap composed of 15 places in 570 ms of which 1 ms to minimize.
[2023-03-22 14:47:23] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 1 ms to minimize.
[2023-03-22 14:47:23] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 0 ms to minimize.
[2023-03-22 14:47:24] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 0 ms to minimize.
[2023-03-22 14:47:24] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 0 ms to minimize.
[2023-03-22 14:47:24] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 0 ms to minimize.
[2023-03-22 14:47:25] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 0 ms to minimize.
[2023-03-22 14:47:25] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2023-03-22 14:47:25] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 26 ms to minimize.
[2023-03-22 14:47:25] [INFO ] Trap strengthening (SAT) tested/added 78/77 trap constraints in 41164 ms
[2023-03-22 14:47:25] [INFO ] After 93287ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2572 ms.
[2023-03-22 14:47:28] [INFO ] After 96961ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-22 14:47:28] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2023-03-22 14:47:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2500 places, 2401 transitions and 12067 arcs took 19 ms.
[2023-03-22 14:47:29] [INFO ] Flatten gal took : 375 ms
Total runtime 215140 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: ShieldIIPs_PT_100A
(NrP: 2500 NrTr: 2401 NrArc: 12067)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.679sec

net check time: 0m 0.001sec

init dd package: 0m 2.866sec


before gc: list nodes free: 944091

after gc: idd nodes used:407064, unused:63592936; list nodes free:281245070

before gc: list nodes free: 30525

after gc: idd nodes used:712549, unused:63287451; list nodes free:281938586

before gc: list nodes free: 616910

after gc: idd nodes used:1174838, unused:62825162; list nodes free:283998960

before gc: list nodes free: 1852988

after gc: idd nodes used:1576346, unused:62423654; list nodes free:282142904

before gc: list nodes free: 1935967

after gc: idd nodes used:1691537, unused:62308463; list nodes free:281613714

before gc: list nodes free: 2376224

after gc: idd nodes used:1700230, unused:62299770; list nodes free:281574221

before gc: list nodes free: 3235828

after gc: idd nodes used:1733265, unused:62266735; list nodes free:281431186
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 6046384 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16091492 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.029sec

437879 985366 1556689 1581219 1760027

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="ShieldIIPs-PT-100A"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is ShieldIIPs-PT-100A, 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 r394-oct2-167903717600167"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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