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.r293-tall-167873945600549.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 itstools
Input is PolyORBLF-PT-S04J04T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945600549
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.2M
-rw-r--r-- 1 mcc users 15K Feb 26 14:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 14:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 76K Feb 26 14:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 344K Feb 26 14:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Feb 26 14:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Feb 26 14:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 178K Feb 26 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 793K Feb 26 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.0K Feb 25 16:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.3M 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678892939724

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J04T08
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-15 15:09:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 15:09:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 15:09:01] [INFO ] Load time of PNML (sax parser for PT used): 228 ms
[2023-03-15 15:09:01] [INFO ] Transformed 712 places.
[2023-03-15 15:09:01] [INFO ] Transformed 4012 transitions.
[2023-03-15 15:09:01] [INFO ] Parsed PT model containing 712 places and 4012 transitions and 27744 arcs in 328 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
Normalized transition count is 1812 out of 1844 initially.
// Phase 1: matrix 1812 rows 712 cols
[2023-03-15 15:09:01] [INFO ] Computed 54 place invariants in 124 ms
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 15) seen :22
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :17
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :17
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :16
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :16
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :17
[2023-03-15 15:09:02] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 712 cols
[2023-03-15 15:09:02] [INFO ] Computed 54 place invariants in 70 ms
[2023-03-15 15:09:02] [INFO ] [Real]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-15 15:09:02] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 45 ms returned unsat
[2023-03-15 15:09:02] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 15:09:02] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 36 ms returned unsat
[2023-03-15 15:09:03] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-15 15:09:03] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 34 ms returned unsat
[2023-03-15 15:09:03] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-15 15:09:03] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 34 ms returned unsat
[2023-03-15 15:09:03] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 15:09:03] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 31 ms returned unsat
[2023-03-15 15:09:03] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-15 15:09:03] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 23 ms returned unsat
[2023-03-15 15:09:03] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 15:09:03] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 23 ms returned unsat
[2023-03-15 15:09:03] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 15:09:03] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 26 ms returned unsat
[2023-03-15 15:09:03] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 15:09:03] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 35 ms returned sat
[2023-03-15 15:09:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 15:09:07] [INFO ] [Real]Absence check using state equation in 4178 ms returned sat
[2023-03-15 15:09:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 15:09:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 15:09:08] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 33 ms returned sat
[2023-03-15 15:09:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 15:09:13] [INFO ] [Nat]Absence check using state equation in 4892 ms returned unknown
[2023-03-15 15:09:13] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 15:09:13] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 25 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 1, 1, 2, 4, 1, 1, 1, 8, 1] Max seen :[4, 1, 1, 2, 4, 1, 1, 1, 1, 1]
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 712 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 712/712 places, 1844/1844 transitions.
Ensure Unique test removed 4 places
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 708 transition count 1772
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 148 place count 636 transition count 1772
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 148 place count 636 transition count 1692
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 308 place count 556 transition count 1692
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 2 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 466 place count 477 transition count 1613
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 482 place count 477 transition count 1597
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 498 place count 461 transition count 1597
Applied a total of 498 rules in 300 ms. Remains 461 /712 variables (removed 251) and now considering 1597/1844 (removed 247) transitions.
[2023-03-15 15:09:13] [INFO ] Flow matrix only has 1565 transitions (discarded 32 similar events)
// Phase 1: matrix 1565 rows 461 cols
[2023-03-15 15:09:13] [INFO ] Computed 50 place invariants in 31 ms
[2023-03-15 15:09:14] [INFO ] Dead Transitions using invariants and state equation in 1007 ms found 432 transitions.
Found 432 dead transitions using SMT.
Drop transitions removed 432 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 432 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 461/712 places, 1165/1844 transitions.
Applied a total of 0 rules in 35 ms. Remains 461 /461 variables (removed 0) and now considering 1165/1165 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1343 ms. Remains : 461/712 places, 1165/1844 transitions.
Normalized transition count is 1133 out of 1165 initially.
// Phase 1: matrix 1133 rows 461 cols
[2023-03-15 15:09:14] [INFO ] Computed 50 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 99 resets, run finished after 5125 ms. (steps per millisecond=195 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 35 resets, run finished after 1920 ms. (steps per millisecond=520 ) properties (out of 1) seen :1
[2023-03-15 15:09:21] [INFO ] Flow matrix only has 1133 transitions (discarded 32 similar events)
// Phase 1: matrix 1133 rows 461 cols
[2023-03-15 15:09:21] [INFO ] Computed 50 place invariants in 26 ms
[2023-03-15 15:09:21] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-15 15:09:21] [INFO ] [Real]Absence check using 15 positive and 35 generalized place invariants in 29 ms returned sat
[2023-03-15 15:09:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 15:09:22] [INFO ] [Real]Absence check using state equation in 586 ms returned sat
[2023-03-15 15:09:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 15:09:22] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-15 15:09:22] [INFO ] [Nat]Absence check using 15 positive and 35 generalized place invariants in 41 ms returned sat
[2023-03-15 15:09:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 15:09:27] [INFO ] [Nat]Absence check using state equation in 4483 ms returned sat
[2023-03-15 15:09:27] [INFO ] State equation strengthened by 160 read => feed constraints.
[2023-03-15 15:09:28] [INFO ] [Nat]Added 160 Read/Feed constraints in 1430 ms returned sat
[2023-03-15 15:09:28] [INFO ] Deduced a trap composed of 44 places in 263 ms of which 5 ms to minimize.
[2023-03-15 15:09:29] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2023-03-15 15:09:29] [INFO ] Deduced a trap composed of 207 places in 237 ms of which 1 ms to minimize.
[2023-03-15 15:09:29] [INFO ] Deduced a trap composed of 211 places in 246 ms of which 1 ms to minimize.
[2023-03-15 15:09:30] [INFO ] Deduced a trap composed of 199 places in 218 ms of which 1 ms to minimize.
[2023-03-15 15:09:30] [INFO ] Deduced a trap composed of 202 places in 264 ms of which 0 ms to minimize.
[2023-03-15 15:09:31] [INFO ] Deduced a trap composed of 184 places in 234 ms of which 1 ms to minimize.
[2023-03-15 15:09:31] [INFO ] Deduced a trap composed of 191 places in 203 ms of which 1 ms to minimize.
[2023-03-15 15:09:31] [INFO ] Deduced a trap composed of 211 places in 212 ms of which 0 ms to minimize.
[2023-03-15 15:09:31] [INFO ] Deduced a trap composed of 198 places in 215 ms of which 1 ms to minimize.
[2023-03-15 15:09:32] [INFO ] Deduced a trap composed of 219 places in 275 ms of which 1 ms to minimize.
[2023-03-15 15:09:32] [INFO ] Deduced a trap composed of 215 places in 215 ms of which 0 ms to minimize.
[2023-03-15 15:09:32] [INFO ] Deduced a trap composed of 191 places in 199 ms of which 1 ms to minimize.
[2023-03-15 15:09:33] [INFO ] Deduced a trap composed of 224 places in 202 ms of which 0 ms to minimize.
[2023-03-15 15:09:33] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 0 ms to minimize.
[2023-03-15 15:09:33] [INFO ] Deduced a trap composed of 191 places in 248 ms of which 1 ms to minimize.
[2023-03-15 15:09:34] [INFO ] Deduced a trap composed of 208 places in 251 ms of which 0 ms to minimize.
[2023-03-15 15:09:34] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 5691 ms
[2023-03-15 15:09:34] [INFO ] Computed and/alt/rep : 577/2989/553 causal constraints (skipped 576 transitions) in 92 ms.
[2023-03-15 15:09:36] [INFO ] Deduced a trap composed of 192 places in 254 ms of which 1 ms to minimize.
[2023-03-15 15:09:36] [INFO ] Deduced a trap composed of 204 places in 254 ms of which 1 ms to minimize.
[2023-03-15 15:09:37] [INFO ] Deduced a trap composed of 203 places in 226 ms of which 0 ms to minimize.
[2023-03-15 15:09:37] [INFO ] Deduced a trap composed of 213 places in 255 ms of which 0 ms to minimize.
[2023-03-15 15:09:37] [INFO ] Deduced a trap composed of 219 places in 249 ms of which 1 ms to minimize.
[2023-03-15 15:09:38] [INFO ] Deduced a trap composed of 204 places in 245 ms of which 0 ms to minimize.
[2023-03-15 15:09:38] [INFO ] Deduced a trap composed of 194 places in 243 ms of which 2 ms to minimize.
[2023-03-15 15:09:38] [INFO ] Deduced a trap composed of 217 places in 248 ms of which 1 ms to minimize.
[2023-03-15 15:09:39] [INFO ] Deduced a trap composed of 224 places in 244 ms of which 1 ms to minimize.
[2023-03-15 15:09:39] [INFO ] Deduced a trap composed of 205 places in 245 ms of which 0 ms to minimize.
[2023-03-15 15:09:39] [INFO ] Deduced a trap composed of 224 places in 246 ms of which 1 ms to minimize.
[2023-03-15 15:09:42] [INFO ] Trap strengthening (SAT) tested/added 11/11 trap constraints in 6883 ms
[2023-03-15 15:10:07] [INFO ] Deduced a trap composed of 2 places in 298 ms of which 0 ms to minimize.
[2023-03-15 15:10:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
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.refineWithCausalOrder(DeadlockTester.java:1177)
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) : [8] Max seen :[1]
Support contains 1 out of 461 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 461/461 places, 1165/1165 transitions.
Applied a total of 0 rules in 32 ms. Remains 461 /461 variables (removed 0) and now considering 1165/1165 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 461/461 places, 1165/1165 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 461/461 places, 1165/1165 transitions.
Applied a total of 0 rules in 26 ms. Remains 461 /461 variables (removed 0) and now considering 1165/1165 (removed 0) transitions.
[2023-03-15 15:10:07] [INFO ] Flow matrix only has 1133 transitions (discarded 32 similar events)
[2023-03-15 15:10:07] [INFO ] Invariant cache hit.
[2023-03-15 15:10:08] [INFO ] Implicit Places using invariants in 538 ms returned [93, 145, 163, 227, 313, 352, 360, 448]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 542 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 453/461 places, 1165/1165 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 446 transition count 1158
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 446 transition count 1158
Applied a total of 14 rules in 48 ms. Remains 446 /453 variables (removed 7) and now considering 1158/1165 (removed 7) transitions.
[2023-03-15 15:10:08] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
// Phase 1: matrix 1126 rows 446 cols
[2023-03-15 15:10:08] [INFO ] Computed 42 place invariants in 22 ms
[2023-03-15 15:10:08] [INFO ] Implicit Places using invariants in 522 ms returned []
[2023-03-15 15:10:08] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
[2023-03-15 15:10:08] [INFO ] Invariant cache hit.
[2023-03-15 15:10:09] [INFO ] State equation strengthened by 160 read => feed constraints.
[2023-03-15 15:10:13] [INFO ] Implicit Places using invariants and state equation in 4433 ms returned []
Implicit Place search using SMT with State Equation took 4960 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 446/461 places, 1158/1165 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5579 ms. Remains : 446/461 places, 1158/1165 transitions.
Normalized transition count is 1126 out of 1158 initially.
// Phase 1: matrix 1126 rows 446 cols
[2023-03-15 15:10:13] [INFO ] Computed 42 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 116 resets, run finished after 5016 ms. (steps per millisecond=199 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 36 resets, run finished after 1873 ms. (steps per millisecond=533 ) properties (out of 1) seen :1
[2023-03-15 15:10:20] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
// Phase 1: matrix 1126 rows 446 cols
[2023-03-15 15:10:20] [INFO ] Computed 42 place invariants in 25 ms
[2023-03-15 15:10:20] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-15 15:10:20] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 13 ms returned sat
[2023-03-15 15:10:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 15:10:21] [INFO ] [Real]Absence check using state equation in 1439 ms returned sat
[2023-03-15 15:10:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 15:10:21] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-15 15:10:21] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 12 ms returned sat
[2023-03-15 15:10:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 15:10:29] [INFO ] [Nat]Absence check using state equation in 7203 ms returned unknown
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
Support contains 1 out of 446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 446/446 places, 1158/1158 transitions.
Applied a total of 0 rules in 32 ms. Remains 446 /446 variables (removed 0) and now considering 1158/1158 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 446/446 places, 1158/1158 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 446/446 places, 1158/1158 transitions.
Applied a total of 0 rules in 23 ms. Remains 446 /446 variables (removed 0) and now considering 1158/1158 (removed 0) transitions.
[2023-03-15 15:10:29] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
[2023-03-15 15:10:29] [INFO ] Invariant cache hit.
[2023-03-15 15:10:29] [INFO ] Implicit Places using invariants in 675 ms returned []
[2023-03-15 15:10:29] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
[2023-03-15 15:10:29] [INFO ] Invariant cache hit.
[2023-03-15 15:10:30] [INFO ] State equation strengthened by 160 read => feed constraints.
[2023-03-15 15:10:33] [INFO ] Implicit Places using invariants and state equation in 4086 ms returned []
Implicit Place search using SMT with State Equation took 4775 ms to find 0 implicit places.
[2023-03-15 15:10:34] [INFO ] Redundant transitions in 72 ms returned []
[2023-03-15 15:10:34] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
[2023-03-15 15:10:34] [INFO ] Invariant cache hit.
[2023-03-15 15:10:34] [INFO ] Dead Transitions using invariants and state equation in 796 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5680 ms. Remains : 446/446 places, 1158/1158 transitions.
Starting property specific reduction for PolyORBLF-PT-S04J04T08-UpperBounds-12
Normalized transition count is 1126 out of 1158 initially.
// Phase 1: matrix 1126 rows 446 cols
[2023-03-15 15:10:34] [INFO ] Computed 42 place invariants in 18 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :1
[2023-03-15 15:10:34] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
// Phase 1: matrix 1126 rows 446 cols
[2023-03-15 15:10:34] [INFO ] Computed 42 place invariants in 17 ms
[2023-03-15 15:10:35] [INFO ] [Real]Absence check using 15 positive place invariants in 15 ms returned sat
[2023-03-15 15:10:35] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 14 ms returned sat
[2023-03-15 15:10:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 15:10:36] [INFO ] [Real]Absence check using state equation in 1444 ms returned sat
[2023-03-15 15:10:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 15:10:36] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-15 15:10:36] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 12 ms returned sat
[2023-03-15 15:10:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 15:10:41] [INFO ] [Nat]Absence check using state equation in 4428 ms returned sat
[2023-03-15 15:10:41] [INFO ] State equation strengthened by 160 read => feed constraints.
[2023-03-15 15:10:41] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 15:10:41] [INFO ] [Nat]Added 160 Read/Feed constraints in 492 ms returned unknown
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
Support contains 1 out of 446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 446/446 places, 1158/1158 transitions.
Applied a total of 0 rules in 26 ms. Remains 446 /446 variables (removed 0) and now considering 1158/1158 (removed 0) transitions.
[2023-03-15 15:10:41] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
[2023-03-15 15:10:41] [INFO ] Invariant cache hit.
[2023-03-15 15:10:42] [INFO ] Dead Transitions using invariants and state equation in 1020 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1048 ms. Remains : 446/446 places, 1158/1158 transitions.
Normalized transition count is 1126 out of 1158 initially.
// Phase 1: matrix 1126 rows 446 cols
[2023-03-15 15:10:42] [INFO ] Computed 42 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 103 resets, run finished after 5013 ms. (steps per millisecond=199 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 30 resets, run finished after 1869 ms. (steps per millisecond=535 ) properties (out of 1) seen :1
[2023-03-15 15:10:49] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
// Phase 1: matrix 1126 rows 446 cols
[2023-03-15 15:10:49] [INFO ] Computed 42 place invariants in 22 ms
[2023-03-15 15:10:49] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-15 15:10:49] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 12 ms returned sat
[2023-03-15 15:10:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 15:10:51] [INFO ] [Real]Absence check using state equation in 1404 ms returned sat
[2023-03-15 15:10:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 15:10:51] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-15 15:10:51] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 13 ms returned sat
[2023-03-15 15:10:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 15:10:56] [INFO ] [Nat]Absence check using state equation in 5006 ms returned sat
[2023-03-15 15:10:56] [INFO ] State equation strengthened by 160 read => feed constraints.
[2023-03-15 15:10:59] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 15:10:59] [INFO ] [Nat]Added 160 Read/Feed constraints in 3082 ms returned sat
[2023-03-15 15:10:59] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2023-03-15 15:11:02] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 3083 ms
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
Support contains 1 out of 446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 446/446 places, 1158/1158 transitions.
Applied a total of 0 rules in 21 ms. Remains 446 /446 variables (removed 0) and now considering 1158/1158 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 446/446 places, 1158/1158 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 446/446 places, 1158/1158 transitions.
Applied a total of 0 rules in 20 ms. Remains 446 /446 variables (removed 0) and now considering 1158/1158 (removed 0) transitions.
[2023-03-15 15:11:02] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
[2023-03-15 15:11:02] [INFO ] Invariant cache hit.
[2023-03-15 15:11:02] [INFO ] Implicit Places using invariants in 504 ms returned []
[2023-03-15 15:11:02] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
[2023-03-15 15:11:02] [INFO ] Invariant cache hit.
[2023-03-15 15:11:03] [INFO ] State equation strengthened by 160 read => feed constraints.
[2023-03-15 15:11:06] [INFO ] Implicit Places using invariants and state equation in 3951 ms returned []
Implicit Place search using SMT with State Equation took 4457 ms to find 0 implicit places.
[2023-03-15 15:11:06] [INFO ] Redundant transitions in 60 ms returned []
[2023-03-15 15:11:06] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
[2023-03-15 15:11:06] [INFO ] Invariant cache hit.
[2023-03-15 15:11:07] [INFO ] Dead Transitions using invariants and state equation in 802 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5385 ms. Remains : 446/446 places, 1158/1158 transitions.
Ending property specific reduction for PolyORBLF-PT-S04J04T08-UpperBounds-12 in 32930 ms.
[2023-03-15 15:11:08] [INFO ] Flatten gal took : 147 ms
[2023-03-15 15:11:08] [INFO ] Applying decomposition
[2023-03-15 15:11:08] [INFO ] Flatten gal took : 121 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9845071778883468958.txt' '-o' '/tmp/graph9845071778883468958.bin' '-w' '/tmp/graph9845071778883468958.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9845071778883468958.bin' '-l' '-1' '-v' '-w' '/tmp/graph9845071778883468958.weights' '-q' '0' '-e' '0.001'
[2023-03-15 15:11:08] [INFO ] Decomposing Gal with order
[2023-03-15 15:11:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 15:11:08] [INFO ] Removed a total of 947 redundant transitions.
[2023-03-15 15:11:09] [INFO ] Flatten gal took : 318 ms
[2023-03-15 15:11:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 347 labels/synchronizations in 29 ms.
[2023-03-15 15:11:09] [INFO ] Time to serialize gal into /tmp/UpperBounds12127917129208007693.gal : 18 ms
[2023-03-15 15:11:09] [INFO ] Time to serialize properties into /tmp/UpperBounds13092977765310244343.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12127917129208007693.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13092977765310244343.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Loading property file /tmp/UpperBounds13092977765310244343.prop.
Detected timeout of ITS tools.
[2023-03-15 15:31:58] [INFO ] Flatten gal took : 410 ms
[2023-03-15 15:31:58] [INFO ] Time to serialize gal into /tmp/UpperBounds16288324948278455182.gal : 73 ms
[2023-03-15 15:31:58] [INFO ] Time to serialize properties into /tmp/UpperBounds16722660432744305789.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16288324948278455182.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16722660432744305789.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/UpperBounds16722660432744305789.prop.
Detected timeout of ITS tools.
[2023-03-15 15:52:59] [INFO ] Flatten gal took : 454 ms
[2023-03-15 15:53:02] [INFO ] Input system was already deterministic with 1158 transitions.
[2023-03-15 15:53:06] [INFO ] Transformed 446 places.
[2023-03-15 15:53:06] [INFO ] Transformed 1158 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-15 15:53:36] [INFO ] Time to serialize gal into /tmp/UpperBounds5131833312156000027.gal : 8 ms
[2023-03-15 15:53:36] [INFO ] Time to serialize properties into /tmp/UpperBounds4786010858485125566.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5131833312156000027.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4786010858485125566.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds4786010858485125566.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 4883392 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15834796 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="PolyORBLF-PT-S04J04T08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is PolyORBLF-PT-S04J04T08, 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 r293-tall-167873945600549"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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