Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r496-tall-171640602600077.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is FlexibleBarrier-PT-12b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640602600077
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 964K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 08:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 13 08:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 13 08:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 08:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 536K May 18 16:42 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 FlexibleBarrier-PT-12b-UpperBounds-00
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-01
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-02
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-03
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-04
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-05
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-06
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-07
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-08
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-09
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-10
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-11
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-12
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-13
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-14
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717182543057

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-12b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:09:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 19:09:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:09:04] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2024-05-31 19:09:04] [INFO ] Transformed 1988 places.
[2024-05-31 19:09:04] [INFO ] Transformed 2289 transitions.
[2024-05-31 19:09:04] [INFO ] Found NUPN structural information;
[2024-05-31 19:09:04] [INFO ] Parsed PT model containing 1988 places and 2289 transitions and 5727 arcs in 265 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 2289 rows 1988 cols
[2024-05-31 19:09:04] [INFO ] Computed 14 invariants in 64 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (116 resets) in 58 ms. (169 steps per ms)
FORMULA FlexibleBarrier-PT-12b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100010 steps (111 resets) in 120 ms. (826 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-31 19:09:04] [INFO ] Invariant cache hit.
[2024-05-31 19:09:05] [INFO ] [Real]Absence check using 14 positive place invariants in 39 ms returned sat
[2024-05-31 19:09:06] [INFO ] [Real]Absence check using state equation in 651 ms returned sat
[2024-05-31 19:09:07] [INFO ] Deduced a trap composed of 734 places in 1030 ms of which 93 ms to minimize.
[2024-05-31 19:09:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:09:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 43 ms returned sat
[2024-05-31 19:09:08] [INFO ] [Nat]Absence check using state equation in 708 ms returned sat
[2024-05-31 19:09:09] [INFO ] Deduced a trap composed of 734 places in 898 ms of which 12 ms to minimize.
[2024-05-31 19:09:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1069 ms
[2024-05-31 19:09:09] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 165 ms.
[2024-05-31 19:09:12] [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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 19:09:12] [INFO ] [Real]Absence check using 14 positive place invariants in 37 ms returned sat
[2024-05-31 19:09:13] [INFO ] [Real]Absence check using state equation in 692 ms returned sat
[2024-05-31 19:09:14] [INFO ] Deduced a trap composed of 661 places in 881 ms of which 14 ms to minimize.
[2024-05-31 19:09:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:09:14] [INFO ] [Nat]Absence check using 14 positive place invariants in 41 ms returned sat
[2024-05-31 19:09:15] [INFO ] [Nat]Absence check using state equation in 645 ms returned sat
[2024-05-31 19:09:16] [INFO ] Deduced a trap composed of 661 places in 924 ms of which 10 ms to minimize.
[2024-05-31 19:09:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1066 ms
[2024-05-31 19:09:16] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 163 ms.
[2024-05-31 19:09:19] [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 1
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 19:09:19] [INFO ] [Real]Absence check using 14 positive place invariants in 36 ms returned sat
[2024-05-31 19:09:20] [INFO ] [Real]Absence check using state equation in 701 ms returned sat
[2024-05-31 19:09:21] [INFO ] Deduced a trap composed of 213 places in 912 ms of which 11 ms to minimize.
[2024-05-31 19:09:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:09:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 38 ms returned sat
[2024-05-31 19:09:22] [INFO ] [Nat]Absence check using state equation in 700 ms returned sat
[2024-05-31 19:09:23] [INFO ] Deduced a trap composed of 213 places in 933 ms of which 11 ms to minimize.
[2024-05-31 19:09:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1071 ms
[2024-05-31 19:09:23] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 103 ms.
Maximisation of solution failed !
Minimization took 9 ms.
[2024-05-31 19:09:27] [INFO ] [Real]Absence check using 14 positive place invariants in 41 ms returned sat
[2024-05-31 19:09:28] [INFO ] [Real]Absence check using state equation in 921 ms returned sat
[2024-05-31 19:09:28] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 113 ms.
[2024-05-31 19:09:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:09:28] [INFO ] [Nat]Absence check using 14 positive place invariants in 39 ms returned sat
[2024-05-31 19:09:29] [INFO ] [Nat]Absence check using state equation in 937 ms returned sat
[2024-05-31 19:09:30] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 131 ms.
[2024-05-31 19:09:33] [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: Broken pipe ... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 19:09:33] [INFO ] [Real]Absence check using 14 positive place invariants in 40 ms returned sat
[2024-05-31 19:09:34] [INFO ] [Real]Absence check using state equation in 909 ms returned sat
[2024-05-31 19:09:35] [INFO ] Deduced a trap composed of 121 places in 327 ms of which 7 ms to minimize.
[2024-05-31 19:09:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:09:35] [INFO ] [Nat]Absence check using 14 positive place invariants in 37 ms returned sat
[2024-05-31 19:09:36] [INFO ] [Nat]Absence check using state equation in 912 ms returned sat
[2024-05-31 19:09:36] [INFO ] Deduced a trap composed of 121 places in 325 ms of which 6 ms to minimize.
[2024-05-31 19:09:37] [INFO ] Deduced a trap composed of 70 places in 306 ms of which 5 ms to minimize.
[2024-05-31 19:09:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 825 ms
[2024-05-31 19:09:37] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 116 ms.
[2024-05-31 19:09:40] [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 4
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 19:09:40] [INFO ] [Real]Absence check using 14 positive place invariants in 39 ms returned sat
[2024-05-31 19:09:41] [INFO ] [Real]Absence check using state equation in 704 ms returned sat
[2024-05-31 19:09:42] [INFO ] Deduced a trap composed of 673 places in 750 ms of which 10 ms to minimize.
[2024-05-31 19:09:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:09:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 38 ms returned sat
[2024-05-31 19:09:43] [INFO ] [Nat]Absence check using state equation in 700 ms returned sat
[2024-05-31 19:09:44] [INFO ] Deduced a trap composed of 673 places in 741 ms of which 9 ms to minimize.
[2024-05-31 19:09:44] [INFO ] Deduced a trap composed of 114 places in 174 ms of which 3 ms to minimize.
[2024-05-31 19:09:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1122 ms
[2024-05-31 19:09:44] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 119 ms.
[2024-05-31 19:09:47] [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 5
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 19:09:47] [INFO ] [Real]Absence check using 14 positive place invariants in 37 ms returned sat
[2024-05-31 19:09:48] [INFO ] [Real]Absence check using state equation in 646 ms returned sat
[2024-05-31 19:09:48] [INFO ] Deduced a trap composed of 222 places in 134 ms of which 3 ms to minimize.
[2024-05-31 19:09:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:09:49] [INFO ] [Nat]Absence check using 14 positive place invariants in 38 ms returned sat
[2024-05-31 19:09:49] [INFO ] [Nat]Absence check using state equation in 628 ms returned sat
[2024-05-31 19:09:49] [INFO ] Deduced a trap composed of 222 places in 136 ms of which 3 ms to minimize.
[2024-05-31 19:09:50] [INFO ] Deduced a trap composed of 212 places in 145 ms of which 3 ms to minimize.
[2024-05-31 19:09:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 462 ms
[2024-05-31 19:09:50] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 116 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-31 19:09:54] [INFO ] [Real]Absence check using 14 positive place invariants in 36 ms returned sat
[2024-05-31 19:09:55] [INFO ] [Real]Absence check using state equation in 932 ms returned sat
[2024-05-31 19:09:56] [INFO ] Deduced a trap composed of 73 places in 930 ms of which 10 ms to minimize.
[2024-05-31 19:09:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:09:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 40 ms returned sat
[2024-05-31 19:09:57] [INFO ] [Nat]Absence check using state equation in 931 ms returned sat
[2024-05-31 19:09:58] [INFO ] Deduced a trap composed of 73 places in 908 ms of which 11 ms to minimize.
[2024-05-31 19:09:59] [INFO ] Deduced a trap composed of 205 places in 837 ms of which 10 ms to minimize.
[2024-05-31 19:09:59] [INFO ] Deduced a trap composed of 121 places in 187 ms of which 4 ms to minimize.
[2024-05-31 19:09:59] [INFO ] Deduced a trap composed of 70 places in 156 ms of which 3 ms to minimize.
[2024-05-31 19:09:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2460 ms
[2024-05-31 19:10:00] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 112 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-31 19:10:01] [INFO ] [Real]Absence check using 14 positive place invariants in 36 ms returned sat
[2024-05-31 19:10:02] [INFO ] [Real]Absence check using state equation in 924 ms returned sat
[2024-05-31 19:10:03] [INFO ] Deduced a trap composed of 701 places in 784 ms of which 9 ms to minimize.
[2024-05-31 19:10:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:10:03] [INFO ] [Nat]Absence check using 14 positive place invariants in 37 ms returned sat
[2024-05-31 19:10:04] [INFO ] [Nat]Absence check using state equation in 866 ms returned sat
[2024-05-31 19:10:05] [INFO ] Deduced a trap composed of 701 places in 787 ms of which 10 ms to minimize.
[2024-05-31 19:10:06] [INFO ] Deduced a trap composed of 673 places in 744 ms of which 10 ms to minimize.
[2024-05-31 19:10:07] [INFO ] Deduced a trap composed of 708 places in 689 ms of which 9 ms to minimize.
[2024-05-31 19:10:07] [INFO ] Deduced a trap composed of 652 places in 699 ms of which 9 ms to minimize.
[2024-05-31 19:10:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3297 ms
[2024-05-31 19:10:08] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 112 ms.
[2024-05-31 19:10:08] [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 8
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 19:10:08] [INFO ] [Real]Absence check using 14 positive place invariants in 36 ms returned sat
[2024-05-31 19:10:09] [INFO ] [Real]Absence check using state equation in 663 ms returned sat
[2024-05-31 19:10:09] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 135 ms.
[2024-05-31 19:10:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:10:10] [INFO ] [Nat]Absence check using 14 positive place invariants in 38 ms returned sat
[2024-05-31 19:10:11] [INFO ] [Nat]Absence check using state equation in 678 ms returned sat
[2024-05-31 19:10:11] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 111 ms.
[2024-05-31 19:10:15] [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: Broken pipe ... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 10 out of 1988 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1988/1988 places, 2289/2289 transitions.
Graph (trivial) has 1937 edges and 1988 vertex of which 74 / 1988 are part of one of the 12 SCC in 10 ms
Free SCC test removed 62 places
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 496 transitions
Trivial Post-agglo rules discarded 496 transitions
Performed 496 trivial Post agglomeration. Transition count delta: 496
Iterating post reduction 0 with 496 rules applied. Total rules applied 497 place count 1926 transition count 1718
Reduce places removed 496 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 498 rules applied. Total rules applied 995 place count 1430 transition count 1716
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 997 place count 1428 transition count 1716
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 126 Pre rules applied. Total rules applied 997 place count 1428 transition count 1590
Deduced a syphon composed of 126 places in 2 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 252 rules applied. Total rules applied 1249 place count 1302 transition count 1590
Discarding 747 places :
Symmetric choice reduction at 3 with 747 rule applications. Total rules 1996 place count 555 transition count 843
Iterating global reduction 3 with 747 rules applied. Total rules applied 2743 place count 555 transition count 843
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 2743 place count 555 transition count 832
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 2765 place count 544 transition count 832
Discarding 118 places :
Symmetric choice reduction at 3 with 118 rule applications. Total rules 2883 place count 426 transition count 714
Iterating global reduction 3 with 118 rules applied. Total rules applied 3001 place count 426 transition count 714
Ensure Unique test removed 113 transitions
Reduce isomorphic transitions removed 113 transitions.
Iterating post reduction 3 with 113 rules applied. Total rules applied 3114 place count 426 transition count 601
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 4 with 128 rules applied. Total rules applied 3242 place count 362 transition count 537
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 3266 place count 362 transition count 513
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 3278 place count 350 transition count 501
Iterating global reduction 5 with 12 rules applied. Total rules applied 3290 place count 350 transition count 501
Free-agglomeration rule applied 274 times.
Iterating global reduction 5 with 274 rules applied. Total rules applied 3564 place count 350 transition count 227
Reduce places removed 274 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Graph (complete) has 213 edges and 76 vertex of which 66 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 394 rules applied. Total rules applied 3958 place count 66 transition count 108
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 3972 place count 66 transition count 94
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 3973 place count 65 transition count 93
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 50 edges and 64 vertex of which 20 / 64 are part of one of the 10 SCC in 0 ms
Free SCC test removed 10 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 3975 place count 54 transition count 93
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 3995 place count 54 transition count 73
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 10 Pre rules applied. Total rules applied 3995 place count 54 transition count 63
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 9 with 20 rules applied. Total rules applied 4015 place count 44 transition count 63
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 4025 place count 44 transition count 53
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 10 with 20 rules applied. Total rules applied 4045 place count 34 transition count 43
Free-agglomeration rule applied 10 times.
Iterating global reduction 10 with 10 rules applied. Total rules applied 4055 place count 34 transition count 33
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 10 with 26 rules applied. Total rules applied 4081 place count 18 transition count 23
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4082 place count 18 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 4083 place count 17 transition count 22
Applied a total of 4083 rules in 395 ms. Remains 17 /1988 variables (removed 1971) and now considering 22/2289 (removed 2267) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 405 ms. Remains : 17/1988 places, 22/2289 transitions.
// Phase 1: matrix 22 rows 17 cols
[2024-05-31 19:10:15] [INFO ] Computed 5 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 932 ms. (1071 steps per ms)
FORMULA FlexibleBarrier-PT-12b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 240 ms. (4149 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 72534 ms.
ITS solved all properties within timeout

BK_STOP 1717182616826

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="FlexibleBarrier-PT-12b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FlexibleBarrier-PT-12b, 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 r496-tall-171640602600077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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