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.r231-tall-167856416500749.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 lolaxred
Input is MultiCrashLeafsetExtension-PT-S16C02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856416500749
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 12K Feb 26 03:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 03:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 03:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 03:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Feb 26 03:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Feb 26 03:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 03:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 26 03:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.0M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679486452049

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C02
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 12:00:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 12:00:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 12:00:53] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2023-03-22 12:00:53] [INFO ] Transformed 2952 places.
[2023-03-22 12:00:53] [INFO ] Transformed 4255 transitions.
[2023-03-22 12:00:53] [INFO ] Parsed PT model containing 2952 places and 4255 transitions and 17902 arcs in 430 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Normalized transition count is 3983 out of 4255 initially.
// Phase 1: matrix 3983 rows 2952 cols
[2023-03-22 12:00:54] [INFO ] Computed 421 place invariants in 191 ms
Incomplete random walk after 10000 steps, including 468 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 16) seen :10
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 116 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 15) seen :6
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10000 steps, including 116 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 15) seen :8
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 15) seen :8
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 15) seen :6
[2023-03-22 12:00:54] [INFO ] Flow matrix only has 3983 transitions (discarded 272 similar events)
// Phase 1: matrix 3983 rows 2952 cols
[2023-03-22 12:00:54] [INFO ] Computed 421 place invariants in 116 ms
[2023-03-22 12:00:55] [INFO ] [Real]Absence check using 42 positive place invariants in 45 ms returned sat
[2023-03-22 12:00:55] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 53 ms returned unsat
[2023-03-22 12:00:55] [INFO ] [Real]Absence check using 42 positive place invariants in 30 ms returned sat
[2023-03-22 12:00:55] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 122 ms returned unsat
[2023-03-22 12:00:56] [INFO ] [Real]Absence check using 42 positive place invariants in 47 ms returned sat
[2023-03-22 12:00:56] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 119 ms returned unsat
[2023-03-22 12:00:56] [INFO ] [Real]Absence check using 42 positive place invariants in 32 ms returned sat
[2023-03-22 12:00:56] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 110 ms returned unsat
[2023-03-22 12:00:57] [INFO ] [Real]Absence check using 42 positive place invariants in 31 ms returned sat
[2023-03-22 12:00:57] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 112 ms returned unsat
[2023-03-22 12:00:57] [INFO ] [Real]Absence check using 42 positive place invariants in 33 ms returned sat
[2023-03-22 12:00:57] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 121 ms returned unsat
[2023-03-22 12:00:57] [INFO ] [Real]Absence check using 42 positive place invariants in 31 ms returned sat
[2023-03-22 12:00:58] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 129 ms returned sat
[2023-03-22 12:00:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:00:59] [INFO ] [Real]Absence check using state equation in 1432 ms returned sat
[2023-03-22 12:00:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:01:00] [INFO ] [Nat]Absence check using 42 positive place invariants in 36 ms returned sat
[2023-03-22 12:01:00] [INFO ] [Nat]Absence check using 42 positive and 379 generalized place invariants in 107 ms returned sat
[2023-03-22 12:01:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:01:01] [INFO ] [Nat]Absence check using state equation in 1639 ms returned sat
[2023-03-22 12:01:01] [INFO ] State equation strengthened by 1090 read => feed constraints.
[2023-03-22 12:01:01] [INFO ] [Nat]Added 1090 Read/Feed constraints in 79 ms returned unsat
[2023-03-22 12:01:02] [INFO ] [Real]Absence check using 42 positive place invariants in 33 ms returned sat
[2023-03-22 12:01:02] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 109 ms returned unsat
[2023-03-22 12:01:02] [INFO ] [Real]Absence check using 42 positive place invariants in 30 ms returned sat
[2023-03-22 12:01:02] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 107 ms returned unsat
[2023-03-22 12:01:02] [INFO ] [Real]Absence check using 42 positive place invariants in 30 ms returned sat
[2023-03-22 12:01:03] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 110 ms returned unsat
[2023-03-22 12:01:03] [INFO ] [Real]Absence check using 42 positive place invariants in 32 ms returned sat
[2023-03-22 12:01:03] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 108 ms returned unsat
[2023-03-22 12:01:03] [INFO ] [Real]Absence check using 42 positive place invariants in 30 ms returned sat
[2023-03-22 12:01:03] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 109 ms returned sat
[2023-03-22 12:01:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:01:05] [INFO ] [Real]Absence check using state equation in 1451 ms returned sat
[2023-03-22 12:01:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:01:05] [INFO ] [Nat]Absence check using 42 positive place invariants in 34 ms returned sat
[2023-03-22 12:01:05] [INFO ] [Nat]Absence check using 42 positive and 379 generalized place invariants in 108 ms returned sat
[2023-03-22 12:01:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:01:07] [INFO ] [Nat]Absence check using state equation in 1589 ms returned sat
[2023-03-22 12:01:07] [INFO ] [Nat]Added 1090 Read/Feed constraints in 96 ms returned unsat
[2023-03-22 12:01:07] [INFO ] [Real]Absence check using 42 positive place invariants in 32 ms returned sat
[2023-03-22 12:01:07] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 97 ms returned unsat
[2023-03-22 12:01:08] [INFO ] [Real]Absence check using 42 positive place invariants in 31 ms returned sat
[2023-03-22 12:01:08] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 109 ms returned unsat
[2023-03-22 12:01:08] [INFO ] [Real]Absence check using 42 positive place invariants in 31 ms returned sat
[2023-03-22 12:01:08] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 106 ms returned sat
[2023-03-22 12:01:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:01:10] [INFO ] [Real]Absence check using state equation in 1481 ms returned sat
[2023-03-22 12:01:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:01:10] [INFO ] [Nat]Absence check using 42 positive place invariants in 31 ms returned sat
[2023-03-22 12:01:10] [INFO ] [Nat]Absence check using 42 positive and 379 generalized place invariants in 107 ms returned sat
[2023-03-22 12:01:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:01:12] [INFO ] [Nat]Absence check using state equation in 1743 ms returned sat
[2023-03-22 12:01:12] [INFO ] [Nat]Added 1090 Read/Feed constraints in 167 ms returned sat
[2023-03-22 12:01:14] [INFO ] Deduced a trap composed of 179 places in 2144 ms of which 13 ms to minimize.
[2023-03-22 12:01:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2748 ms
[2023-03-22 12:01:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 14
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:999)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1] Max seen :[1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0]
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 2952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2952/2952 places, 4255/4255 transitions.
Graph (complete) has 10317 edges and 2952 vertex of which 2928 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.11 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 544 transitions
Trivial Post-agglo rules discarded 544 transitions
Performed 544 trivial Post agglomeration. Transition count delta: 544
Iterating post reduction 0 with 544 rules applied. Total rules applied 545 place count 2928 transition count 3711
Reduce places removed 544 places and 0 transitions.
Iterating post reduction 1 with 544 rules applied. Total rules applied 1089 place count 2384 transition count 3711
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 1089 place count 2384 transition count 3643
Deduced a syphon composed of 68 places in 3 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 1225 place count 2316 transition count 3643
Discarding 476 places :
Symmetric choice reduction at 2 with 476 rule applications. Total rules 1701 place count 1840 transition count 3167
Iterating global reduction 2 with 476 rules applied. Total rules applied 2177 place count 1840 transition count 3167
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2177 place count 1840 transition count 3163
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 2185 place count 1836 transition count 3163
Discarding 238 places :
Symmetric choice reduction at 2 with 238 rule applications. Total rules 2423 place count 1598 transition count 2687
Iterating global reduction 2 with 238 rules applied. Total rules applied 2661 place count 1598 transition count 2687
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 2695 place count 1581 transition count 2670
Free-agglomeration rule (complex) applied 159 times.
Iterating global reduction 2 with 159 rules applied. Total rules applied 2854 place count 1581 transition count 2749
Reduce places removed 159 places and 0 transitions.
Iterating post reduction 2 with 159 rules applied. Total rules applied 3013 place count 1422 transition count 2749
Applied a total of 3013 rules in 1141 ms. Remains 1422 /2952 variables (removed 1530) and now considering 2749/4255 (removed 1506) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1142 ms. Remains : 1422/2952 places, 2749/4255 transitions.
Normalized transition count is 2352 out of 2749 initially.
// Phase 1: matrix 2352 rows 1422 cols
[2023-03-22 12:01:16] [INFO ] Computed 397 place invariants in 30 ms
Incomplete random walk after 1000000 steps, including 76187 resets, run finished after 7440 ms. (steps per millisecond=134 ) properties (out of 1) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 30626 ms.
ITS solved all properties within timeout

BK_STOP 1679486485000

--------------------
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 UpperBounds -timeout 360 -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="MultiCrashLeafsetExtension-PT-S16C02"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is MultiCrashLeafsetExtension-PT-S16C02, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r231-tall-167856416500749"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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