Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 158K Jun 2 16:33 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 MedleyA-PT-18-UpperBounds-00
FORMULA_NAME MedleyA-PT-18-UpperBounds-01
FORMULA_NAME MedleyA-PT-18-UpperBounds-02
FORMULA_NAME MedleyA-PT-18-UpperBounds-03
FORMULA_NAME MedleyA-PT-18-UpperBounds-04
FORMULA_NAME MedleyA-PT-18-UpperBounds-05
FORMULA_NAME MedleyA-PT-18-UpperBounds-06
FORMULA_NAME MedleyA-PT-18-UpperBounds-07
FORMULA_NAME MedleyA-PT-18-UpperBounds-08
FORMULA_NAME MedleyA-PT-18-UpperBounds-09
FORMULA_NAME MedleyA-PT-18-UpperBounds-10
FORMULA_NAME MedleyA-PT-18-UpperBounds-11
FORMULA_NAME MedleyA-PT-18-UpperBounds-12
FORMULA_NAME MedleyA-PT-18-UpperBounds-13
FORMULA_NAME MedleyA-PT-18-UpperBounds-14
FORMULA_NAME MedleyA-PT-18-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717363279637

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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-18
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-02 21:21:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 21:21:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:21:22] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2024-06-02 21:21:22] [INFO ] Transformed 252 places.
[2024-06-02 21:21:22] [INFO ] Transformed 543 transitions.
[2024-06-02 21:21:22] [INFO ] Found NUPN structural information;
[2024-06-02 21:21:22] [INFO ] Parsed PT model containing 252 places and 543 transitions and 2436 arcs in 272 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
// Phase 1: matrix 541 rows 252 cols
[2024-06-02 21:21:23] [INFO ] Computed 7 invariants in 31 ms
Incomplete random walk after 10000 steps, including 383 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 16) seen :3
FORMULA MedleyA-PT-18-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-18-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-18-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 89 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 89 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
[2024-06-02 21:21:23] [INFO ] Invariant cache hit.
[2024-06-02 21:21:23] [INFO ] [Real]Absence check using 7 positive place invariants in 15 ms returned sat
[2024-06-02 21:21:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:21:24] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2024-06-02 21:21:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:21:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:21:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:21:24] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2024-06-02 21:21:24] [INFO ] Deduced a trap composed of 40 places in 294 ms of which 5 ms to minimize.
[2024-06-02 21:21:25] [INFO ] Deduced a trap composed of 28 places in 247 ms of which 1 ms to minimize.
[2024-06-02 21:21:25] [INFO ] Deduced a trap composed of 16 places in 237 ms of which 2 ms to minimize.
[2024-06-02 21:21:25] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 2 ms to minimize.
[2024-06-02 21:21:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1172 ms
[2024-06-02 21:21:25] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 86 ms.
[2024-06-02 21:21:28] [INFO ] Added : 236 causal constraints over 48 iterations in 2341 ms. Result :sat
Minimization took 245 ms.
[2024-06-02 21:21:28] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:21:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:21:28] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2024-06-02 21:21:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:21:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 21:21:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:21:28] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2024-06-02 21:21:29] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 1 ms to minimize.
[2024-06-02 21:21:29] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2024-06-02 21:21:29] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 1 ms to minimize.
[2024-06-02 21:21:29] [INFO ] Deduced a trap composed of 29 places in 226 ms of which 1 ms to minimize.
[2024-06-02 21:21:29] [INFO ] Deduced a trap composed of 28 places in 190 ms of which 0 ms to minimize.
[2024-06-02 21:21:30] [INFO ] Deduced a trap composed of 29 places in 172 ms of which 0 ms to minimize.
[2024-06-02 21:21:30] [INFO ] Deduced a trap composed of 37 places in 205 ms of which 1 ms to minimize.
[2024-06-02 21:21:30] [INFO ] Deduced a trap composed of 28 places in 214 ms of which 1 ms to minimize.
[2024-06-02 21:21:30] [INFO ] Deduced a trap composed of 28 places in 189 ms of which 1 ms to minimize.
[2024-06-02 21:21:30] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1863 ms
[2024-06-02 21:21:30] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 72 ms.
[2024-06-02 21:21:32] [INFO ] Added : 206 causal constraints over 42 iterations in 1904 ms. Result :sat
Minimization took 248 ms.
[2024-06-02 21:21:33] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 21:21:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:21:33] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2024-06-02 21:21:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:21:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:21:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:21:33] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2024-06-02 21:21:33] [INFO ] Deduced a trap composed of 28 places in 210 ms of which 1 ms to minimize.
[2024-06-02 21:21:33] [INFO ] Deduced a trap composed of 36 places in 181 ms of which 1 ms to minimize.
[2024-06-02 21:21:34] [INFO ] Deduced a trap composed of 28 places in 174 ms of which 1 ms to minimize.
[2024-06-02 21:21:34] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 1 ms to minimize.
[2024-06-02 21:21:34] [INFO ] Deduced a trap composed of 16 places in 176 ms of which 1 ms to minimize.
[2024-06-02 21:21:34] [INFO ] Deduced a trap composed of 46 places in 189 ms of which 2 ms to minimize.
[2024-06-02 21:21:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1307 ms
[2024-06-02 21:21:34] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 53 ms.
[2024-06-02 21:21:37] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 2 ms to minimize.
[2024-06-02 21:21:37] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2024-06-02 21:21:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 309 ms
[2024-06-02 21:21:37] [INFO ] Added : 251 causal constraints over 51 iterations in 2600 ms. Result :sat
Minimization took 321 ms.
[2024-06-02 21:21:37] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:21:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:21:38] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2024-06-02 21:21:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:21:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:21:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:21:38] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2024-06-02 21:21:38] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 1 ms to minimize.
[2024-06-02 21:21:38] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 1 ms to minimize.
[2024-06-02 21:21:38] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 1 ms to minimize.
[2024-06-02 21:21:38] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 0 ms to minimize.
[2024-06-02 21:21:39] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2024-06-02 21:21:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 738 ms
[2024-06-02 21:21:39] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 43 ms.
[2024-06-02 21:21:42] [INFO ] Deduced a trap composed of 47 places in 199 ms of which 1 ms to minimize.
[2024-06-02 21:21:42] [INFO ] Deduced a trap composed of 50 places in 193 ms of which 1 ms to minimize.
[2024-06-02 21:21:43] [INFO ] Deduced a trap composed of 148 places in 193 ms of which 1 ms to minimize.
[2024-06-02 21:21:43] [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 3
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)
[2024-06-02 21:21:43] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 21:21:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:21:43] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2024-06-02 21:21:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:21:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:21:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:21:43] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2024-06-02 21:21:43] [INFO ] Deduced a trap composed of 30 places in 177 ms of which 0 ms to minimize.
[2024-06-02 21:21:44] [INFO ] Deduced a trap composed of 28 places in 172 ms of which 1 ms to minimize.
[2024-06-02 21:21:44] [INFO ] Deduced a trap composed of 39 places in 232 ms of which 0 ms to minimize.
[2024-06-02 21:21:44] [INFO ] Deduced a trap composed of 30 places in 188 ms of which 1 ms to minimize.
[2024-06-02 21:21:44] [INFO ] Deduced a trap composed of 29 places in 169 ms of which 1 ms to minimize.
[2024-06-02 21:21:44] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 2 ms to minimize.
[2024-06-02 21:21:45] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 1 ms to minimize.
[2024-06-02 21:21:45] [INFO ] Deduced a trap composed of 45 places in 187 ms of which 2 ms to minimize.
[2024-06-02 21:21:45] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1676 ms
[2024-06-02 21:21:45] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 39 ms.
[2024-06-02 21:21:48] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 0 ms to minimize.
[2024-06-02 21:21:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2024-06-02 21:21:48] [INFO ] Deduced a trap composed of 31 places in 221 ms of which 1 ms to minimize.
[2024-06-02 21:21:48] [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)
[2024-06-02 21:21:48] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned sat
[2024-06-02 21:21:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:21:48] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2024-06-02 21:21:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:21:49] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:21:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:21:49] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2024-06-02 21:21:49] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 1 ms to minimize.
[2024-06-02 21:21:49] [INFO ] Deduced a trap composed of 34 places in 179 ms of which 0 ms to minimize.
[2024-06-02 21:21:49] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 1 ms to minimize.
[2024-06-02 21:21:49] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 0 ms to minimize.
[2024-06-02 21:21:50] [INFO ] Deduced a trap composed of 20 places in 194 ms of which 1 ms to minimize.
[2024-06-02 21:21:50] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 1 ms to minimize.
[2024-06-02 21:21:50] [INFO ] Deduced a trap composed of 47 places in 207 ms of which 3 ms to minimize.
[2024-06-02 21:21:50] [INFO ] Deduced a trap composed of 28 places in 180 ms of which 1 ms to minimize.
[2024-06-02 21:21:51] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 0 ms to minimize.
[2024-06-02 21:21:51] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1854 ms
[2024-06-02 21:21:51] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 42 ms.
[2024-06-02 21:21:52] [INFO ] Added : 188 causal constraints over 38 iterations in 1648 ms. Result :sat
Minimization took 187 ms.
[2024-06-02 21:21:53] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 21:21:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:21:53] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2024-06-02 21:21:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:21:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:21:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:21:53] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2024-06-02 21:21:53] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 1 ms to minimize.
[2024-06-02 21:21:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2024-06-02 21:21:53] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 39 ms.
[2024-06-02 21:21:55] [INFO ] Deduced a trap composed of 38 places in 178 ms of which 1 ms to minimize.
[2024-06-02 21:21:55] [INFO ] Deduced a trap composed of 21 places in 175 ms of which 1 ms to minimize.
[2024-06-02 21:21:55] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 1 ms to minimize.
[2024-06-02 21:21:56] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 1 ms to minimize.
[2024-06-02 21:21:57] [INFO ] Deduced a trap composed of 122 places in 190 ms of which 1 ms to minimize.
[2024-06-02 21:21:58] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 2907 ms
[2024-06-02 21:21:58] [INFO ] Deduced a trap composed of 31 places in 238 ms of which 1 ms to minimize.
[2024-06-02 21:21:58] [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 6
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)
[2024-06-02 21:21:58] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:21:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:21:58] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2024-06-02 21:21:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:21:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 15 ms returned sat
[2024-06-02 21:21:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:21:59] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2024-06-02 21:21:59] [INFO ] Deduced a trap composed of 27 places in 232 ms of which 0 ms to minimize.
[2024-06-02 21:21:59] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 14 ms to minimize.
[2024-06-02 21:21:59] [INFO ] Deduced a trap composed of 142 places in 194 ms of which 1 ms to minimize.
[2024-06-02 21:21:59] [INFO ] Deduced a trap composed of 153 places in 188 ms of which 1 ms to minimize.
[2024-06-02 21:22:00] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-06-02 21:22:00] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2024-06-02 21:22:00] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 1 ms to minimize.
[2024-06-02 21:22:00] [INFO ] Deduced a trap composed of 28 places in 177 ms of which 0 ms to minimize.
[2024-06-02 21:22:00] [INFO ] Deduced a trap composed of 30 places in 175 ms of which 0 ms to minimize.
[2024-06-02 21:22:00] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1686 ms
[2024-06-02 21:22:00] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 48 ms.
[2024-06-02 21:22:02] [INFO ] Added : 200 causal constraints over 41 iterations in 1656 ms. Result :sat
Minimization took 207 ms.
[2024-06-02 21:22:02] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 21:22:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:22:02] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2024-06-02 21:22:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:22:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 21:22:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:22:03] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2024-06-02 21:22:03] [INFO ] Deduced a trap composed of 33 places in 177 ms of which 0 ms to minimize.
[2024-06-02 21:22:03] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 1 ms to minimize.
[2024-06-02 21:22:03] [INFO ] Deduced a trap composed of 37 places in 191 ms of which 2 ms to minimize.
[2024-06-02 21:22:03] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 0 ms to minimize.
[2024-06-02 21:22:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 773 ms
[2024-06-02 21:22:03] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 42 ms.
[2024-06-02 21:22:05] [INFO ] Added : 224 causal constraints over 45 iterations in 1959 ms. Result :sat
Minimization took 202 ms.
[2024-06-02 21:22:06] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 21:22:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:22:06] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2024-06-02 21:22:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:22:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:22:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:22:06] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2024-06-02 21:22:06] [INFO ] Deduced a trap composed of 29 places in 173 ms of which 0 ms to minimize.
[2024-06-02 21:22:07] [INFO ] Deduced a trap composed of 30 places in 185 ms of which 1 ms to minimize.
[2024-06-02 21:22:07] [INFO ] Deduced a trap composed of 28 places in 179 ms of which 0 ms to minimize.
[2024-06-02 21:22:07] [INFO ] Deduced a trap composed of 29 places in 172 ms of which 1 ms to minimize.
[2024-06-02 21:22:07] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-06-02 21:22:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 948 ms
[2024-06-02 21:22:07] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 42 ms.
[2024-06-02 21:22:09] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 0 ms to minimize.
[2024-06-02 21:22:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2024-06-02 21:22:09] [INFO ] Added : 207 causal constraints over 43 iterations in 1840 ms. Result :sat
Minimization took 165 ms.
[2024-06-02 21:22:09] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:22:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:22:09] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2024-06-02 21:22:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:22:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 21:22:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:22:10] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2024-06-02 21:22:10] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 0 ms to minimize.
[2024-06-02 21:22:10] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 0 ms to minimize.
[2024-06-02 21:22:10] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 1 ms to minimize.
[2024-06-02 21:22:10] [INFO ] Deduced a trap composed of 46 places in 168 ms of which 1 ms to minimize.
[2024-06-02 21:22:11] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 1 ms to minimize.
[2024-06-02 21:22:11] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-06-02 21:22:11] [INFO ] Deduced a trap composed of 38 places in 197 ms of which 1 ms to minimize.
[2024-06-02 21:22:11] [INFO ] Deduced a trap composed of 28 places in 187 ms of which 0 ms to minimize.
[2024-06-02 21:22:11] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1461 ms
[2024-06-02 21:22:11] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 50 ms.
[2024-06-02 21:22:13] [INFO ] Added : 222 causal constraints over 45 iterations in 2265 ms. Result :sat
Minimization took 241 ms.
[2024-06-02 21:22:14] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 21:22:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:22:14] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2024-06-02 21:22:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:22:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:22:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:22:14] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2024-06-02 21:22:14] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 1 ms to minimize.
[2024-06-02 21:22:15] [INFO ] Deduced a trap composed of 29 places in 199 ms of which 1 ms to minimize.
[2024-06-02 21:22:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 457 ms
[2024-06-02 21:22:15] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 39 ms.
[2024-06-02 21:22:17] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 1 ms to minimize.
[2024-06-02 21:22:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2024-06-02 21:22:17] [INFO ] Added : 242 causal constraints over 49 iterations in 2377 ms. Result :sat
Minimization took 1540 ms.
[2024-06-02 21:22:19] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:22:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:22:19] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2024-06-02 21:22:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:22:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:22:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:22:19] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2024-06-02 21:22:19] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 0 ms to minimize.
[2024-06-02 21:22:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2024-06-02 21:22:20] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 44 ms.
[2024-06-02 21:22:21] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 0 ms to minimize.
[2024-06-02 21:22:21] [INFO ] Deduced a trap composed of 26 places in 188 ms of which 1 ms to minimize.
[2024-06-02 21:22:22] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 1 ms to minimize.
[2024-06-02 21:22:22] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 0 ms to minimize.
[2024-06-02 21:22:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1675 ms
[2024-06-02 21:22:23] [INFO ] Added : 182 causal constraints over 38 iterations in 3195 ms. Result :sat
Minimization took 1258 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 13 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 541/541 transitions.
Graph (trivial) has 268 edges and 252 vertex of which 13 / 252 are part of one of the 3 SCC in 7 ms
Free SCC test removed 10 places
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 242 transition count 479
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 101 place count 193 transition count 477
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 105 place count 192 transition count 474
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 110 place count 189 transition count 472
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 111 place count 188 transition count 472
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 111 place count 188 transition count 464
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 127 place count 180 transition count 464
Discarding 37 places :
Symmetric choice reduction at 5 with 37 rule applications. Total rules 164 place count 143 transition count 399
Iterating global reduction 5 with 37 rules applied. Total rules applied 201 place count 143 transition count 399
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 203 place count 143 transition count 397
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 205 place count 141 transition count 397
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 6 Pre rules applied. Total rules applied 205 place count 141 transition count 391
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 217 place count 135 transition count 391
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 220 place count 132 transition count 371
Iterating global reduction 7 with 3 rules applied. Total rules applied 223 place count 132 transition count 371
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 225 place count 130 transition count 367
Iterating global reduction 7 with 2 rules applied. Total rules applied 227 place count 130 transition count 367
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 269 place count 109 transition count 346
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 274 place count 109 transition count 341
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 276 place count 107 transition count 337
Iterating global reduction 8 with 2 rules applied. Total rules applied 278 place count 107 transition count 337
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 280 place count 105 transition count 329
Iterating global reduction 8 with 2 rules applied. Total rules applied 282 place count 105 transition count 329
Performed 18 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 8 with 36 rules applied. Total rules applied 318 place count 87 transition count 424
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 331 place count 87 transition count 411
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 336 place count 87 transition count 406
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 344 place count 83 transition count 402
Free-agglomeration rule applied 19 times.
Iterating global reduction 9 with 19 rules applied. Total rules applied 363 place count 83 transition count 383
Reduce places removed 19 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 34 rules applied. Total rules applied 397 place count 64 transition count 368
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 10 with 17 rules applied. Total rules applied 414 place count 64 transition count 351
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 415 place count 64 transition count 351
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 416 place count 63 transition count 350
Applied a total of 416 rules in 275 ms. Remains 63 /252 variables (removed 189) and now considering 350/541 (removed 191) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 63/252 places, 350/541 transitions.
Normalized transition count is 313 out of 350 initially.
// Phase 1: matrix 313 rows 63 cols
[2024-06-02 21:22:27] [INFO ] Computed 7 invariants in 5 ms
Incomplete random walk after 1000000 steps, including 99459 resets, run finished after 3033 ms. (steps per millisecond=329 ) properties (out of 13) seen :13
FORMULA MedleyA-PT-18-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-18-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-18-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-18-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-18-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-18-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-18-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-18-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-18-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-18-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-18-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-18-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-18-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 67396 ms.

BK_STOP 1717363351208

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-18"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is MedleyA-PT-18, 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 r597-smll-171734926500086"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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