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.r519-tall-167987245000253.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is EisenbergMcGuire-PT-07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r519-tall-167987245000253
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.5K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 17K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 1.2M Mar 31 16:48 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 EisenbergMcGuire-PT-07-UpperBounds-00
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-01
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-02
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-03
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-04
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-05
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-06
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-07
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-08
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-09
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-10
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-11
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-12
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-13
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-14
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1680819849867

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-07
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-06 22:24:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-04-06 22:24:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 22:24:11] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2023-04-06 22:24:11] [INFO ] Transformed 553 places.
[2023-04-06 22:24:11] [INFO ] Transformed 1960 transitions.
[2023-04-06 22:24:11] [INFO ] Found NUPN structural information;
[2023-04-06 22:24:11] [INFO ] Parsed PT model containing 553 places and 1960 transitions and 9212 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Normalized transition count is 1001 out of 1960 initially.
// Phase 1: matrix 1001 rows 553 cols
[2023-04-06 22:24:11] [INFO ] Computed 22 invariants in 28 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 16) seen :11
FORMULA EisenbergMcGuire-PT-07-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 5) seen :0
[2023-04-06 22:24:11] [INFO ] Flow matrix only has 1001 transitions (discarded 959 similar events)
// Phase 1: matrix 1001 rows 553 cols
[2023-04-06 22:24:11] [INFO ] Computed 22 invariants in 7 ms
[2023-04-06 22:24:12] [INFO ] [Real]Absence check using 15 positive place invariants in 17 ms returned sat
[2023-04-06 22:24:12] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-06 22:24:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:24:12] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2023-04-06 22:24:12] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:24:12] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2023-04-06 22:24:12] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-06 22:24:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:24:12] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2023-04-06 22:24:12] [INFO ] State equation strengthened by 472 read => feed constraints.
[2023-04-06 22:24:12] [INFO ] [Nat]Added 472 Read/Feed constraints in 64 ms returned sat
[2023-04-06 22:24:13] [INFO ] Deduced a trap composed of 3 places in 210 ms of which 3 ms to minimize.
[2023-04-06 22:24:13] [INFO ] Deduced a trap composed of 3 places in 238 ms of which 0 ms to minimize.
[2023-04-06 22:24:13] [INFO ] Deduced a trap composed of 3 places in 219 ms of which 1 ms to minimize.
[2023-04-06 22:24:13] [INFO ] Deduced a trap composed of 20 places in 200 ms of which 2 ms to minimize.
[2023-04-06 22:24:14] [INFO ] Deduced a trap composed of 3 places in 203 ms of which 1 ms to minimize.
[2023-04-06 22:24:14] [INFO ] Deduced a trap composed of 40 places in 190 ms of which 0 ms to minimize.
[2023-04-06 22:24:14] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 0 ms to minimize.
[2023-04-06 22:24:14] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 1 ms to minimize.
[2023-04-06 22:24:14] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 0 ms to minimize.
[2023-04-06 22:24:15] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 1 ms to minimize.
[2023-04-06 22:24:15] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 1 ms to minimize.
[2023-04-06 22:24:15] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 0 ms to minimize.
[2023-04-06 22:24:15] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2561 ms
[2023-04-06 22:24:15] [INFO ] Computed and/alt/rep : 680/1520/554 causal constraints (skipped 440 transitions) in 90 ms.
[2023-04-06 22:24:17] [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.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-06 22:24:17] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2023-04-06 22:24:17] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 22:24:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:24:17] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2023-04-06 22:24:17] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:24:17] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2023-04-06 22:24:17] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 22:24:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:24:18] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2023-04-06 22:24:18] [INFO ] [Nat]Added 472 Read/Feed constraints in 48 ms returned sat
[2023-04-06 22:24:18] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 0 ms to minimize.
[2023-04-06 22:24:18] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 1 ms to minimize.
[2023-04-06 22:24:18] [INFO ] Deduced a trap composed of 3 places in 177 ms of which 0 ms to minimize.
[2023-04-06 22:24:18] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 0 ms to minimize.
[2023-04-06 22:24:19] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 1 ms to minimize.
[2023-04-06 22:24:19] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 0 ms to minimize.
[2023-04-06 22:24:19] [INFO ] Deduced a trap composed of 69 places in 90 ms of which 0 ms to minimize.
[2023-04-06 22:24:19] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2023-04-06 22:24:19] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 0 ms to minimize.
[2023-04-06 22:24:19] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2023-04-06 22:24:19] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1585 ms
[2023-04-06 22:24:19] [INFO ] Computed and/alt/rep : 680/1520/554 causal constraints (skipped 440 transitions) in 93 ms.
[2023-04-06 22:24:23] [INFO ] Deduced a trap composed of 3 places in 262 ms of which 1 ms to minimize.
[2023-04-06 22:24:23] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-06 22:24:23] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2023-04-06 22:24:23] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 22:24:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:24:23] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2023-04-06 22:24:23] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:24:23] [INFO ] [Nat]Absence check using 15 positive place invariants in 13 ms returned sat
[2023-04-06 22:24:23] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-06 22:24:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:24:23] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2023-04-06 22:24:23] [INFO ] [Nat]Added 472 Read/Feed constraints in 58 ms returned sat
[2023-04-06 22:24:23] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 0 ms to minimize.
[2023-04-06 22:24:24] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 0 ms to minimize.
[2023-04-06 22:24:24] [INFO ] Deduced a trap composed of 48 places in 177 ms of which 1 ms to minimize.
[2023-04-06 22:24:24] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 0 ms to minimize.
[2023-04-06 22:24:24] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 0 ms to minimize.
[2023-04-06 22:24:25] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 0 ms to minimize.
[2023-04-06 22:24:25] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 0 ms to minimize.
[2023-04-06 22:24:25] [INFO ] Deduced a trap composed of 190 places in 156 ms of which 0 ms to minimize.
[2023-04-06 22:24:25] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 0 ms to minimize.
[2023-04-06 22:24:25] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 0 ms to minimize.
[2023-04-06 22:24:26] [INFO ] Deduced a trap composed of 3 places in 176 ms of which 1 ms to minimize.
[2023-04-06 22:24:26] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 4 ms to minimize.
[2023-04-06 22:24:26] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 1 ms to minimize.
[2023-04-06 22:24:26] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 0 ms to minimize.
[2023-04-06 22:24:26] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 0 ms to minimize.
[2023-04-06 22:24:26] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 1 ms to minimize.
[2023-04-06 22:24:26] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2023-04-06 22:24:26] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 0 ms to minimize.
[2023-04-06 22:24:27] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3278 ms
[2023-04-06 22:24:27] [INFO ] Computed and/alt/rep : 680/1520/554 causal constraints (skipped 440 transitions) in 72 ms.
[2023-04-06 22:24:28] [INFO ] Added : 120 causal constraints over 24 iterations in 1378 ms. Result :unknown
[2023-04-06 22:24:28] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2023-04-06 22:24:28] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 22:24:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:24:28] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2023-04-06 22:24:28] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:24:28] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2023-04-06 22:24:28] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 22:24:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:24:29] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2023-04-06 22:24:29] [INFO ] [Nat]Added 472 Read/Feed constraints in 73 ms returned sat
[2023-04-06 22:24:29] [INFO ] Deduced a trap composed of 44 places in 207 ms of which 1 ms to minimize.
[2023-04-06 22:24:29] [INFO ] Deduced a trap composed of 3 places in 201 ms of which 1 ms to minimize.
[2023-04-06 22:24:29] [INFO ] Deduced a trap composed of 104 places in 204 ms of which 1 ms to minimize.
[2023-04-06 22:24:30] [INFO ] Deduced a trap composed of 33 places in 208 ms of which 0 ms to minimize.
[2023-04-06 22:24:30] [INFO ] Deduced a trap composed of 3 places in 203 ms of which 0 ms to minimize.
[2023-04-06 22:24:30] [INFO ] Deduced a trap composed of 35 places in 176 ms of which 0 ms to minimize.
[2023-04-06 22:24:30] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 0 ms to minimize.
[2023-04-06 22:24:30] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 0 ms to minimize.
[2023-04-06 22:24:31] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 0 ms to minimize.
[2023-04-06 22:24:31] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 0 ms to minimize.
[2023-04-06 22:24:31] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 0 ms to minimize.
[2023-04-06 22:24:31] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 0 ms to minimize.
[2023-04-06 22:24:31] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 1 ms to minimize.
[2023-04-06 22:24:31] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 0 ms to minimize.
[2023-04-06 22:24:31] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2023-04-06 22:24:31] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 4 ms to minimize.
[2023-04-06 22:24:32] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2023-04-06 22:24:32] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3015 ms
[2023-04-06 22:24:32] [INFO ] Computed and/alt/rep : 680/1520/554 causal constraints (skipped 440 transitions) in 66 ms.
[2023-04-06 22:24: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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-06 22:24:33] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2023-04-06 22:24:33] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 22:24:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:24:34] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2023-04-06 22:24:34] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:24:34] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2023-04-06 22:24:34] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 22:24:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:24:34] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2023-04-06 22:24:34] [INFO ] [Nat]Added 472 Read/Feed constraints in 50 ms returned sat
[2023-04-06 22:24:34] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 1 ms to minimize.
[2023-04-06 22:24:34] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 1 ms to minimize.
[2023-04-06 22:24:35] [INFO ] Deduced a trap composed of 111 places in 201 ms of which 0 ms to minimize.
[2023-04-06 22:24:35] [INFO ] Deduced a trap composed of 29 places in 204 ms of which 1 ms to minimize.
[2023-04-06 22:24:35] [INFO ] Deduced a trap composed of 3 places in 209 ms of which 1 ms to minimize.
[2023-04-06 22:24:35] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 1 ms to minimize.
[2023-04-06 22:24:36] [INFO ] Deduced a trap composed of 39 places in 202 ms of which 1 ms to minimize.
[2023-04-06 22:24:36] [INFO ] Deduced a trap composed of 78 places in 203 ms of which 2 ms to minimize.
[2023-04-06 22:24:36] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 0 ms to minimize.
[2023-04-06 22:24:36] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 3 ms to minimize.
[2023-04-06 22:24:36] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 0 ms to minimize.
[2023-04-06 22:24:37] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 0 ms to minimize.
[2023-04-06 22:24:37] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 1 ms to minimize.
[2023-04-06 22:24:37] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 1 ms to minimize.
[2023-04-06 22:24:37] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2023-04-06 22:24:37] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3066 ms
[2023-04-06 22:24:37] [INFO ] Computed and/alt/rep : 680/1520/554 causal constraints (skipped 440 transitions) in 69 ms.
[2023-04-06 22:24:39] [INFO ] Deduced a trap composed of 3 places in 228 ms of which 1 ms to minimize.
[2023-04-06 22:24:39] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA EisenbergMcGuire-PT-07-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 1960/1960 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 553 transition count 1953
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 546 transition count 1953
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 153 Pre rules applied. Total rules applied 14 place count 546 transition count 1800
Deduced a syphon composed of 153 places in 2 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 306 rules applied. Total rules applied 320 place count 393 transition count 1800
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 362 place count 351 transition count 1506
Iterating global reduction 2 with 42 rules applied. Total rules applied 404 place count 351 transition count 1506
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 488 place count 309 transition count 1464
Applied a total of 488 rules in 184 ms. Remains 309 /553 variables (removed 244) and now considering 1464/1960 (removed 496) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 309/553 places, 1464/1960 transitions.
Normalized transition count is 505 out of 1464 initially.
// Phase 1: matrix 505 rows 309 cols
[2023-04-06 22:24:39] [INFO ] Computed 22 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1682 ms. (steps per millisecond=594 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 457 ms. (steps per millisecond=2188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 429 ms. (steps per millisecond=2331 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 454 ms. (steps per millisecond=2202 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 428 ms. (steps per millisecond=2336 ) properties (out of 4) seen :0
[2023-04-06 22:24:43] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
// Phase 1: matrix 505 rows 309 cols
[2023-04-06 22:24:43] [INFO ] Computed 22 invariants in 8 ms
[2023-04-06 22:24:43] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 22:24:43] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 22:24:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:24:43] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2023-04-06 22:24:43] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:24:43] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 22:24:43] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 22:24:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:24:43] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2023-04-06 22:24:43] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:24:43] [INFO ] [Nat]Added 220 Read/Feed constraints in 28 ms returned sat
[2023-04-06 22:24:43] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2023-04-06 22:24:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-04-06 22:24:43] [INFO ] Computed and/alt/rep : 436/1058/310 causal constraints (skipped 188 transitions) in 38 ms.
[2023-04-06 22:24:44] [INFO ] Added : 82 causal constraints over 17 iterations in 560 ms. Result :sat
Minimization took 72 ms.
[2023-04-06 22:24:44] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 22:24:44] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 22:24:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:24:44] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2023-04-06 22:24:44] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:24:44] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 22:24:44] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 22:24:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:24:44] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2023-04-06 22:24:44] [INFO ] [Nat]Added 220 Read/Feed constraints in 25 ms returned sat
[2023-04-06 22:24:44] [INFO ] Computed and/alt/rep : 436/1058/310 causal constraints (skipped 188 transitions) in 44 ms.
[2023-04-06 22:24:45] [INFO ] Added : 27 causal constraints over 6 iterations in 234 ms. Result :sat
Minimization took 52 ms.
[2023-04-06 22:24:45] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 22:24:45] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 22:24:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:24:45] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2023-04-06 22:24:45] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:24:45] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 22:24:45] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 22:24:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:24:45] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2023-04-06 22:24:45] [INFO ] [Nat]Added 220 Read/Feed constraints in 30 ms returned sat
[2023-04-06 22:24:45] [INFO ] Computed and/alt/rep : 436/1058/310 causal constraints (skipped 188 transitions) in 36 ms.
[2023-04-06 22:24:45] [INFO ] Added : 26 causal constraints over 6 iterations in 236 ms. Result :sat
Minimization took 55 ms.
[2023-04-06 22:24:45] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 22:24:45] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 22:24:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:24:45] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2023-04-06 22:24:45] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:24:46] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 22:24:46] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 22:24:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:24:46] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2023-04-06 22:24:46] [INFO ] [Nat]Added 220 Read/Feed constraints in 20 ms returned sat
[2023-04-06 22:24:46] [INFO ] Computed and/alt/rep : 436/1058/310 causal constraints (skipped 188 transitions) in 60 ms.
[2023-04-06 22:24:46] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2023-04-06 22:24:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2023-04-06 22:24:46] [INFO ] Added : 79 causal constraints over 17 iterations in 688 ms. Result :sat
Minimization took 67 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA EisenbergMcGuire-PT-07-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 42 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 309/309 places, 1464/1464 transitions.
Normalized transition count is 505 out of 1464 initially.
// Phase 1: matrix 505 rows 309 cols
[2023-04-06 22:24:47] [INFO ] Computed 22 invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1616 ms. (steps per millisecond=618 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 461 ms. (steps per millisecond=2169 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 466 ms. (steps per millisecond=2145 ) properties (out of 2) seen :0
[2023-04-06 22:24:49] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
// Phase 1: matrix 505 rows 309 cols
[2023-04-06 22:24:49] [INFO ] Computed 22 invariants in 6 ms
[2023-04-06 22:24:49] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 22:24:49] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 22:24:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:24:49] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2023-04-06 22:24:50] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:24:50] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 22:24:50] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 22:24:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:24:50] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2023-04-06 22:24:50] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:24:50] [INFO ] [Nat]Added 220 Read/Feed constraints in 27 ms returned sat
[2023-04-06 22:24:50] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2023-04-06 22:24:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-04-06 22:24:50] [INFO ] Computed and/alt/rep : 436/1058/310 causal constraints (skipped 188 transitions) in 42 ms.
[2023-04-06 22:24:50] [INFO ] Added : 82 causal constraints over 17 iterations in 578 ms. Result :sat
Minimization took 68 ms.
[2023-04-06 22:24:51] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 22:24:51] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 22:24:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:24:51] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2023-04-06 22:24:51] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:24:51] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 22:24:51] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 22:24:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:24:51] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2023-04-06 22:24:51] [INFO ] [Nat]Added 220 Read/Feed constraints in 21 ms returned sat
[2023-04-06 22:24:51] [INFO ] Computed and/alt/rep : 436/1058/310 causal constraints (skipped 188 transitions) in 42 ms.
[2023-04-06 22:24:51] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-04-06 22:24:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-04-06 22:24:51] [INFO ] Added : 79 causal constraints over 17 iterations in 639 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 35 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 309/309 places, 1464/1464 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 32 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
[2023-04-06 22:24:52] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-06 22:24:52] [INFO ] Invariant cache hit.
[2023-04-06 22:24:52] [INFO ] Implicit Places using invariants in 500 ms returned []
[2023-04-06 22:24:52] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-06 22:24:52] [INFO ] Invariant cache hit.
[2023-04-06 22:24:52] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:24:53] [INFO ] Implicit Places using invariants and state equation in 953 ms returned []
Implicit Place search using SMT with State Equation took 1468 ms to find 0 implicit places.
[2023-04-06 22:24:53] [INFO ] Redundant transitions in 84 ms returned []
[2023-04-06 22:24:53] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-06 22:24:53] [INFO ] Invariant cache hit.
[2023-04-06 22:24:54] [INFO ] Dead Transitions using invariants and state equation in 462 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2052 ms. Remains : 309/309 places, 1464/1464 transitions.
Starting property specific reduction for EisenbergMcGuire-PT-07-UpperBounds-03
Normalized transition count is 505 out of 1464 initially.
// Phase 1: matrix 505 rows 309 cols
[2023-04-06 22:24:54] [INFO ] Computed 22 invariants in 5 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-04-06 22:24:54] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
// Phase 1: matrix 505 rows 309 cols
[2023-04-06 22:24:54] [INFO ] Computed 22 invariants in 7 ms
[2023-04-06 22:24:54] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 22:24:54] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 22:24:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:24:54] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2023-04-06 22:24:54] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:24:54] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 22:24:54] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 22:24:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:24:54] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2023-04-06 22:24:54] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:24:54] [INFO ] [Nat]Added 220 Read/Feed constraints in 28 ms returned sat
[2023-04-06 22:24:54] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 0 ms to minimize.
[2023-04-06 22:24:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-04-06 22:24:54] [INFO ] Computed and/alt/rep : 436/1058/310 causal constraints (skipped 188 transitions) in 38 ms.
[2023-04-06 22:24:55] [INFO ] Added : 82 causal constraints over 17 iterations in 566 ms. Result :sat
Minimization took 67 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 309 transition count 1463
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 308 transition count 1463
Applied a total of 2 rules in 70 ms. Remains 308 /309 variables (removed 1) and now considering 1463/1464 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 308/309 places, 1463/1464 transitions.
Normalized transition count is 504 out of 1463 initially.
// Phase 1: matrix 504 rows 308 cols
[2023-04-06 22:24:55] [INFO ] Computed 22 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1664 ms. (steps per millisecond=600 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 467 ms. (steps per millisecond=2141 ) properties (out of 1) seen :0
[2023-04-06 22:24:57] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-06 22:24:57] [INFO ] Computed 22 invariants in 7 ms
[2023-04-06 22:24:57] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 22:24:57] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 22:24:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:24:57] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2023-04-06 22:24:57] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:24:58] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 22:24:58] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 22:24:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:24:58] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2023-04-06 22:24:58] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:24:58] [INFO ] [Nat]Added 220 Read/Feed constraints in 26 ms returned sat
[2023-04-06 22:24:58] [INFO ] Computed and/alt/rep : 435/1057/309 causal constraints (skipped 188 transitions) in 36 ms.
[2023-04-06 22:24:58] [INFO ] Added : 85 causal constraints over 17 iterations in 550 ms. Result :sat
Minimization took 72 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 49 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 31 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-06 22:24:58] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:24:58] [INFO ] Invariant cache hit.
[2023-04-06 22:24:59] [INFO ] Implicit Places using invariants in 259 ms returned []
[2023-04-06 22:24:59] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:24:59] [INFO ] Invariant cache hit.
[2023-04-06 22:24:59] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:25:00] [INFO ] Implicit Places using invariants and state equation in 1040 ms returned []
Implicit Place search using SMT with State Equation took 1312 ms to find 0 implicit places.
[2023-04-06 22:25:00] [INFO ] Redundant transitions in 77 ms returned []
[2023-04-06 22:25:00] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:25:00] [INFO ] Invariant cache hit.
[2023-04-06 22:25:00] [INFO ] Dead Transitions using invariants and state equation in 443 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1874 ms. Remains : 308/308 places, 1463/1463 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-07-UpperBounds-03 in 6516 ms.
Starting property specific reduction for EisenbergMcGuire-PT-07-UpperBounds-07
Normalized transition count is 505 out of 1464 initially.
// Phase 1: matrix 505 rows 309 cols
[2023-04-06 22:25:00] [INFO ] Computed 22 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-04-06 22:25:00] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
// Phase 1: matrix 505 rows 309 cols
[2023-04-06 22:25:00] [INFO ] Computed 22 invariants in 4 ms
[2023-04-06 22:25:00] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 22:25:00] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 22:25:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:25:00] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2023-04-06 22:25:00] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:25:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 22:25:01] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 22:25:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:25:01] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2023-04-06 22:25:01] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:25:01] [INFO ] [Nat]Added 220 Read/Feed constraints in 23 ms returned sat
[2023-04-06 22:25:01] [INFO ] Computed and/alt/rep : 436/1058/310 causal constraints (skipped 188 transitions) in 39 ms.
[2023-04-06 22:25:01] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-04-06 22:25:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-04-06 22:25:01] [INFO ] Added : 79 causal constraints over 17 iterations in 615 ms. Result :sat
Minimization took 67 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 32 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 309/309 places, 1464/1464 transitions.
Normalized transition count is 505 out of 1464 initially.
// Phase 1: matrix 505 rows 309 cols
[2023-04-06 22:25:02] [INFO ] Computed 22 invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1543 ms. (steps per millisecond=648 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 427 ms. (steps per millisecond=2341 ) properties (out of 1) seen :0
[2023-04-06 22:25:03] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
// Phase 1: matrix 505 rows 309 cols
[2023-04-06 22:25:04] [INFO ] Computed 22 invariants in 6 ms
[2023-04-06 22:25:04] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-04-06 22:25:04] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-06 22:25:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:25:04] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2023-04-06 22:25:04] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:25:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 22:25:04] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 22:25:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:25:04] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2023-04-06 22:25:04] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:25:04] [INFO ] [Nat]Added 220 Read/Feed constraints in 33 ms returned sat
[2023-04-06 22:25:04] [INFO ] Computed and/alt/rep : 436/1058/310 causal constraints (skipped 188 transitions) in 39 ms.
[2023-04-06 22:25:04] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-04-06 22:25:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-04-06 22:25:04] [INFO ] Added : 79 causal constraints over 17 iterations in 613 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 30 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 309/309 places, 1464/1464 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 31 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
[2023-04-06 22:25:05] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-06 22:25:05] [INFO ] Invariant cache hit.
[2023-04-06 22:25:05] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-04-06 22:25:05] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-06 22:25:05] [INFO ] Invariant cache hit.
[2023-04-06 22:25:05] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:25:06] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 1243 ms to find 0 implicit places.
[2023-04-06 22:25:06] [INFO ] Redundant transitions in 30 ms returned []
[2023-04-06 22:25:06] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-06 22:25:06] [INFO ] Invariant cache hit.
[2023-04-06 22:25:07] [INFO ] Dead Transitions using invariants and state equation in 543 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1872 ms. Remains : 309/309 places, 1464/1464 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-07-UpperBounds-07 in 6268 ms.
[2023-04-06 22:25:07] [INFO ] Flatten gal took : 123 ms
[2023-04-06 22:25:07] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-04-06 22:25:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 309 places, 1464 transitions and 7632 arcs took 9 ms.
Total runtime 56007 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT EisenbergMcGuire-PT-07
BK_EXAMINATION: UpperBounds
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
Upper Bounds

FORMULA EisenbergMcGuire-PT-07-UpperBounds-07 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EisenbergMcGuire-PT-07-UpperBounds-03 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1680819909044

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/UpperBounds.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 8 (type EXCL) for 3 EisenbergMcGuire-PT-07-UpperBounds-07
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 6 (type FNDP) for 3 EisenbergMcGuire-PT-07-UpperBounds-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 7 (type EQUN) for 3 EisenbergMcGuire-PT-07-UpperBounds-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 9 (type FNDP) for 0 EisenbergMcGuire-PT-07-UpperBounds-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 1
lola: REPORT NUM
lola: FINISHED task # 8 (type EXCL) for EisenbergMcGuire-PT-07-UpperBounds-07
lola: markings : 1608
lola: fired transitions : 2495
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 6 (type FNDP) for EisenbergMcGuire-PT-07-UpperBounds-07 (obsolete)
lola: CANCELED task # 7 (type EQUN) for EisenbergMcGuire-PT-07-UpperBounds-07 (obsolete)
lola: LAUNCH task # 11 (type EXCL) for 0 EisenbergMcGuire-PT-07-UpperBounds-03
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 10 (type EQUN) for 0 EisenbergMcGuire-PT-07-UpperBounds-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 1
sara: try reading problem file /home/mcc/execution/375/UpperBounds-7.sara.
sara: try reading problem file /home/mcc/execution/375/UpperBounds-10.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: REPORT NUM
lola: FINISHED task # 11 (type EXCL) for EisenbergMcGuire-PT-07-UpperBounds-03
lola: markings : 34220
lola: fired transitions : 57928
lola: time used : 1.000000
lola: memory pages used : 1
lola: CANCELED task # 9 (type FNDP) for EisenbergMcGuire-PT-07-UpperBounds-03 (obsolete)
lola: CANCELED task # 10 (type EQUN) for EisenbergMcGuire-PT-07-UpperBounds-03 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-07-UpperBounds-03: BOUND 1 state space
EisenbergMcGuire-PT-07-UpperBounds-07: BOUND 1 state space


Time elapsed: 1 secs. Pages in use: 1

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="EisenbergMcGuire-PT-07"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is EisenbergMcGuire-PT-07, 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 r519-tall-167987245000253"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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