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

About the Execution of Smart+red for ShieldIIPs-PT-040B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
408.203 76317.00 133525.00 47.80 T normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r409-oct2-167903727500087.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 smartxred
Input is ShieldIIPs-PT-040B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r409-oct2-167903727500087
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 16:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 16:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 675K 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

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1679770947702

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=smartxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldIIPs-PT-040B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-25 19:02:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-25 19:02:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-25 19:02:30] [INFO ] Load time of PNML (sax parser for PT used): 300 ms
[2023-03-25 19:02:30] [INFO ] Transformed 2403 places.
[2023-03-25 19:02:30] [INFO ] Transformed 2363 transitions.
[2023-03-25 19:02:30] [INFO ] Found NUPN structural information;
[2023-03-25 19:02:31] [INFO ] Parsed PT model containing 2403 places and 2363 transitions and 7126 arcs in 731 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 2403/2403 places, 2363/2363 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2403 transition count 2162
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 2202 transition count 2162
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 402 place count 2202 transition count 1961
Deduced a syphon composed of 201 places in 25 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 804 place count 2001 transition count 1961
Performed 960 Post agglomeration using F-continuation condition.Transition count delta: 960
Deduced a syphon composed of 960 places in 1 ms
Reduce places removed 960 places and 0 transitions.
Iterating global reduction 2 with 1920 rules applied. Total rules applied 2724 place count 1041 transition count 1001
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 2724 rules in 558 ms. Remains 1041 /2403 variables (removed 1362) and now considering 1001/2363 (removed 1362) transitions.
// Phase 1: matrix 1001 rows 1041 cols
[2023-03-25 19:02:31] [INFO ] Computed 361 place invariants in 21 ms
[2023-03-25 19:02:35] [INFO ] Implicit Places using invariants in 4279 ms returned [1026]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4317 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 1040/2403 places, 1001/2363 transitions.
Applied a total of 0 rules in 20 ms. Remains 1040 /1040 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 4898 ms. Remains : 1040/2403 places, 1001/2363 transitions.
Discarding 240 transitions out of 1001. Remains 761
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 729 ms. (steps per millisecond=13 ) properties (out of 760) seen :717
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 43) seen :0
Running SMT prover for 43 properties.
// Phase 1: matrix 1001 rows 1040 cols
[2023-03-25 19:02:37] [INFO ] Computed 360 place invariants in 6 ms
[2023-03-25 19:02:38] [INFO ] [Real]Absence check using 360 positive place invariants in 209 ms returned sat
[2023-03-25 19:02:46] [INFO ] After 9361ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:43
[2023-03-25 19:02:48] [INFO ] [Nat]Absence check using 360 positive place invariants in 152 ms returned sat
[2023-03-25 19:02:57] [INFO ] After 6374ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :43
[2023-03-25 19:02:57] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 35 ms to minimize.
[2023-03-25 19:02:57] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 2 ms to minimize.
[2023-03-25 19:02:58] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 3 ms to minimize.
[2023-03-25 19:02:58] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 6 ms to minimize.
[2023-03-25 19:02:58] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 14 ms to minimize.
[2023-03-25 19:02:58] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 1 ms to minimize.
[2023-03-25 19:02:59] [INFO ] Deduced a trap composed of 4 places in 737 ms of which 2 ms to minimize.
[2023-03-25 19:03:00] [INFO ] Deduced a trap composed of 4 places in 887 ms of which 1 ms to minimize.
[2023-03-25 19:03:00] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 14 ms to minimize.
[2023-03-25 19:03:00] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2023-03-25 19:03:01] [INFO ] Deduced a trap composed of 4 places in 986 ms of which 0 ms to minimize.
[2023-03-25 19:03:01] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4549 ms
[2023-03-25 19:03:01] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4549 ms
[2023-03-25 19:03:02] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 0 ms to minimize.
[2023-03-25 19:03:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2023-03-25 19:03:03] [INFO ] Deduced a trap composed of 4 places in 841 ms of which 0 ms to minimize.
[2023-03-25 19:03:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 950 ms
[2023-03-25 19:03:03] [INFO ] Deduced a trap composed of 4 places in 488 ms of which 25 ms to minimize.
[2023-03-25 19:03:04] [INFO ] Deduced a trap composed of 4 places in 283 ms of which 1 ms to minimize.
[2023-03-25 19:03:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 944 ms
[2023-03-25 19:03:04] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 0 ms to minimize.
[2023-03-25 19:03:05] [INFO ] Deduced a trap composed of 11 places in 821 ms of which 27 ms to minimize.
[2023-03-25 19:03:06] [INFO ] Deduced a trap composed of 13 places in 246 ms of which 1 ms to minimize.
[2023-03-25 19:03:06] [INFO ] Deduced a trap composed of 17 places in 641 ms of which 1 ms to minimize.
[2023-03-25 19:03:07] [INFO ] Deduced a trap composed of 15 places in 389 ms of which 1 ms to minimize.
[2023-03-25 19:03:07] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2023-03-25 19:03:07] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 0 ms to minimize.
[2023-03-25 19:03:07] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2023-03-25 19:03:07] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3080 ms
[2023-03-25 19:03:08] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 1 ms to minimize.
[2023-03-25 19:03:08] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 1 ms to minimize.
[2023-03-25 19:03:08] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 0 ms to minimize.
[2023-03-25 19:03:09] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2023-03-25 19:03:09] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2023-03-25 19:03:09] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 0 ms to minimize.
[2023-03-25 19:03:09] [INFO ] Deduced a trap composed of 4 places in 441 ms of which 0 ms to minimize.
[2023-03-25 19:03:10] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2023-03-25 19:03:11] [INFO ] Deduced a trap composed of 4 places in 1211 ms of which 26 ms to minimize.
[2023-03-25 19:03:12] [INFO ] Deduced a trap composed of 4 places in 921 ms of which 0 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.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-25 19:03:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-25 19:03:12] [INFO ] After 25640ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:43
Parikh walk visited 10 properties in 30556 ms.
Support contains 97 out of 1040 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1040/1040 places, 1001/1001 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 1000 transition count 961
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 1000 transition count 961
Partial Free-agglomeration rule applied 216 times.
Drop transitions removed 216 transitions
Iterating global reduction 0 with 216 rules applied. Total rules applied 296 place count 1000 transition count 961
Applied a total of 296 rules in 148 ms. Remains 1000 /1040 variables (removed 40) and now considering 961/1001 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 1000/1040 places, 961/1001 transitions.
Finished random walk after 16708 steps, including 6 resets, run visited all 33 properties in 561 ms. (steps per millisecond=29 )
Able to resolve query QuasiLiveness after proving 761 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 73443 ms.
ITS solved all properties within timeout

BK_STOP 1679771024019

--------------------
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 QuasiLiveness -timeout 180 -rebuildPNML

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-040B"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 smartxred"
echo " Input is ShieldIIPs-PT-040B, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r409-oct2-167903727500087"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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