fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r522-tall-167987247100253
Last Updated
May 14, 2023

About the Execution of Marcie+red for EisenbergMcGuire-PT-07

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6800.712 3600000.00 3658396.00 10470.50 1 1 1 ? 1 1 1 ? 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r522-tall-167987247100253.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 marciexred
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 r522-tall-167987247100253
=====================================================================

--------------------
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 1680828325907

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-07
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 00:45:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-04-07 00:45:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 00:45:27] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2023-04-07 00:45:27] [INFO ] Transformed 553 places.
[2023-04-07 00:45:27] [INFO ] Transformed 1960 transitions.
[2023-04-07 00:45:27] [INFO ] Found NUPN structural information;
[2023-04-07 00:45:27] [INFO ] Parsed PT model containing 553 places and 1960 transitions and 9212 arcs in 197 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-07 00:45:27] [INFO ] Computed 22 invariants in 32 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) 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 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 9 ms. (steps per millisecond=1111 ) properties (out of 5) seen :0
[2023-04-07 00:45:27] [INFO ] Flow matrix only has 1001 transitions (discarded 959 similar events)
// Phase 1: matrix 1001 rows 553 cols
[2023-04-07 00:45:27] [INFO ] Computed 22 invariants in 14 ms
[2023-04-07 00:45:28] [INFO ] [Real]Absence check using 15 positive place invariants in 15 ms returned sat
[2023-04-07 00:45:28] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 00:45:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 00:45:28] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2023-04-07 00:45:28] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 00:45:28] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2023-04-07 00:45:28] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 00:45:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 00:45:28] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2023-04-07 00:45:28] [INFO ] State equation strengthened by 472 read => feed constraints.
[2023-04-07 00:45:28] [INFO ] [Nat]Added 472 Read/Feed constraints in 71 ms returned sat
[2023-04-07 00:45:29] [INFO ] Deduced a trap composed of 3 places in 237 ms of which 6 ms to minimize.
[2023-04-07 00:45:29] [INFO ] Deduced a trap composed of 3 places in 213 ms of which 1 ms to minimize.
[2023-04-07 00:45:29] [INFO ] Deduced a trap composed of 3 places in 246 ms of which 1 ms to minimize.
[2023-04-07 00:45:30] [INFO ] Deduced a trap composed of 20 places in 229 ms of which 1 ms to minimize.
[2023-04-07 00:45:30] [INFO ] Deduced a trap composed of 3 places in 190 ms of which 1 ms to minimize.
[2023-04-07 00:45:30] [INFO ] Deduced a trap composed of 40 places in 184 ms of which 1 ms to minimize.
[2023-04-07 00:45:30] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 0 ms to minimize.
[2023-04-07 00:45:30] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 1 ms to minimize.
[2023-04-07 00:45:31] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 0 ms to minimize.
[2023-04-07 00:45:31] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 0 ms to minimize.
[2023-04-07 00:45:31] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 0 ms to minimize.
[2023-04-07 00:45:31] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 0 ms to minimize.
[2023-04-07 00:45:31] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2625 ms
[2023-04-07 00:45:31] [INFO ] Computed and/alt/rep : 680/1520/554 causal constraints (skipped 440 transitions) in 93 ms.
[2023-04-07 00:45:33] [INFO ] Deduced a trap composed of 3 places in 233 ms of which 0 ms to minimize.
[2023-04-07 00:45: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: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java: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-07 00:45:33] [INFO ] [Real]Absence check using 15 positive place invariants in 13 ms returned sat
[2023-04-07 00:45:33] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 00:45:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 00:45:34] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2023-04-07 00:45:34] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 00:45:34] [INFO ] [Nat]Absence check using 15 positive place invariants in 13 ms returned sat
[2023-04-07 00:45:34] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 00:45:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 00:45:34] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2023-04-07 00:45:34] [INFO ] [Nat]Added 472 Read/Feed constraints in 49 ms returned sat
[2023-04-07 00:45:34] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 1 ms to minimize.
[2023-04-07 00:45:34] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 1 ms to minimize.
[2023-04-07 00:45:35] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 1 ms to minimize.
[2023-04-07 00:45:35] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 0 ms to minimize.
[2023-04-07 00:45:35] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 0 ms to minimize.
[2023-04-07 00:45:35] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 1 ms to minimize.
[2023-04-07 00:45:35] [INFO ] Deduced a trap composed of 69 places in 87 ms of which 1 ms to minimize.
[2023-04-07 00:45:35] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 0 ms to minimize.
[2023-04-07 00:45:35] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2023-04-07 00:45:35] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2023-04-07 00:45:36] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1561 ms
[2023-04-07 00:45:36] [INFO ] Computed and/alt/rep : 680/1520/554 causal constraints (skipped 440 transitions) in 72 ms.
[2023-04-07 00:45:39] [INFO ] Added : 260 causal constraints over 52 iterations in 3102 ms. Result :unknown
[2023-04-07 00:45:39] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2023-04-07 00:45:39] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-07 00:45:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 00:45:39] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2023-04-07 00:45:39] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 00:45:39] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2023-04-07 00:45:39] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 10 ms returned sat
[2023-04-07 00:45:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 00:45:39] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2023-04-07 00:45:39] [INFO ] [Nat]Added 472 Read/Feed constraints in 52 ms returned sat
[2023-04-07 00:45:40] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 0 ms to minimize.
[2023-04-07 00:45:40] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 1 ms to minimize.
[2023-04-07 00:45:40] [INFO ] Deduced a trap composed of 48 places in 176 ms of which 1 ms to minimize.
[2023-04-07 00:45:40] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 0 ms to minimize.
[2023-04-07 00:45:40] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 0 ms to minimize.
[2023-04-07 00:45:41] [INFO ] Deduced a trap composed of 3 places in 161 ms of which 0 ms to minimize.
[2023-04-07 00:45:41] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 0 ms to minimize.
[2023-04-07 00:45:41] [INFO ] Deduced a trap composed of 190 places in 169 ms of which 1 ms to minimize.
[2023-04-07 00:45:41] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 0 ms to minimize.
[2023-04-07 00:45:41] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 0 ms to minimize.
[2023-04-07 00:45:42] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 0 ms to minimize.
[2023-04-07 00:45:42] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 4 ms to minimize.
[2023-04-07 00:45:42] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 1 ms to minimize.
[2023-04-07 00:45:42] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 0 ms to minimize.
[2023-04-07 00:45:42] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 0 ms to minimize.
[2023-04-07 00:45:42] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 0 ms to minimize.
[2023-04-07 00:45:42] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2023-04-07 00:45:43] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 0 ms to minimize.
[2023-04-07 00:45:43] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3236 ms
[2023-04-07 00:45:43] [INFO ] Computed and/alt/rep : 680/1520/554 causal constraints (skipped 440 transitions) in 62 ms.
[2023-04-07 00:45:44] [INFO ] Deduced a trap composed of 3 places in 233 ms of which 1 ms to minimize.
[2023-04-07 00:45:44] [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 2
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-07 00:45:44] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2023-04-07 00:45:44] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 00:45:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 00:45:45] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2023-04-07 00:45:45] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 00:45:45] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2023-04-07 00:45:45] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 00:45:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 00:45:45] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2023-04-07 00:45:45] [INFO ] [Nat]Added 472 Read/Feed constraints in 71 ms returned sat
[2023-04-07 00:45:45] [INFO ] Deduced a trap composed of 44 places in 189 ms of which 0 ms to minimize.
[2023-04-07 00:45:45] [INFO ] Deduced a trap composed of 3 places in 211 ms of which 1 ms to minimize.
[2023-04-07 00:45:46] [INFO ] Deduced a trap composed of 104 places in 209 ms of which 1 ms to minimize.
[2023-04-07 00:45:46] [INFO ] Deduced a trap composed of 33 places in 209 ms of which 0 ms to minimize.
[2023-04-07 00:45:46] [INFO ] Deduced a trap composed of 3 places in 206 ms of which 1 ms to minimize.
[2023-04-07 00:45:46] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 0 ms to minimize.
[2023-04-07 00:45:47] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 0 ms to minimize.
[2023-04-07 00:45:47] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 0 ms to minimize.
[2023-04-07 00:45:47] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 1 ms to minimize.
[2023-04-07 00:45:47] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 0 ms to minimize.
[2023-04-07 00:45:47] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 0 ms to minimize.
[2023-04-07 00:45:47] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 1 ms to minimize.
[2023-04-07 00:45:47] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 1 ms to minimize.
[2023-04-07 00:45:48] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2023-04-07 00:45:48] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2023-04-07 00:45:48] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 0 ms to minimize.
[2023-04-07 00:45:48] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 0 ms to minimize.
[2023-04-07 00:45:48] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3032 ms
[2023-04-07 00:45:48] [INFO ] Computed and/alt/rep : 680/1520/554 causal constraints (skipped 440 transitions) in 68 ms.
[2023-04-07 00:45:50] [INFO ] Added : 140 causal constraints over 28 iterations in 1624 ms. Result :unknown
[2023-04-07 00:45:50] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2023-04-07 00:45:50] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 00:45:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 00:45:50] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2023-04-07 00:45:50] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 00:45:50] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2023-04-07 00:45:50] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 00:45:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 00:45:50] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2023-04-07 00:45:50] [INFO ] [Nat]Added 472 Read/Feed constraints in 52 ms returned sat
[2023-04-07 00:45:51] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 1 ms to minimize.
[2023-04-07 00:45:51] [INFO ] Deduced a trap composed of 3 places in 176 ms of which 0 ms to minimize.
[2023-04-07 00:45:51] [INFO ] Deduced a trap composed of 111 places in 186 ms of which 1 ms to minimize.
[2023-04-07 00:45:51] [INFO ] Deduced a trap composed of 29 places in 218 ms of which 1 ms to minimize.
[2023-04-07 00:45:51] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 0 ms to minimize.
[2023-04-07 00:45:52] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 0 ms to minimize.
[2023-04-07 00:45:52] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 0 ms to minimize.
[2023-04-07 00:45:52] [INFO ] Deduced a trap composed of 78 places in 194 ms of which 1 ms to minimize.
[2023-04-07 00:45:52] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 0 ms to minimize.
[2023-04-07 00:45:53] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 5 ms to minimize.
[2023-04-07 00:45:53] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 1 ms to minimize.
[2023-04-07 00:45:53] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 0 ms to minimize.
[2023-04-07 00:45:53] [INFO ] Deduced a trap composed of 75 places in 131 ms of which 1 ms to minimize.
[2023-04-07 00:45:53] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2023-04-07 00:45:53] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 0 ms to minimize.
[2023-04-07 00:45:53] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3060 ms
[2023-04-07 00:45:53] [INFO ] Computed and/alt/rep : 680/1520/554 causal constraints (skipped 440 transitions) in 67 ms.
[2023-04-07 00:45:55] [INFO ] Deduced a trap composed of 3 places in 243 ms of which 1 ms to minimize.
[2023-04-07 00:45:55] [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 4 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 1 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 184 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-07 00:45:56] [INFO ] Computed 22 invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1656 ms. (steps per millisecond=603 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 459 ms. (steps per millisecond=2178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 438 ms. (steps per millisecond=2283 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 460 ms. (steps per millisecond=2173 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 430 ms. (steps per millisecond=2325 ) properties (out of 4) seen :0
[2023-04-07 00:45:59] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
// Phase 1: matrix 505 rows 309 cols
[2023-04-07 00:45:59] [INFO ] Computed 22 invariants in 6 ms
[2023-04-07 00:46:00] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 00:46:00] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 00:46:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 00:46:00] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2023-04-07 00:46:00] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 00:46:00] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 00:46:00] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 00:46:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 00:46:00] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-04-07 00:46:00] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:46:00] [INFO ] [Nat]Added 220 Read/Feed constraints in 24 ms returned sat
[2023-04-07 00:46:00] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2023-04-07 00:46:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-04-07 00:46:00] [INFO ] Computed and/alt/rep : 436/1058/310 causal constraints (skipped 188 transitions) in 39 ms.
[2023-04-07 00:46:00] [INFO ] Added : 82 causal constraints over 17 iterations in 554 ms. Result :sat
Minimization took 68 ms.
[2023-04-07 00:46:01] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 00:46:01] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 00:46:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 00:46:01] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2023-04-07 00:46:01] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 00:46:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 00:46:01] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 00:46:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 00:46:01] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-04-07 00:46:01] [INFO ] [Nat]Added 220 Read/Feed constraints in 36 ms returned sat
[2023-04-07 00:46:01] [INFO ] Computed and/alt/rep : 436/1058/310 causal constraints (skipped 188 transitions) in 38 ms.
[2023-04-07 00:46:01] [INFO ] Added : 27 causal constraints over 6 iterations in 252 ms. Result :sat
Minimization took 53 ms.
[2023-04-07 00:46:01] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 00:46:01] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 00:46:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 00:46:01] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2023-04-07 00:46:02] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 00:46:02] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 00:46:02] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 00:46:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 00:46:02] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2023-04-07 00:46:02] [INFO ] [Nat]Added 220 Read/Feed constraints in 45 ms returned sat
[2023-04-07 00:46:02] [INFO ] Computed and/alt/rep : 436/1058/310 causal constraints (skipped 188 transitions) in 38 ms.
[2023-04-07 00:46:02] [INFO ] Added : 26 causal constraints over 6 iterations in 235 ms. Result :sat
Minimization took 54 ms.
[2023-04-07 00:46:02] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 00:46:02] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 00:46:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 00:46:02] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2023-04-07 00:46:02] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 00:46:02] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 00:46:02] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 00:46:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 00:46:02] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2023-04-07 00:46:02] [INFO ] [Nat]Added 220 Read/Feed constraints in 22 ms returned sat
[2023-04-07 00:46:03] [INFO ] Computed and/alt/rep : 436/1058/310 causal constraints (skipped 188 transitions) in 79 ms.
[2023-04-07 00:46:03] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-04-07 00:46:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-04-07 00:46:03] [INFO ] Added : 79 causal constraints over 17 iterations in 670 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 60 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 61 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-07 00:46:04] [INFO ] Computed 22 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1702 ms. (steps per millisecond=587 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 426 ms. (steps per millisecond=2347 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 401 ms. (steps per millisecond=2493 ) properties (out of 2) seen :0
[2023-04-07 00:46:06] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
// Phase 1: matrix 505 rows 309 cols
[2023-04-07 00:46:06] [INFO ] Computed 22 invariants in 10 ms
[2023-04-07 00:46:06] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 00:46:06] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 00:46:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 00:46:06] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2023-04-07 00:46:06] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 00:46:06] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-04-07 00:46:06] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 00:46:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 00:46:06] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2023-04-07 00:46:06] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:46:07] [INFO ] [Nat]Added 220 Read/Feed constraints in 26 ms returned sat
[2023-04-07 00:46:07] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2023-04-07 00:46:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-04-07 00:46:07] [INFO ] Computed and/alt/rep : 436/1058/310 causal constraints (skipped 188 transitions) in 32 ms.
[2023-04-07 00:46:07] [INFO ] Added : 82 causal constraints over 17 iterations in 537 ms. Result :sat
Minimization took 65 ms.
[2023-04-07 00:46:07] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-04-07 00:46:07] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 00:46:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 00:46:07] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2023-04-07 00:46:07] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 00:46:07] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 00:46:07] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 00:46:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 00:46:08] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2023-04-07 00:46:08] [INFO ] [Nat]Added 220 Read/Feed constraints in 21 ms returned sat
[2023-04-07 00:46:08] [INFO ] Computed and/alt/rep : 436/1058/310 causal constraints (skipped 188 transitions) in 36 ms.
[2023-04-07 00:46:08] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2023-04-07 00:46:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-04-07 00:46:08] [INFO ] Added : 79 causal constraints over 17 iterations in 632 ms. Result :sat
Minimization took 70 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 48 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 48 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 46 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
[2023-04-07 00:46:09] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 00:46:09] [INFO ] Invariant cache hit.
[2023-04-07 00:46:09] [INFO ] Implicit Places using invariants in 465 ms returned []
[2023-04-07 00:46:09] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 00:46:09] [INFO ] Invariant cache hit.
[2023-04-07 00:46:09] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:46:10] [INFO ] Implicit Places using invariants and state equation in 969 ms returned []
Implicit Place search using SMT with State Equation took 1436 ms to find 0 implicit places.
[2023-04-07 00:46:10] [INFO ] Redundant transitions in 96 ms returned []
[2023-04-07 00:46:10] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 00:46:10] [INFO ] Invariant cache hit.
[2023-04-07 00:46:11] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2008 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-07 00:46:11] [INFO ] Computed 22 invariants in 3 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 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-04-07 00:46:11] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
// Phase 1: matrix 505 rows 309 cols
[2023-04-07 00:46:11] [INFO ] Computed 22 invariants in 3 ms
[2023-04-07 00:46:11] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 00:46:11] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 00:46:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 00:46:11] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2023-04-07 00:46:11] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 00:46:11] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 00:46:11] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 00:46:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 00:46:11] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2023-04-07 00:46:11] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:46:11] [INFO ] [Nat]Added 220 Read/Feed constraints in 26 ms returned sat
[2023-04-07 00:46:11] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2023-04-07 00:46:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-04-07 00:46:11] [INFO ] Computed and/alt/rep : 436/1058/310 causal constraints (skipped 188 transitions) in 35 ms.
[2023-04-07 00:46:12] [INFO ] Added : 82 causal constraints over 17 iterations in 530 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 35 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 35 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-07 00:46:12] [INFO ] Computed 22 invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1514 ms. (steps per millisecond=660 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 401 ms. (steps per millisecond=2493 ) properties (out of 1) seen :0
[2023-04-07 00:46:14] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-07 00:46:14] [INFO ] Computed 22 invariants in 6 ms
[2023-04-07 00:46:14] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 00:46:14] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 00:46:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 00:46:14] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2023-04-07 00:46:14] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 00:46:14] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 00:46:14] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 00:46:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 00:46:14] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2023-04-07 00:46:14] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:46:14] [INFO ] [Nat]Added 220 Read/Feed constraints in 26 ms returned sat
[2023-04-07 00:46:14] [INFO ] Computed and/alt/rep : 435/1057/309 causal constraints (skipped 188 transitions) in 39 ms.
[2023-04-07 00:46:15] [INFO ] Added : 85 causal constraints over 17 iterations in 570 ms. Result :sat
Minimization took 71 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 34 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 34 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 33 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-07 00:46:15] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:46:15] [INFO ] Invariant cache hit.
[2023-04-07 00:46:15] [INFO ] Implicit Places using invariants in 265 ms returned []
[2023-04-07 00:46:15] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:46:15] [INFO ] Invariant cache hit.
[2023-04-07 00:46:15] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:46:16] [INFO ] Implicit Places using invariants and state equation in 1139 ms returned []
Implicit Place search using SMT with State Equation took 1411 ms to find 0 implicit places.
[2023-04-07 00:46:16] [INFO ] Redundant transitions in 80 ms returned []
[2023-04-07 00:46:16] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:46:16] [INFO ] Invariant cache hit.
[2023-04-07 00:46:17] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1979 ms. Remains : 308/308 places, 1463/1463 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-07-UpperBounds-03 in 6244 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-07 00:46:17] [INFO ] Computed 22 invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) 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-07 00:46:17] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
// Phase 1: matrix 505 rows 309 cols
[2023-04-07 00:46:17] [INFO ] Computed 22 invariants in 4 ms
[2023-04-07 00:46:17] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 00:46:17] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 00:46:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 00:46:17] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2023-04-07 00:46:17] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 00:46:17] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 00:46:17] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 00:46:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 00:46:17] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2023-04-07 00:46:17] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:46:17] [INFO ] [Nat]Added 220 Read/Feed constraints in 30 ms returned sat
[2023-04-07 00:46:17] [INFO ] Computed and/alt/rep : 436/1058/310 causal constraints (skipped 188 transitions) in 36 ms.
[2023-04-07 00:46:18] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-04-07 00:46:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-04-07 00:46:18] [INFO ] Added : 79 causal constraints over 17 iterations in 628 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 30 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-07 00:46:18] [INFO ] Computed 22 invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1507 ms. (steps per millisecond=663 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 399 ms. (steps per millisecond=2506 ) properties (out of 1) seen :0
[2023-04-07 00:46:20] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
// Phase 1: matrix 505 rows 309 cols
[2023-04-07 00:46:20] [INFO ] Computed 22 invariants in 5 ms
[2023-04-07 00:46:20] [INFO ] [Real]Absence check using 15 positive place invariants in 15 ms returned sat
[2023-04-07 00:46:20] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 00:46:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 00:46:20] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2023-04-07 00:46:20] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 00:46:20] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 00:46:20] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 00:46:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 00:46:20] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2023-04-07 00:46:20] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:46:20] [INFO ] [Nat]Added 220 Read/Feed constraints in 25 ms returned sat
[2023-04-07 00:46:20] [INFO ] Computed and/alt/rep : 436/1058/310 causal constraints (skipped 188 transitions) in 42 ms.
[2023-04-07 00:46:21] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-04-07 00:46:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-04-07 00:46:21] [INFO ] Added : 79 causal constraints over 17 iterations in 647 ms. Result :sat
Minimization took 66 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 29 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
[2023-04-07 00:46:21] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 00:46:21] [INFO ] Invariant cache hit.
[2023-04-07 00:46:21] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-04-07 00:46:22] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 00:46:22] [INFO ] Invariant cache hit.
[2023-04-07 00:46:22] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:46:22] [INFO ] Implicit Places using invariants and state equation in 994 ms returned []
Implicit Place search using SMT with State Equation took 1264 ms to find 0 implicit places.
[2023-04-07 00:46:23] [INFO ] Redundant transitions in 31 ms returned []
[2023-04-07 00:46:23] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 00:46:23] [INFO ] Invariant cache hit.
[2023-04-07 00:46:23] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1820 ms. Remains : 309/309 places, 1464/1464 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-07-UpperBounds-07 in 6232 ms.
[2023-04-07 00:46:23] [INFO ] Flatten gal took : 121 ms
[2023-04-07 00:46:23] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-04-07 00:46:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 309 places, 1464 transitions and 7632 arcs took 8 ms.
Total runtime 56450 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: EisenbergMcGuire_PT_07
(NrP: 309 NrTr: 1464 NrArc: 7632)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.052sec

net check time: 0m 0.000sec

init dd package: 0m 2.710sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9352656 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16107124 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.005sec

83893 139188 213604 334953 395753 490536 553518 580351 810088 923690 968049 1228324 1259796 1271442 1254838 1400360 1420798 1538155 1545856 1859789 1903738 1868700 1947241 1969018 1961182 1951572 1937155

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="marciexred"
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 marciexred"
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 r522-tall-167987247100253"
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 ;