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.r235-tall-167856421200061.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 smartxred
Input is HypertorusGrid-PT-d4k3p2b08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-tall-167856421200061
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.2M
-rw-r--r-- 1 mcc users 8.9K Feb 26 11:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 11:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 11:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 11:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 12:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 26 12:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 12:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 12:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rwxr-xr-x 1 mcc users 2.8M Mar 5 18:22 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 HypertorusGrid-PT-d4k3p2b08-UpperBounds-00
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-UpperBounds-01
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-UpperBounds-02
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-UpperBounds-03
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-UpperBounds-04
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-UpperBounds-05
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-UpperBounds-06
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-UpperBounds-07
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-UpperBounds-08
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-UpperBounds-09
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-UpperBounds-10
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-UpperBounds-11
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-UpperBounds-12
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-UpperBounds-13
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-UpperBounds-14
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678629633972

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HypertorusGrid-PT-d4k3p2b08
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-12 14:00:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 14:00:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 14:00:35] [INFO ] Load time of PNML (sax parser for PT used): 217 ms
[2023-03-12 14:00:35] [INFO ] Transformed 2025 places.
[2023-03-12 14:00:35] [INFO ] Transformed 5184 transitions.
[2023-03-12 14:00:35] [INFO ] Parsed PT model containing 2025 places and 5184 transitions and 20736 arcs in 391 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 5184 rows 2025 cols
[2023-03-12 14:00:36] [INFO ] Computed 730 place invariants in 164 ms
FORMULA HypertorusGrid-PT-d4k3p2b08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypertorusGrid-PT-d4k3p2b08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypertorusGrid-PT-d4k3p2b08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1850 ms. (steps per millisecond=5 ) properties (out of 13) seen :56
FORMULA HypertorusGrid-PT-d4k3p2b08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HypertorusGrid-PT-d4k3p2b08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 11) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 11) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 11) seen :34
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 11) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 11) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 11) seen :29
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 11) seen :29
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 11) seen :29
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 11) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 11) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 11) seen :28
[2023-03-12 14:00:40] [INFO ] Invariant cache hit.
[2023-03-12 14:00:40] [INFO ] [Real]Absence check using 729 positive place invariants in 144 ms returned sat
[2023-03-12 14:00:40] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 57 ms returned sat
[2023-03-12 14:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:00:42] [INFO ] [Real]Absence check using state equation in 1461 ms returned sat
[2023-03-12 14:00:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:00:42] [INFO ] [Nat]Absence check using 729 positive place invariants in 144 ms returned sat
[2023-03-12 14:00:42] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 64 ms returned sat
[2023-03-12 14:00:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:00:44] [INFO ] [Nat]Absence check using state equation in 1459 ms returned sat
[2023-03-12 14:00:44] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 289 ms.
[2023-03-12 14:00:49] [INFO ] Deduced a trap composed of 2 places in 2095 ms of which 8 ms to minimize.
[2023-03-12 14:00:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 14:00:49] [INFO ] [Real]Absence check using 729 positive place invariants in 142 ms returned sat
[2023-03-12 14:00:49] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 52 ms returned sat
[2023-03-12 14:00:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:00:51] [INFO ] [Real]Absence check using state equation in 1447 ms returned sat
[2023-03-12 14:00:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:00:51] [INFO ] [Nat]Absence check using 729 positive place invariants in 137 ms returned sat
[2023-03-12 14:00:51] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 49 ms returned sat
[2023-03-12 14:00:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:00:53] [INFO ] [Nat]Absence check using state equation in 1402 ms returned sat
[2023-03-12 14:00:53] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 223 ms.
[2023-03-12 14:00:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 14:00:56] [INFO ] [Real]Absence check using 729 positive place invariants in 132 ms returned sat
[2023-03-12 14:00:56] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 49 ms returned sat
[2023-03-12 14:00:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:00:58] [INFO ] [Real]Absence check using state equation in 1398 ms returned sat
[2023-03-12 14:00:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:00:58] [INFO ] [Nat]Absence check using 729 positive place invariants in 139 ms returned sat
[2023-03-12 14:00:58] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 49 ms returned sat
[2023-03-12 14:00:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:01:00] [INFO ] [Nat]Absence check using state equation in 1374 ms returned sat
[2023-03-12 14:01:00] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 233 ms.
[2023-03-12 14:01:05] [INFO ] Deduced a trap composed of 2 places in 2071 ms of which 4 ms to minimize.
[2023-03-12 14:01:05] [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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 14:01:05] [INFO ] [Real]Absence check using 729 positive place invariants in 138 ms returned sat
[2023-03-12 14:01:05] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 53 ms returned sat
[2023-03-12 14:01:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:01:07] [INFO ] [Real]Absence check using state equation in 1467 ms returned sat
[2023-03-12 14:01:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:01:07] [INFO ] [Nat]Absence check using 729 positive place invariants in 130 ms returned sat
[2023-03-12 14:01:07] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 48 ms returned sat
[2023-03-12 14:01:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:01:09] [INFO ] [Nat]Absence check using state equation in 1328 ms returned sat
[2023-03-12 14:01:09] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 259 ms.
[2023-03-12 14:01:14] [INFO ] Deduced a trap composed of 2 places in 2146 ms of which 2 ms to minimize.
[2023-03-12 14:01:14] [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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 14:01:14] [INFO ] [Real]Absence check using 729 positive place invariants in 135 ms returned sat
[2023-03-12 14:01:15] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 50 ms returned sat
[2023-03-12 14:01:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:01:16] [INFO ] [Real]Absence check using state equation in 1330 ms returned sat
[2023-03-12 14:01:16] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 249 ms.
[2023-03-12 14:01:21] [INFO ] Deduced a trap composed of 2 places in 2019 ms of which 4 ms to minimize.
[2023-03-12 14:01:21] [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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 14:01:22] [INFO ] [Real]Absence check using 729 positive place invariants in 150 ms returned sat
[2023-03-12 14:01:22] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 57 ms returned sat
[2023-03-12 14:01:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:01:23] [INFO ] [Real]Absence check using state equation in 1345 ms returned sat
[2023-03-12 14:01:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:01:23] [INFO ] [Nat]Absence check using 729 positive place invariants in 137 ms returned sat
[2023-03-12 14:01:23] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 50 ms returned sat
[2023-03-12 14:01:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:01:25] [INFO ] [Nat]Absence check using state equation in 1388 ms returned sat
[2023-03-12 14:01:25] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 246 ms.
[2023-03-12 14:01:30] [INFO ] Deduced a trap composed of 2 places in 2096 ms of which 2 ms to minimize.
[2023-03-12 14:01:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 14:01:31] [INFO ] [Real]Absence check using 729 positive place invariants in 141 ms returned sat
[2023-03-12 14:01:31] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 55 ms returned sat
[2023-03-12 14:01:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:01:32] [INFO ] [Real]Absence check using state equation in 1485 ms returned sat
[2023-03-12 14:01:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:01:33] [INFO ] [Nat]Absence check using 729 positive place invariants in 142 ms returned sat
[2023-03-12 14:01:33] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 51 ms returned sat
[2023-03-12 14:01:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:01:34] [INFO ] [Nat]Absence check using state equation in 1455 ms returned sat
[2023-03-12 14:01:34] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 244 ms.
[2023-03-12 14:01:39] [INFO ] Deduced a trap composed of 2 places in 2089 ms of which 2 ms to minimize.
[2023-03-12 14:01:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 14:01:40] [INFO ] [Real]Absence check using 729 positive place invariants in 140 ms returned sat
[2023-03-12 14:01:40] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 51 ms returned sat
[2023-03-12 14:01:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:01:41] [INFO ] [Real]Absence check using state equation in 1456 ms returned sat
[2023-03-12 14:01:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:01:42] [INFO ] [Nat]Absence check using 729 positive place invariants in 139 ms returned sat
[2023-03-12 14:01:42] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 51 ms returned sat
[2023-03-12 14:01:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:01:43] [INFO ] [Nat]Absence check using state equation in 1428 ms returned sat
[2023-03-12 14:01:43] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 254 ms.
[2023-03-12 14:01:48] [INFO ] Deduced a trap composed of 2 places in 2032 ms of which 2 ms to minimize.
[2023-03-12 14:01: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 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 14:01:49] [INFO ] [Real]Absence check using 729 positive place invariants in 133 ms returned sat
[2023-03-12 14:01:49] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 51 ms returned sat
[2023-03-12 14:01:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:01:50] [INFO ] [Real]Absence check using state equation in 1457 ms returned sat
[2023-03-12 14:01:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:01:51] [INFO ] [Nat]Absence check using 729 positive place invariants in 139 ms returned sat
[2023-03-12 14:01:51] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 55 ms returned sat
[2023-03-12 14:01:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:01:52] [INFO ] [Nat]Absence check using state equation in 1400 ms returned sat
[2023-03-12 14:01:52] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 232 ms.
[2023-03-12 14:01:57] [INFO ] Deduced a trap composed of 2 places in 2044 ms of which 2 ms to minimize.
[2023-03-12 14:01:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 14:01:58] [INFO ] [Real]Absence check using 729 positive place invariants in 122 ms returned sat
[2023-03-12 14:01:58] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 49 ms returned sat
[2023-03-12 14:01:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:01:59] [INFO ] [Real]Absence check using state equation in 1355 ms returned sat
[2023-03-12 14:01:59] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 236 ms.
[2023-03-12 14:02:04] [INFO ] Deduced a trap composed of 2 places in 1975 ms of which 2 ms to minimize.
[2023-03-12 14:02:04] [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 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 14:02:05] [INFO ] [Real]Absence check using 729 positive place invariants in 135 ms returned sat
[2023-03-12 14:02:05] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 51 ms returned sat
[2023-03-12 14:02:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:02:06] [INFO ] [Real]Absence check using state equation in 1373 ms returned sat
[2023-03-12 14:02:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:02:07] [INFO ] [Nat]Absence check using 729 positive place invariants in 140 ms returned sat
[2023-03-12 14:02:07] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 52 ms returned sat
[2023-03-12 14:02:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:02:08] [INFO ] [Nat]Absence check using state equation in 1441 ms returned sat
[2023-03-12 14:02:08] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 234 ms.
[2023-03-12 14:02:11] [INFO ] Added : 80 causal constraints over 16 iterations in 3050 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24] Max seen :[4, 6, 17, 4, 2, 5, 3, 3, 2, 5, 3]
FORMULA HypertorusGrid-PT-d4k3p2b08-UpperBounds-14 24 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HypertorusGrid-PT-d4k3p2b08-UpperBounds-06 24 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HypertorusGrid-PT-d4k3p2b08-UpperBounds-05 24 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 8 out of 2025 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2025/2025 places, 5184/5184 transitions.
Applied a total of 0 rules in 333 ms. Remains 2025 /2025 variables (removed 0) and now considering 5184/5184 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 334 ms. Remains : 2025/2025 places, 5184/5184 transitions.
[2023-03-12 14:02:42] [INFO ] Invariant cache hit.
Finished random walk after 217106 steps, including 1 resets, run visited all 8 properties in 30001 ms. (steps per millisecond=7 )
FORMULA HypertorusGrid-PT-d4k3p2b08-UpperBounds-04 24 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 291473 steps, including 0 resets, run visited all 7 properties in 5012 ms. (steps per millisecond=58 )
Finished Best-First random walk after 295641 steps, including 0 resets, run visited all 7 properties in 5001 ms. (steps per millisecond=59 )
Finished Best-First random walk after 295047 steps, including 0 resets, run visited all 7 properties in 5007 ms. (steps per millisecond=58 )
Finished Best-First random walk after 298573 steps, including 0 resets, run visited all 7 properties in 5010 ms. (steps per millisecond=59 )
Finished Best-First random walk after 284505 steps, including 0 resets, run visited all 7 properties in 5004 ms. (steps per millisecond=56 )
Finished Best-First random walk after 302365 steps, including 0 resets, run visited all 7 properties in 5014 ms. (steps per millisecond=60 )
Finished Best-First random walk after 303536 steps, including 0 resets, run visited all 7 properties in 5001 ms. (steps per millisecond=60 )
[2023-03-12 14:03:47] [INFO ] Invariant cache hit.
[2023-03-12 14:03:47] [INFO ] [Real]Absence check using 729 positive place invariants in 130 ms returned sat
[2023-03-12 14:03:47] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 55 ms returned sat
[2023-03-12 14:03:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:03:48] [INFO ] [Real]Absence check using state equation in 1356 ms returned sat
[2023-03-12 14:03:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:03:49] [INFO ] [Nat]Absence check using 729 positive place invariants in 139 ms returned sat
[2023-03-12 14:03:49] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 51 ms returned sat
[2023-03-12 14:03:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:03:50] [INFO ] [Nat]Absence check using state equation in 1452 ms returned sat
[2023-03-12 14:03:51] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 229 ms.
[2023-03-12 14:04:11] [INFO ] Added : 535 causal constraints over 107 iterations in 20134 ms.(timeout) Result :sat
[2023-03-12 14:04:11] [INFO ] [Real]Absence check using 729 positive place invariants in 137 ms returned sat
[2023-03-12 14:04:11] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 54 ms returned sat
[2023-03-12 14:04:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:04:13] [INFO ] [Real]Absence check using state equation in 1458 ms returned sat
[2023-03-12 14:04:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:04:13] [INFO ] [Nat]Absence check using 729 positive place invariants in 137 ms returned sat
[2023-03-12 14:04:13] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 52 ms returned sat
[2023-03-12 14:04:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:04:15] [INFO ] [Nat]Absence check using state equation in 1440 ms returned sat
[2023-03-12 14:04:15] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 234 ms.
[2023-03-12 14:04:35] [INFO ] Added : 535 causal constraints over 107 iterations in 20166 ms.(timeout) Result :sat
[2023-03-12 14:04:35] [INFO ] [Real]Absence check using 729 positive place invariants in 138 ms returned sat
[2023-03-12 14:04:36] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 52 ms returned sat
[2023-03-12 14:04:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:04:37] [INFO ] [Real]Absence check using state equation in 1462 ms returned sat
[2023-03-12 14:04:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:04:37] [INFO ] [Nat]Absence check using 729 positive place invariants in 138 ms returned sat
[2023-03-12 14:04:37] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 51 ms returned sat
[2023-03-12 14:04:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:04:39] [INFO ] [Nat]Absence check using state equation in 1337 ms returned sat
[2023-03-12 14:04:39] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 238 ms.
[2023-03-12 14:04:59] [INFO ] Added : 545 causal constraints over 109 iterations in 20057 ms.(timeout) Result :sat
[2023-03-12 14:05:00] [INFO ] [Real]Absence check using 729 positive place invariants in 153 ms returned sat
[2023-03-12 14:05:00] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 54 ms returned sat
[2023-03-12 14:05:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:05:01] [INFO ] [Real]Absence check using state equation in 1407 ms returned sat
[2023-03-12 14:05:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:05:01] [INFO ] [Nat]Absence check using 729 positive place invariants in 138 ms returned sat
[2023-03-12 14:05:01] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 49 ms returned sat
[2023-03-12 14:05:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:05:03] [INFO ] [Nat]Absence check using state equation in 1369 ms returned sat
[2023-03-12 14:05:03] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 239 ms.
[2023-03-12 14:05:23] [INFO ] Added : 545 causal constraints over 109 iterations in 20019 ms.(timeout) Result :sat
[2023-03-12 14:05:23] [INFO ] [Real]Absence check using 729 positive place invariants in 127 ms returned sat
[2023-03-12 14:05:23] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 54 ms returned sat
[2023-03-12 14:05:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:05:25] [INFO ] [Real]Absence check using state equation in 1365 ms returned sat
[2023-03-12 14:05:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:05:25] [INFO ] [Nat]Absence check using 729 positive place invariants in 144 ms returned sat
[2023-03-12 14:05:25] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 48 ms returned sat
[2023-03-12 14:05:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:05:27] [INFO ] [Nat]Absence check using state equation in 1310 ms returned sat
[2023-03-12 14:05:27] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 231 ms.
[2023-03-12 14:05:47] [INFO ] Added : 550 causal constraints over 110 iterations in 20157 ms.(timeout) Result :sat
[2023-03-12 14:05:47] [INFO ] [Real]Absence check using 729 positive place invariants in 126 ms returned sat
[2023-03-12 14:05:47] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 50 ms returned sat
[2023-03-12 14:05:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:05:49] [INFO ] [Real]Absence check using state equation in 1333 ms returned sat
[2023-03-12 14:05:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:05:49] [INFO ] [Nat]Absence check using 729 positive place invariants in 121 ms returned sat
[2023-03-12 14:05:49] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 49 ms returned sat
[2023-03-12 14:05:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:05:51] [INFO ] [Nat]Absence check using state equation in 1380 ms returned sat
[2023-03-12 14:05:51] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 209 ms.
[2023-03-12 14:06:11] [INFO ] Added : 565 causal constraints over 113 iterations in 20120 ms.(timeout) Result :sat
[2023-03-12 14:06:11] [INFO ] [Real]Absence check using 729 positive place invariants in 138 ms returned sat
[2023-03-12 14:06:11] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 56 ms returned sat
[2023-03-12 14:06:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:06:13] [INFO ] [Real]Absence check using state equation in 1478 ms returned sat
[2023-03-12 14:06:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:06:13] [INFO ] [Nat]Absence check using 729 positive place invariants in 125 ms returned sat
[2023-03-12 14:06:13] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 48 ms returned sat
[2023-03-12 14:06:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:06:15] [INFO ] [Nat]Absence check using state equation in 1312 ms returned sat
[2023-03-12 14:06:15] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 211 ms.
[2023-03-12 14:06:35] [INFO ] Added : 550 causal constraints over 110 iterations in 20165 ms.(timeout) Result :sat
Current structural bounds on expressions (after SMT) : [24, 24, 24, 24, 24, 24, 24] Max seen :[21, 7, 7, 8, 7, 17, 15]
FORMULA HypertorusGrid-PT-d4k3p2b08-UpperBounds-13 24 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HypertorusGrid-PT-d4k3p2b08-UpperBounds-15 24 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 2025 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2025/2025 places, 5184/5184 transitions.
Applied a total of 0 rules in 124 ms. Remains 2025 /2025 variables (removed 0) and now considering 5184/5184 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 2025/2025 places, 5184/5184 transitions.
[2023-03-12 14:10:05] [INFO ] Invariant cache hit.
Finished random walk after 216096 steps, including 1 resets, run visited all 5 properties in 30001 ms. (steps per millisecond=7 )
Finished Best-First random walk after 307279 steps, including 0 resets, run visited all 5 properties in 5014 ms. (steps per millisecond=61 )
Finished Best-First random walk after 306602 steps, including 0 resets, run visited all 5 properties in 5014 ms. (steps per millisecond=61 )
Finished Best-First random walk after 306581 steps, including 0 resets, run visited all 5 properties in 5012 ms. (steps per millisecond=61 )
Finished Best-First random walk after 304252 steps, including 0 resets, run visited all 5 properties in 5002 ms. (steps per millisecond=60 )
Finished Best-First random walk after 302839 steps, including 0 resets, run visited all 5 properties in 5004 ms. (steps per millisecond=60 )
[2023-03-12 14:11:00] [INFO ] Invariant cache hit.
[2023-03-12 14:11:01] [INFO ] [Real]Absence check using 729 positive place invariants in 141 ms returned sat
[2023-03-12 14:11:01] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 65 ms returned sat
[2023-03-12 14:11:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:11:02] [INFO ] [Real]Absence check using state equation in 1501 ms returned sat
[2023-03-12 14:11:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:11:03] [INFO ] [Nat]Absence check using 729 positive place invariants in 131 ms returned sat
[2023-03-12 14:11:03] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 48 ms returned sat
[2023-03-12 14:11:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:11:04] [INFO ] [Nat]Absence check using state equation in 1314 ms returned sat
[2023-03-12 14:11:04] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 207 ms.
[2023-03-12 14:11:25] [INFO ] Added : 570 causal constraints over 114 iterations in 20241 ms.(timeout) Result :sat
[2023-03-12 14:11:25] [INFO ] [Real]Absence check using 729 positive place invariants in 124 ms returned sat
[2023-03-12 14:11:25] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 49 ms returned sat
[2023-03-12 14:11:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:11:26] [INFO ] [Real]Absence check using state equation in 1337 ms returned sat
[2023-03-12 14:11:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:11:27] [INFO ] [Nat]Absence check using 729 positive place invariants in 127 ms returned sat
[2023-03-12 14:11:27] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 48 ms returned sat
[2023-03-12 14:11:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:11:28] [INFO ] [Nat]Absence check using state equation in 1349 ms returned sat
[2023-03-12 14:11:29] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 244 ms.
[2023-03-12 14:11:48] [INFO ] Added : 550 causal constraints over 110 iterations in 20080 ms.(timeout) Result :sat
[2023-03-12 14:11:49] [INFO ] [Real]Absence check using 729 positive place invariants in 138 ms returned sat
[2023-03-12 14:11:49] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 63 ms returned sat
[2023-03-12 14:11:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:11:50] [INFO ] [Real]Absence check using state equation in 1449 ms returned sat
[2023-03-12 14:11:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:11:51] [INFO ] [Nat]Absence check using 729 positive place invariants in 130 ms returned sat
[2023-03-12 14:11:51] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 48 ms returned sat
[2023-03-12 14:11:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:11:52] [INFO ] [Nat]Absence check using state equation in 1290 ms returned sat
[2023-03-12 14:11:53] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 219 ms.
[2023-03-12 14:12:12] [INFO ] Added : 580 causal constraints over 116 iterations in 20151 ms.(timeout) Result :sat
[2023-03-12 14:12:13] [INFO ] [Real]Absence check using 729 positive place invariants in 131 ms returned sat
[2023-03-12 14:12:13] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 49 ms returned sat
[2023-03-12 14:12:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:12:14] [INFO ] [Real]Absence check using state equation in 1357 ms returned sat
[2023-03-12 14:12:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:12:15] [INFO ] [Nat]Absence check using 729 positive place invariants in 135 ms returned sat
[2023-03-12 14:12:15] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 49 ms returned sat
[2023-03-12 14:12:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:12:16] [INFO ] [Nat]Absence check using state equation in 1426 ms returned sat
[2023-03-12 14:12:17] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 212 ms.
[2023-03-12 14:12:36] [INFO ] Added : 545 causal constraints over 109 iterations in 20046 ms.(timeout) Result :sat
[2023-03-12 14:12:37] [INFO ] [Real]Absence check using 729 positive place invariants in 136 ms returned sat
[2023-03-12 14:12:37] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 52 ms returned sat
[2023-03-12 14:12:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:12:38] [INFO ] [Real]Absence check using state equation in 1413 ms returned sat
[2023-03-12 14:12:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:12:39] [INFO ] [Nat]Absence check using 729 positive place invariants in 137 ms returned sat
[2023-03-12 14:12:39] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 49 ms returned sat
[2023-03-12 14:12:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:12:40] [INFO ] [Nat]Absence check using state equation in 1336 ms returned sat
[2023-03-12 14:12:41] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 244 ms.
[2023-03-12 14:13:00] [INFO ] Added : 550 causal constraints over 110 iterations in 20126 ms.(timeout) Result :sat
Current structural bounds on expressions (after SMT) : [24, 24, 24, 24, 24] Max seen :[22, 9, 16, 10, 11]
FORMULA HypertorusGrid-PT-d4k3p2b08-UpperBounds-12 24 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HypertorusGrid-PT-d4k3p2b08-UpperBounds-03 24 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HypertorusGrid-PT-d4k3p2b08-UpperBounds-02 24 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 2025 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2025/2025 places, 5184/5184 transitions.
Applied a total of 0 rules in 103 ms. Remains 2025 /2025 variables (removed 0) and now considering 5184/5184 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 2025/2025 places, 5184/5184 transitions.
[2023-03-12 14:15:31] [INFO ] Invariant cache hit.
Finished random walk after 212506 steps, including 0 resets, run visited all 2 properties in 30001 ms. (steps per millisecond=7 )
Finished Best-First random walk after 302070 steps, including 0 resets, run visited all 2 properties in 5016 ms. (steps per millisecond=60 )
Finished Best-First random walk after 301497 steps, including 0 resets, run visited all 2 properties in 5002 ms. (steps per millisecond=60 )
[2023-03-12 14:16:11] [INFO ] Invariant cache hit.
[2023-03-12 14:16:11] [INFO ] [Real]Absence check using 729 positive place invariants in 136 ms returned sat
[2023-03-12 14:16:11] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 54 ms returned sat
[2023-03-12 14:16:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:16:13] [INFO ] [Real]Absence check using state equation in 1404 ms returned sat
[2023-03-12 14:16:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:16:13] [INFO ] [Nat]Absence check using 729 positive place invariants in 141 ms returned sat
[2023-03-12 14:16:13] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 49 ms returned sat
[2023-03-12 14:16:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:16:14] [INFO ] [Nat]Absence check using state equation in 1316 ms returned sat
[2023-03-12 14:16:15] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 214 ms.
[2023-03-12 14:16:35] [INFO ] Added : 550 causal constraints over 110 iterations in 20020 ms.(timeout) Result :sat
[2023-03-12 14:16:35] [INFO ] [Real]Absence check using 729 positive place invariants in 124 ms returned sat
[2023-03-12 14:16:35] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 49 ms returned sat
[2023-03-12 14:16:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:16:36] [INFO ] [Real]Absence check using state equation in 1309 ms returned sat
[2023-03-12 14:16:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:16:37] [INFO ] [Nat]Absence check using 729 positive place invariants in 128 ms returned sat
[2023-03-12 14:16:37] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 50 ms returned sat
[2023-03-12 14:16:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:16:38] [INFO ] [Nat]Absence check using state equation in 1330 ms returned sat
[2023-03-12 14:16:39] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 205 ms.
[2023-03-12 14:16:59] [INFO ] Added : 560 causal constraints over 112 iterations in 20158 ms.(timeout) Result :sat
Current structural bounds on expressions (after SMT) : [24, 24] Max seen :[17, 13]
Support contains 2 out of 2025 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2025/2025 places, 5184/5184 transitions.
Applied a total of 0 rules in 103 ms. Remains 2025 /2025 variables (removed 0) and now considering 5184/5184 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 2025/2025 places, 5184/5184 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2025/2025 places, 5184/5184 transitions.
Applied a total of 0 rules in 124 ms. Remains 2025 /2025 variables (removed 0) and now considering 5184/5184 (removed 0) transitions.
[2023-03-12 14:17:59] [INFO ] Invariant cache hit.
[2023-03-12 14:17:59] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 14:18:01] [INFO ] Implicit Places using invariants in 1729 ms returned []
[2023-03-12 14:18:01] [INFO ] Invariant cache hit.
[2023-03-12 14:18:01] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 14:18:03] [INFO ] Implicit Places using invariants and state equation in 2504 ms returned []
Implicit Place search using SMT with State Equation took 4263 ms to find 0 implicit places.
[2023-03-12 14:18:04] [INFO ] Redundant transitions in 441 ms returned []
[2023-03-12 14:18:04] [INFO ] Invariant cache hit.
[2023-03-12 14:18:04] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 14:18:06] [INFO ] Dead Transitions using invariants and state equation in 2487 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7327 ms. Remains : 2025/2025 places, 5184/5184 transitions.
[2023-03-12 14:18:06] [INFO ] Invariant cache hit.
Finished random walk after 217701 steps, including 0 resets, run visited all 2 properties in 30001 ms. (steps per millisecond=7 )
Finished Best-First random walk after 299339 steps, including 0 resets, run visited all 2 properties in 5002 ms. (steps per millisecond=59 )
Finished Best-First random walk after 300017 steps, including 0 resets, run visited all 2 properties in 5009 ms. (steps per millisecond=59 )
[2023-03-12 14:18:46] [INFO ] Invariant cache hit.
[2023-03-12 14:18:47] [INFO ] [Real]Absence check using 729 positive place invariants in 139 ms returned sat
[2023-03-12 14:18:47] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 56 ms returned sat
[2023-03-12 14:18:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:18:48] [INFO ] [Real]Absence check using state equation in 1437 ms returned sat
[2023-03-12 14:18:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:18:48] [INFO ] [Nat]Absence check using 729 positive place invariants in 134 ms returned sat
[2023-03-12 14:18:48] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 49 ms returned sat
[2023-03-12 14:18:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:18:50] [INFO ] [Nat]Absence check using state equation in 1405 ms returned sat
[2023-03-12 14:18:50] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 227 ms.
[2023-03-12 14:19:10] [INFO ] Added : 535 causal constraints over 107 iterations in 20167 ms.(timeout) Result :sat
[2023-03-12 14:19:11] [INFO ] [Real]Absence check using 729 positive place invariants in 143 ms returned sat
[2023-03-12 14:19:11] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 49 ms returned sat
[2023-03-12 14:19:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:19:12] [INFO ] [Real]Absence check using state equation in 1363 ms returned sat
[2023-03-12 14:19:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:19:12] [INFO ] [Nat]Absence check using 729 positive place invariants in 126 ms returned sat
[2023-03-12 14:19:13] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 52 ms returned sat
[2023-03-12 14:19:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:19:14] [INFO ] [Nat]Absence check using state equation in 1353 ms returned sat
[2023-03-12 14:19:14] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 216 ms.
[2023-03-12 14:19:34] [INFO ] Added : 560 causal constraints over 112 iterations in 20057 ms.(timeout) Result :sat
Current structural bounds on expressions (after SMT) : [24, 24] Max seen :[17, 15]
Support contains 2 out of 2025 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2025/2025 places, 5184/5184 transitions.
Applied a total of 0 rules in 117 ms. Remains 2025 /2025 variables (removed 0) and now considering 5184/5184 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 2025/2025 places, 5184/5184 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2025/2025 places, 5184/5184 transitions.
Applied a total of 0 rules in 83 ms. Remains 2025 /2025 variables (removed 0) and now considering 5184/5184 (removed 0) transitions.
[2023-03-12 14:20:34] [INFO ] Invariant cache hit.
[2023-03-12 14:20:35] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 14:20:36] [INFO ] Implicit Places using invariants in 1681 ms returned []
[2023-03-12 14:20:36] [INFO ] Invariant cache hit.
[2023-03-12 14:20:37] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 14:20:39] [INFO ] Implicit Places using invariants and state equation in 2503 ms returned []
Implicit Place search using SMT with State Equation took 4218 ms to find 0 implicit places.
[2023-03-12 14:20:39] [INFO ] Redundant transitions in 262 ms returned []
[2023-03-12 14:20:39] [INFO ] Invariant cache hit.
[2023-03-12 14:20:39] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 14:20:41] [INFO ] Dead Transitions using invariants and state equation in 2516 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7090 ms. Remains : 2025/2025 places, 5184/5184 transitions.
[2023-03-12 14:20:41] [INFO ] Invariant cache hit.
Finished random walk after 209939 steps, including 0 resets, run visited all 2 properties in 30001 ms. (steps per millisecond=6 )
Finished Best-First random walk after 302980 steps, including 0 resets, run visited all 2 properties in 5016 ms. (steps per millisecond=60 )
Finished Best-First random walk after 299377 steps, including 0 resets, run visited all 2 properties in 5012 ms. (steps per millisecond=59 )
[2023-03-12 14:21:22] [INFO ] Invariant cache hit.
[2023-03-12 14:21:22] [INFO ] [Real]Absence check using 729 positive place invariants in 127 ms returned sat
[2023-03-12 14:21:22] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 52 ms returned sat
[2023-03-12 14:21:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:21:23] [INFO ] [Real]Absence check using state equation in 1339 ms returned sat
[2023-03-12 14:21:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:21:24] [INFO ] [Nat]Absence check using 729 positive place invariants in 134 ms returned sat
[2023-03-12 14:21:24] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 51 ms returned sat
[2023-03-12 14:21:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:21:25] [INFO ] [Nat]Absence check using state equation in 1363 ms returned sat
[2023-03-12 14:21:25] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 227 ms.
[2023-03-12 14:21:45] [INFO ] Added : 560 causal constraints over 112 iterations in 20025 ms.(timeout) Result :sat
[2023-03-12 14:21:46] [INFO ] [Real]Absence check using 729 positive place invariants in 133 ms returned sat
[2023-03-12 14:21:46] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 49 ms returned sat
[2023-03-12 14:21:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:21:47] [INFO ] [Real]Absence check using state equation in 1359 ms returned sat
[2023-03-12 14:21:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:21:48] [INFO ] [Nat]Absence check using 729 positive place invariants in 135 ms returned sat
[2023-03-12 14:21:48] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 57 ms returned sat
[2023-03-12 14:21:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:21:49] [INFO ] [Nat]Absence check using state equation in 1339 ms returned sat
[2023-03-12 14:21:49] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 214 ms.
[2023-03-12 14:22:09] [INFO ] Added : 550 causal constraints over 110 iterations in 20038 ms.(timeout) Result :sat
Current structural bounds on expressions (after SMT) : [24, 24] Max seen :[18, 17]
Support contains 2 out of 2025 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2025/2025 places, 5184/5184 transitions.
Applied a total of 0 rules in 109 ms. Remains 2025 /2025 variables (removed 0) and now considering 5184/5184 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 2025/2025 places, 5184/5184 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2025/2025 places, 5184/5184 transitions.
Applied a total of 0 rules in 105 ms. Remains 2025 /2025 variables (removed 0) and now considering 5184/5184 (removed 0) transitions.
[2023-03-12 14:23:10] [INFO ] Invariant cache hit.
[2023-03-12 14:23:10] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 14:23:11] [INFO ] Implicit Places using invariants in 1617 ms returned []
[2023-03-12 14:23:11] [INFO ] Invariant cache hit.
[2023-03-12 14:23:12] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 14:23:14] [INFO ] Implicit Places using invariants and state equation in 2562 ms returned []
Implicit Place search using SMT with State Equation took 4194 ms to find 0 implicit places.
[2023-03-12 14:23:14] [INFO ] Redundant transitions in 377 ms returned []
[2023-03-12 14:23:14] [INFO ] Invariant cache hit.
[2023-03-12 14:23:15] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 14:23:17] [INFO ] Dead Transitions using invariants and state equation in 2484 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7172 ms. Remains : 2025/2025 places, 5184/5184 transitions.
[2023-03-12 14:23:17] [INFO ] Invariant cache hit.
Finished random walk after 222610 steps, including 1 resets, run visited all 2 properties in 30001 ms. (steps per millisecond=7 )
Finished Best-First random walk after 300972 steps, including 0 resets, run visited all 2 properties in 5013 ms. (steps per millisecond=60 )
Finished Best-First random walk after 304452 steps, including 0 resets, run visited all 2 properties in 5002 ms. (steps per millisecond=60 )
[2023-03-12 14:23:57] [INFO ] Invariant cache hit.
[2023-03-12 14:23:57] [INFO ] [Real]Absence check using 729 positive place invariants in 129 ms returned sat
[2023-03-12 14:23:57] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 52 ms returned sat
[2023-03-12 14:23:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:23:58] [INFO ] [Real]Absence check using state equation in 1327 ms returned sat
[2023-03-12 14:23:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:23:59] [INFO ] [Nat]Absence check using 729 positive place invariants in 135 ms returned sat
[2023-03-12 14:23:59] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 48 ms returned sat
[2023-03-12 14:23:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:24:00] [INFO ] [Nat]Absence check using state equation in 1465 ms returned sat
[2023-03-12 14:24:01] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 210 ms.
[2023-03-12 14:24:21] [INFO ] Added : 545 causal constraints over 109 iterations in 20050 ms.(timeout) Result :sat
[2023-03-12 14:24:21] [INFO ] [Real]Absence check using 729 positive place invariants in 137 ms returned sat
[2023-03-12 14:24:21] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 50 ms returned sat
[2023-03-12 14:24:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:24:22] [INFO ] [Real]Absence check using state equation in 1345 ms returned sat
[2023-03-12 14:24:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:24:23] [INFO ] [Nat]Absence check using 729 positive place invariants in 142 ms returned sat
[2023-03-12 14:24:23] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 51 ms returned sat
[2023-03-12 14:24:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:24:24] [INFO ] [Nat]Absence check using state equation in 1429 ms returned sat
[2023-03-12 14:24:25] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 234 ms.
[2023-03-12 14:24:45] [INFO ] Added : 550 causal constraints over 110 iterations in 20087 ms.(timeout) Result :sat
Current structural bounds on expressions (after SMT) : [24, 24] Max seen :[19, 18]
Support contains 2 out of 2025 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2025/2025 places, 5184/5184 transitions.
Applied a total of 0 rules in 137 ms. Remains 2025 /2025 variables (removed 0) and now considering 5184/5184 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 2025/2025 places, 5184/5184 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2025/2025 places, 5184/5184 transitions.
Applied a total of 0 rules in 118 ms. Remains 2025 /2025 variables (removed 0) and now considering 5184/5184 (removed 0) transitions.
[2023-03-12 14:25:45] [INFO ] Invariant cache hit.
[2023-03-12 14:25:46] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 14:25:47] [INFO ] Implicit Places using invariants in 1704 ms returned []
[2023-03-12 14:25:47] [INFO ] Invariant cache hit.
[2023-03-12 14:25:47] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 14:25:49] [INFO ] Implicit Places using invariants and state equation in 2716 ms returned []
Implicit Place search using SMT with State Equation took 4455 ms to find 0 implicit places.
[2023-03-12 14:25:50] [INFO ] Redundant transitions in 364 ms returned []
[2023-03-12 14:25:50] [INFO ] Invariant cache hit.
[2023-03-12 14:25:50] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 14:25:52] [INFO ] Dead Transitions using invariants and state equation in 2548 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7507 ms. Remains : 2025/2025 places, 5184/5184 transitions.
[2023-03-12 14:25:52] [INFO ] Invariant cache hit.
Finished random walk after 210901 steps, including 0 resets, run visited all 2 properties in 30001 ms. (steps per millisecond=7 )
Finished Best-First random walk after 300525 steps, including 0 resets, run visited all 2 properties in 5017 ms. (steps per millisecond=59 )
Finished Best-First random walk after 303085 steps, including 0 resets, run visited all 2 properties in 5017 ms. (steps per millisecond=60 )
[2023-03-12 14:26:32] [INFO ] Invariant cache hit.
[2023-03-12 14:26:33] [INFO ] [Real]Absence check using 729 positive place invariants in 134 ms returned sat
[2023-03-12 14:26:33] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 52 ms returned sat
[2023-03-12 14:26:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:26:34] [INFO ] [Real]Absence check using state equation in 1408 ms returned sat
[2023-03-12 14:26:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:26:35] [INFO ] [Nat]Absence check using 729 positive place invariants in 135 ms returned sat
[2023-03-12 14:26:35] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 50 ms returned sat
[2023-03-12 14:26:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:26:36] [INFO ] [Nat]Absence check using state equation in 1345 ms returned sat
[2023-03-12 14:26:36] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 197 ms.
[2023-03-12 14:26:56] [INFO ] Added : 550 causal constraints over 110 iterations in 20086 ms.(timeout) Result :sat
[2023-03-12 14:26:57] [INFO ] [Real]Absence check using 729 positive place invariants in 139 ms returned sat
[2023-03-12 14:26:57] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 55 ms returned sat
[2023-03-12 14:26:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:26:58] [INFO ] [Real]Absence check using state equation in 1469 ms returned sat
[2023-03-12 14:26:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:26:59] [INFO ] [Nat]Absence check using 729 positive place invariants in 150 ms returned sat
[2023-03-12 14:26:59] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 51 ms returned sat
[2023-03-12 14:26:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:27:00] [INFO ] [Nat]Absence check using state equation in 1448 ms returned sat
[2023-03-12 14:27:01] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 247 ms.
[2023-03-12 14:27:21] [INFO ] Added : 535 causal constraints over 107 iterations in 20072 ms.(timeout) Result :sat
Current structural bounds on expressions (after SMT) : [24, 24] Max seen :[20, 21]
FORMULA HypertorusGrid-PT-d4k3p2b08-UpperBounds-10 24 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 2025 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2025/2025 places, 5184/5184 transitions.
Applied a total of 0 rules in 87 ms. Remains 2025 /2025 variables (removed 0) and now considering 5184/5184 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 2025/2025 places, 5184/5184 transitions.
[2023-03-12 14:28:21] [INFO ] Invariant cache hit.
Finished random walk after 220206 steps, including 1 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=7 )
Finished Best-First random walk after 302131 steps, including 0 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=60 )
[2023-03-12 14:28:56] [INFO ] Invariant cache hit.
[2023-03-12 14:28:56] [INFO ] [Real]Absence check using 729 positive place invariants in 138 ms returned sat
[2023-03-12 14:28:56] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 56 ms returned sat
[2023-03-12 14:28:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:28:58] [INFO ] [Real]Absence check using state equation in 1490 ms returned sat
[2023-03-12 14:28:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:28:58] [INFO ] [Nat]Absence check using 729 positive place invariants in 142 ms returned sat
[2023-03-12 14:28:58] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 52 ms returned sat
[2023-03-12 14:28:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:29:00] [INFO ] [Nat]Absence check using state equation in 1420 ms returned sat
[2023-03-12 14:29:00] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 208 ms.
[2023-03-12 14:29:20] [INFO ] Added : 545 causal constraints over 109 iterations in 20042 ms.(timeout) Result :sat
Current structural bounds on expressions (after SMT) : [24] Max seen :[21]
Support contains 1 out of 2025 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2025/2025 places, 5184/5184 transitions.
Applied a total of 0 rules in 76 ms. Remains 2025 /2025 variables (removed 0) and now considering 5184/5184 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 2025/2025 places, 5184/5184 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2025/2025 places, 5184/5184 transitions.
Applied a total of 0 rules in 76 ms. Remains 2025 /2025 variables (removed 0) and now considering 5184/5184 (removed 0) transitions.
[2023-03-12 14:29:50] [INFO ] Invariant cache hit.
[2023-03-12 14:29:51] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 14:29:52] [INFO ] Implicit Places using invariants in 1548 ms returned []
[2023-03-12 14:29:52] [INFO ] Invariant cache hit.
[2023-03-12 14:29:52] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 14:29:54] [INFO ] Implicit Places using invariants and state equation in 2547 ms returned []
Implicit Place search using SMT with State Equation took 4097 ms to find 0 implicit places.
[2023-03-12 14:29:55] [INFO ] Redundant transitions in 378 ms returned []
[2023-03-12 14:29:55] [INFO ] Invariant cache hit.
[2023-03-12 14:29:55] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 14:29:57] [INFO ] Dead Transitions using invariants and state equation in 2449 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7010 ms. Remains : 2025/2025 places, 5184/5184 transitions.
Starting property specific reduction for HypertorusGrid-PT-d4k3p2b08-UpperBounds-08
[2023-03-12 14:29:57] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1741 ms. (steps per millisecond=5 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 1) seen :2
[2023-03-12 14:29:59] [INFO ] Invariant cache hit.
[2023-03-12 14:29:59] [INFO ] [Real]Absence check using 729 positive place invariants in 136 ms returned sat
[2023-03-12 14:29:59] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 49 ms returned sat
[2023-03-12 14:29:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:30:01] [INFO ] [Real]Absence check using state equation in 1356 ms returned sat
[2023-03-12 14:30:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:30:01] [INFO ] [Nat]Absence check using 729 positive place invariants in 143 ms returned sat
[2023-03-12 14:30:01] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 58 ms returned sat
[2023-03-12 14:30:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:30:03] [INFO ] [Nat]Absence check using state equation in 1413 ms returned sat
[2023-03-12 14:30:03] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 207 ms.
[2023-03-12 14:30:08] [INFO ] Deduced a trap composed of 2 places in 2036 ms of which 2 ms to minimize.
[2023-03-12 14:30:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [24] Max seen :[2]
Support contains 1 out of 2025 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2025/2025 places, 5184/5184 transitions.
Applied a total of 0 rules in 87 ms. Remains 2025 /2025 variables (removed 0) and now considering 5184/5184 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 2025/2025 places, 5184/5184 transitions.
[2023-03-12 14:30:08] [INFO ] Invariant cache hit.
Finished random walk after 222300 steps, including 1 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=7 )
Finished Best-First random walk after 302484 steps, including 0 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=60 )
[2023-03-12 14:30:43] [INFO ] Invariant cache hit.
[2023-03-12 14:30:43] [INFO ] [Real]Absence check using 729 positive place invariants in 131 ms returned sat
[2023-03-12 14:30:43] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 55 ms returned sat
[2023-03-12 14:30:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:30:45] [INFO ] [Real]Absence check using state equation in 1359 ms returned sat
[2023-03-12 14:30:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:30:45] [INFO ] [Nat]Absence check using 729 positive place invariants in 138 ms returned sat
[2023-03-12 14:30:45] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 52 ms returned sat
[2023-03-12 14:30:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:30:47] [INFO ] [Nat]Absence check using state equation in 1415 ms returned sat
[2023-03-12 14:30:47] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 230 ms.
[2023-03-12 14:31:07] [INFO ] Added : 535 causal constraints over 107 iterations in 20028 ms.(timeout) Result :sat
Current structural bounds on expressions (after SMT) : [24] Max seen :[10]
Support contains 1 out of 2025 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2025/2025 places, 5184/5184 transitions.
Applied a total of 0 rules in 79 ms. Remains 2025 /2025 variables (removed 0) and now considering 5184/5184 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 2025/2025 places, 5184/5184 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2025/2025 places, 5184/5184 transitions.
Applied a total of 0 rules in 73 ms. Remains 2025 /2025 variables (removed 0) and now considering 5184/5184 (removed 0) transitions.
[2023-03-12 14:31:37] [INFO ] Invariant cache hit.
[2023-03-12 14:31:38] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 14:31:39] [INFO ] Implicit Places using invariants in 1506 ms returned []
[2023-03-12 14:31:39] [INFO ] Invariant cache hit.
[2023-03-12 14:31:39] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 14:31:41] [INFO ] Implicit Places using invariants and state equation in 2536 ms returned []
Implicit Place search using SMT with State Equation took 4064 ms to find 0 implicit places.
[2023-03-12 14:31:42] [INFO ] Redundant transitions in 340 ms returned []
[2023-03-12 14:31:42] [INFO ] Invariant cache hit.
[2023-03-12 14:31:42] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 14:31:44] [INFO ] Dead Transitions using invariants and state equation in 2369 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6878 ms. Remains : 2025/2025 places, 5184/5184 transitions.
[2023-03-12 14:31:44] [INFO ] Invariant cache hit.
Finished random walk after 220191 steps, including 1 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=7 )
Finished Best-First random walk after 283782 steps, including 0 resets, run visited all 1 properties in 5009 ms. (steps per millisecond=56 )
[2023-03-12 14:32:19] [INFO ] Invariant cache hit.
[2023-03-12 14:32:19] [INFO ] [Real]Absence check using 729 positive place invariants in 139 ms returned sat
[2023-03-12 14:32:19] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 55 ms returned sat
[2023-03-12 14:32:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:32:21] [INFO ] [Real]Absence check using state equation in 1467 ms returned sat
[2023-03-12 14:32:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:32:21] [INFO ] [Nat]Absence check using 729 positive place invariants in 135 ms returned sat
[2023-03-12 14:32:21] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 50 ms returned sat
[2023-03-12 14:32:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:32:23] [INFO ] [Nat]Absence check using state equation in 1387 ms returned sat
[2023-03-12 14:32:23] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 214 ms.
[2023-03-12 14:32:43] [INFO ] Added : 550 causal constraints over 110 iterations in 20091 ms.(timeout) Result :sat
Current structural bounds on expressions (after SMT) : [24] Max seen :[10]
Support contains 1 out of 2025 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2025/2025 places, 5184/5184 transitions.
Applied a total of 0 rules in 76 ms. Remains 2025 /2025 variables (removed 0) and now considering 5184/5184 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 2025/2025 places, 5184/5184 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2025/2025 places, 5184/5184 transitions.
Applied a total of 0 rules in 74 ms. Remains 2025 /2025 variables (removed 0) and now considering 5184/5184 (removed 0) transitions.
[2023-03-12 14:33:13] [INFO ] Invariant cache hit.
[2023-03-12 14:33:14] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 14:33:15] [INFO ] Implicit Places using invariants in 1560 ms returned []
[2023-03-12 14:33:15] [INFO ] Invariant cache hit.
[2023-03-12 14:33:15] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 14:33:17] [INFO ] Implicit Places using invariants and state equation in 2537 ms returned []
Implicit Place search using SMT with State Equation took 4123 ms to find 0 implicit places.
[2023-03-12 14:33:18] [INFO ] Redundant transitions in 372 ms returned []
[2023-03-12 14:33:18] [INFO ] Invariant cache hit.
[2023-03-12 14:33:18] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 14:33:20] [INFO ] Dead Transitions using invariants and state equation in 2480 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7056 ms. Remains : 2025/2025 places, 5184/5184 transitions.
[2023-03-12 14:33:20] [INFO ] Invariant cache hit.
Finished random walk after 222823 steps, including 1 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=7 )
Finished Best-First random walk after 305100 steps, including 0 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=61 )
[2023-03-12 14:33:55] [INFO ] Invariant cache hit.
[2023-03-12 14:33:56] [INFO ] [Real]Absence check using 729 positive place invariants in 135 ms returned sat
[2023-03-12 14:33:56] [INFO ] [Real]Absence check using 729 positive and 1 generalized place invariants in 54 ms returned sat
[2023-03-12 14:33:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:33:57] [INFO ] [Real]Absence check using state equation in 1340 ms returned sat
[2023-03-12 14:33:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:33:57] [INFO ] [Nat]Absence check using 729 positive place invariants in 130 ms returned sat
[2023-03-12 14:33:58] [INFO ] [Nat]Absence check using 729 positive and 1 generalized place invariants in 48 ms returned sat
[2023-03-12 14:33:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:33:59] [INFO ] [Nat]Absence check using state equation in 1313 ms returned sat
[2023-03-12 14:33:59] [INFO ] Computed and/alt/rep : 4536/4536/4536 causal constraints (skipped 0 transitions) in 205 ms.
[2023-03-12 14:34:19] [INFO ] Added : 550 causal constraints over 110 iterations in 20127 ms.(timeout) Result :sat
Current structural bounds on expressions (after SMT) : [24] Max seen :[12]
Support contains 1 out of 2025 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2025/2025 places, 5184/5184 transitions.
Applied a total of 0 rules in 74 ms. Remains 2025 /2025 variables (removed 0) and now considering 5184/5184 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 2025/2025 places, 5184/5184 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2025/2025 places, 5184/5184 transitions.
Applied a total of 0 rules in 78 ms. Remains 2025 /2025 variables (removed 0) and now considering 5184/5184 (removed 0) transitions.
[2023-03-12 14:34:49] [INFO ] Invariant cache hit.
[2023-03-12 14:34:50] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 14:34:51] [INFO ] Implicit Places using invariants in 1471 ms returned []
[2023-03-12 14:34:51] [INFO ] Invariant cache hit.
[2023-03-12 14:34:51] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 14:34:53] [INFO ] Implicit Places using invariants and state equation in 2561 ms returned []
Implicit Place search using SMT with State Equation took 4033 ms to find 0 implicit places.
[2023-03-12 14:34:54] [INFO ] Redundant transitions in 356 ms returned []
[2023-03-12 14:34:54] [INFO ] Invariant cache hit.
[2023-03-12 14:34:54] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 14:34:56] [INFO ] Dead Transitions using invariants and state equation in 2523 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6994 ms. Remains : 2025/2025 places, 5184/5184 transitions.
Ending property specific reduction for HypertorusGrid-PT-d4k3p2b08-UpperBounds-08 in 299269 ms.
[2023-03-12 14:34:57] [INFO ] Flatten gal took : 419 ms
[2023-03-12 14:34:57] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-12 14:34:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2025 places, 5184 transitions and 20736 arcs took 23 ms.
Total runtime 2062119 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running HypertorusGrid (PT), instance d4k3p2b08
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 2025 places, 5184 transitions, 20736 arcs.
Final Score: 795456.568
Took : 57 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5678284 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16097300 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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="HypertorusGrid-PT-d4k3p2b08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is HypertorusGrid-PT-d4k3p2b08, 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 r235-tall-167856421200061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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