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.r521-tall-167987246400253.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 ltsminxred
Input is EisenbergMcGuire-PT-07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246400253
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.5K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 17K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 1.2M Mar 31 16:48 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-00
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-01
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-02
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-03
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-04
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-05
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-06
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-07
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-08
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-09
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-10
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-11
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-12
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-13
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-14
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1680845470486

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-07
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 05:31:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-04-07 05:31:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 05:31:14] [INFO ] Load time of PNML (sax parser for PT used): 311 ms
[2023-04-07 05:31:14] [INFO ] Transformed 553 places.
[2023-04-07 05:31:14] [INFO ] Transformed 1960 transitions.
[2023-04-07 05:31:14] [INFO ] Found NUPN structural information;
[2023-04-07 05:31:14] [INFO ] Parsed PT model containing 553 places and 1960 transitions and 9212 arcs in 555 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 20 ms.
Normalized transition count is 1001 out of 1960 initially.
// Phase 1: matrix 1001 rows 553 cols
[2023-04-07 05:31:14] [INFO ] Computed 22 invariants in 62 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 16) seen :11
FORMULA EisenbergMcGuire-PT-07-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 5) seen :0
[2023-04-07 05:31:14] [INFO ] Flow matrix only has 1001 transitions (discarded 959 similar events)
// Phase 1: matrix 1001 rows 553 cols
[2023-04-07 05:31:14] [INFO ] Computed 22 invariants in 9 ms
[2023-04-07 05:31:15] [INFO ] [Real]Absence check using 15 positive place invariants in 46 ms returned sat
[2023-04-07 05:31:15] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 5 ms returned sat
[2023-04-07 05:31:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:31:16] [INFO ] [Real]Absence check using state equation in 600 ms returned sat
[2023-04-07 05:31:16] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:31:16] [INFO ] [Nat]Absence check using 15 positive place invariants in 14 ms returned sat
[2023-04-07 05:31:16] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 05:31:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:31:16] [INFO ] [Nat]Absence check using state equation in 416 ms returned sat
[2023-04-07 05:31:16] [INFO ] State equation strengthened by 472 read => feed constraints.
[2023-04-07 05:31:16] [INFO ] [Nat]Added 472 Read/Feed constraints in 209 ms returned sat
[2023-04-07 05:31:21] [INFO ] Deduced a trap composed of 3 places in 4421 ms of which 22 ms to minimize.
[2023-04-07 05:31: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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-07 05:31:21] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2023-04-07 05:31:21] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 40 ms returned sat
[2023-04-07 05:31:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:31:22] [INFO ] [Real]Absence check using state equation in 497 ms returned sat
[2023-04-07 05:31:22] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:31:22] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2023-04-07 05:31:22] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 5 ms returned sat
[2023-04-07 05:31:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:31:27] [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.verifyPossible(DeadlockTester.java:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-07 05:31:27] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2023-04-07 05:31:27] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 05:31:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:31:27] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2023-04-07 05:31:27] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:31:28] [INFO ] [Nat]Absence check using 15 positive place invariants in 16 ms returned sat
[2023-04-07 05:31:28] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 05:31:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:31:28] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2023-04-07 05:31:28] [INFO ] [Nat]Added 472 Read/Feed constraints in 64 ms returned sat
[2023-04-07 05:31:28] [INFO ] Deduced a trap composed of 6 places in 380 ms of which 1 ms to minimize.
[2023-04-07 05:31:29] [INFO ] Deduced a trap composed of 3 places in 334 ms of which 2 ms to minimize.
[2023-04-07 05:31:29] [INFO ] Deduced a trap composed of 48 places in 495 ms of which 1 ms to minimize.
[2023-04-07 05:31:30] [INFO ] Deduced a trap composed of 39 places in 411 ms of which 1 ms to minimize.
[2023-04-07 05:31:30] [INFO ] Deduced a trap composed of 5 places in 376 ms of which 1 ms to minimize.
[2023-04-07 05:31:30] [INFO ] Deduced a trap composed of 3 places in 275 ms of which 1 ms to minimize.
[2023-04-07 05:31:31] [INFO ] Deduced a trap composed of 4 places in 388 ms of which 1 ms to minimize.
[2023-04-07 05:31:31] [INFO ] Deduced a trap composed of 190 places in 399 ms of which 1 ms to minimize.
[2023-04-07 05:31:32] [INFO ] Deduced a trap composed of 41 places in 258 ms of which 1 ms to minimize.
[2023-04-07 05:31:32] [INFO ] Deduced a trap composed of 35 places in 270 ms of which 1 ms to minimize.
[2023-04-07 05:31:32] [INFO ] Deduced a trap composed of 3 places in 318 ms of which 1 ms to minimize.
[2023-04-07 05:31:33] [INFO ] Deduced a trap composed of 3 places in 181 ms of which 0 ms to minimize.
[2023-04-07 05:31:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-07 05:31:33] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2023-04-07 05:31:33] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 05:31:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:31:33] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2023-04-07 05:31:33] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:31:33] [INFO ] [Nat]Absence check using 15 positive place invariants in 20 ms returned sat
[2023-04-07 05:31:33] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-07 05:31:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:31:33] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2023-04-07 05:31:33] [INFO ] [Nat]Added 472 Read/Feed constraints in 75 ms returned sat
[2023-04-07 05:31:34] [INFO ] Deduced a trap composed of 44 places in 267 ms of which 1 ms to minimize.
[2023-04-07 05:31:34] [INFO ] Deduced a trap composed of 3 places in 438 ms of which 1 ms to minimize.
[2023-04-07 05:31:34] [INFO ] Deduced a trap composed of 104 places in 295 ms of which 0 ms to minimize.
[2023-04-07 05:31:35] [INFO ] Deduced a trap composed of 33 places in 260 ms of which 1 ms to minimize.
[2023-04-07 05:31:35] [INFO ] Deduced a trap composed of 3 places in 273 ms of which 1 ms to minimize.
[2023-04-07 05:31:35] [INFO ] Deduced a trap composed of 35 places in 245 ms of which 1 ms to minimize.
[2023-04-07 05:31:36] [INFO ] Deduced a trap composed of 3 places in 270 ms of which 0 ms to minimize.
[2023-04-07 05:31:36] [INFO ] Deduced a trap composed of 38 places in 231 ms of which 1 ms to minimize.
[2023-04-07 05:31:36] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 1 ms to minimize.
[2023-04-07 05:31:36] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 0 ms to minimize.
[2023-04-07 05:31:37] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 0 ms to minimize.
[2023-04-07 05:31:37] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 1 ms to minimize.
[2023-04-07 05:31:37] [INFO ] Deduced a trap composed of 35 places in 180 ms of which 15 ms to minimize.
[2023-04-07 05:31:37] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 0 ms to minimize.
[2023-04-07 05:31:37] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 1 ms to minimize.
[2023-04-07 05:31:38] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 1 ms to minimize.
[2023-04-07 05:31:38] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 0 ms to minimize.
[2023-04-07 05:31:38] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4450 ms
[2023-04-07 05:31:38] [INFO ] Computed and/alt/rep : 680/1520/554 causal constraints (skipped 440 transitions) in 107 ms.
[2023-04-07 05:31:38] [INFO ] Deduced a trap composed of 3 places in 306 ms of which 4 ms to minimize.
[2023-04-07 05:31:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-07 05:31:38] [INFO ] [Real]Absence check using 15 positive place invariants in 21 ms returned sat
[2023-04-07 05:31:38] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 5 ms returned sat
[2023-04-07 05:31:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:31:39] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2023-04-07 05:31:39] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:31:39] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2023-04-07 05:31:39] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 22 ms returned sat
[2023-04-07 05:31:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:31:39] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2023-04-07 05:31:39] [INFO ] [Nat]Added 472 Read/Feed constraints in 54 ms returned sat
[2023-04-07 05:31:39] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 2 ms to minimize.
[2023-04-07 05:31:40] [INFO ] Deduced a trap composed of 3 places in 264 ms of which 0 ms to minimize.
[2023-04-07 05:31:40] [INFO ] Deduced a trap composed of 111 places in 314 ms of which 1 ms to minimize.
[2023-04-07 05:31:40] [INFO ] Deduced a trap composed of 29 places in 250 ms of which 17 ms to minimize.
[2023-04-07 05:31:41] [INFO ] Deduced a trap composed of 3 places in 273 ms of which 1 ms to minimize.
[2023-04-07 05:31:46] [INFO ] Deduced a trap composed of 5 places in 5145 ms of which 0 ms to minimize.
[2023-04-07 05:31:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 1960/1960 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 553 transition count 1953
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 546 transition count 1953
Performed 152 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 152 Pre rules applied. Total rules applied 14 place count 546 transition count 1801
Deduced a syphon composed of 152 places in 3 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 304 rules applied. Total rules applied 318 place count 394 transition count 1801
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 360 place count 352 transition count 1507
Iterating global reduction 2 with 42 rules applied. Total rules applied 402 place count 352 transition count 1507
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 3 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 486 place count 310 transition count 1465
Applied a total of 486 rules in 321 ms. Remains 310 /553 variables (removed 243) and now considering 1465/1960 (removed 495) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 336 ms. Remains : 310/553 places, 1465/1960 transitions.
Normalized transition count is 506 out of 1465 initially.
// Phase 1: matrix 506 rows 310 cols
[2023-04-07 05:31:46] [INFO ] Computed 22 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2138 ms. (steps per millisecond=467 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 456 ms. (steps per millisecond=2192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 447 ms. (steps per millisecond=2237 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 506 ms. (steps per millisecond=1976 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 502 ms. (steps per millisecond=1992 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 521 ms. (steps per millisecond=1919 ) properties (out of 5) seen :0
[2023-04-07 05:31:51] [INFO ] Flow matrix only has 506 transitions (discarded 959 similar events)
// Phase 1: matrix 506 rows 310 cols
[2023-04-07 05:31:51] [INFO ] Computed 22 invariants in 15 ms
[2023-04-07 05:31:51] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 05:31:51] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 05:31:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:31:51] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2023-04-07 05:31:51] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:31:51] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 05:31:51] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 05:31:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:31:51] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2023-04-07 05:31:51] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 05:31:51] [INFO ] [Nat]Added 220 Read/Feed constraints in 41 ms returned sat
[2023-04-07 05:31:52] [INFO ] Computed and/alt/rep : 437/1059/311 causal constraints (skipped 188 transitions) in 128 ms.
[2023-04-07 05:31:52] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2023-04-07 05:31:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2023-04-07 05:31:52] [INFO ] Added : 38 causal constraints over 8 iterations in 674 ms. Result :sat
Minimization took 68 ms.
[2023-04-07 05:31:52] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 05:31:52] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 05:31:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:31:52] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2023-04-07 05:31:52] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:31:53] [INFO ] [Nat]Absence check using 15 positive place invariants in 13 ms returned sat
[2023-04-07 05:31:53] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 05:31:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:31:53] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2023-04-07 05:31:53] [INFO ] [Nat]Added 220 Read/Feed constraints in 26 ms returned sat
[2023-04-07 05:31:53] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 1 ms to minimize.
[2023-04-07 05:31:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2023-04-07 05:31:53] [INFO ] Computed and/alt/rep : 437/1059/311 causal constraints (skipped 188 transitions) in 52 ms.
[2023-04-07 05:31:53] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 0 ms to minimize.
[2023-04-07 05:31:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2023-04-07 05:31:54] [INFO ] Added : 63 causal constraints over 13 iterations in 672 ms. Result :sat
Minimization took 78 ms.
[2023-04-07 05:31:54] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-04-07 05:31:54] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 13 ms returned sat
[2023-04-07 05:31:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:31:54] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2023-04-07 05:31:54] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:31:54] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 05:31:54] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 05:31:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:31:54] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2023-04-07 05:31:54] [INFO ] [Nat]Added 220 Read/Feed constraints in 53 ms returned sat
[2023-04-07 05:31:54] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-04-07 05:31:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-04-07 05:31:54] [INFO ] Computed and/alt/rep : 437/1059/311 causal constraints (skipped 188 transitions) in 75 ms.
[2023-04-07 05:31:55] [INFO ] Added : 58 causal constraints over 12 iterations in 448 ms. Result :sat
Minimization took 82 ms.
[2023-04-07 05:31:55] [INFO ] [Real]Absence check using 15 positive place invariants in 15 ms returned sat
[2023-04-07 05:31:55] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 05:31:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:31:55] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2023-04-07 05:31:55] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:31:55] [INFO ] [Nat]Absence check using 15 positive place invariants in 120 ms returned sat
[2023-04-07 05:31:56] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 59 ms returned sat
[2023-04-07 05:31:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:31:56] [INFO ] [Nat]Absence check using state equation in 507 ms returned sat
[2023-04-07 05:31:56] [INFO ] [Nat]Added 220 Read/Feed constraints in 29 ms returned sat
[2023-04-07 05:31:56] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 0 ms to minimize.
[2023-04-07 05:31:56] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 0 ms to minimize.
[2023-04-07 05:31:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 278 ms
[2023-04-07 05:31:56] [INFO ] Computed and/alt/rep : 437/1059/311 causal constraints (skipped 188 transitions) in 62 ms.
[2023-04-07 05:31:57] [INFO ] Added : 58 causal constraints over 12 iterations in 451 ms. Result :sat
Minimization took 64 ms.
[2023-04-07 05:31:57] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-04-07 05:31:57] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 05:31:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:31:57] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2023-04-07 05:31:57] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:31:57] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 05:31:57] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 05:31:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:31:57] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2023-04-07 05:31:57] [INFO ] [Nat]Added 220 Read/Feed constraints in 24 ms returned sat
[2023-04-07 05:31:57] [INFO ] Computed and/alt/rep : 437/1059/311 causal constraints (skipped 188 transitions) in 40 ms.
[2023-04-07 05:31:58] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2023-04-07 05:31:58] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 1 ms to minimize.
[2023-04-07 05:31:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 258 ms
[2023-04-07 05:31:58] [INFO ] Added : 65 causal constraints over 13 iterations in 714 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA EisenbergMcGuire-PT-07-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 310 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 310/310 places, 1465/1465 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 310 transition count 1464
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 309 transition count 1464
Applied a total of 2 rules in 50 ms. Remains 309 /310 variables (removed 1) and now considering 1464/1465 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 309/310 places, 1464/1465 transitions.
Normalized transition count is 505 out of 1464 initially.
// Phase 1: matrix 505 rows 309 cols
[2023-04-07 05:31:59] [INFO ] Computed 22 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1594 ms. (steps per millisecond=627 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 444 ms. (steps per millisecond=2252 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 437 ms. (steps per millisecond=2288 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 426 ms. (steps per millisecond=2347 ) properties (out of 3) seen :0
[2023-04-07 05:32:02] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
// Phase 1: matrix 505 rows 309 cols
[2023-04-07 05:32:02] [INFO ] Computed 22 invariants in 12 ms
[2023-04-07 05:32:02] [INFO ] [Real]Absence check using 15 positive place invariants in 30 ms returned sat
[2023-04-07 05:32:02] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 05:32:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:32:02] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2023-04-07 05:32:02] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:32:02] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 05:32:02] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 05:32:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:32:03] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2023-04-07 05:32:03] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 05:32:03] [INFO ] [Nat]Added 220 Read/Feed constraints in 39 ms returned sat
[2023-04-07 05:32:03] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2023-04-07 05:32:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2023-04-07 05:32:03] [INFO ] Computed and/alt/rep : 436/1058/310 causal constraints (skipped 188 transitions) in 49 ms.
[2023-04-07 05:32:04] [INFO ] Added : 101 causal constraints over 21 iterations in 789 ms. Result :sat
Minimization took 80 ms.
[2023-04-07 05:32:04] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 05:32:04] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 05:32:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:32:04] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2023-04-07 05:32:04] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:32:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-04-07 05:32:04] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-07 05:32:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:32:04] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2023-04-07 05:32:04] [INFO ] [Nat]Added 220 Read/Feed constraints in 22 ms returned sat
[2023-04-07 05:32:04] [INFO ] Computed and/alt/rep : 436/1058/310 causal constraints (skipped 188 transitions) in 37 ms.
[2023-04-07 05:32:04] [INFO ] Added : 20 causal constraints over 4 iterations in 181 ms. Result :sat
Minimization took 54 ms.
[2023-04-07 05:32:04] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 05:32:04] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 05:32:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:32:05] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2023-04-07 05:32:05] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:32:05] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2023-04-07 05:32:05] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-07 05:32:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:32:05] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2023-04-07 05:32:05] [INFO ] [Nat]Added 220 Read/Feed constraints in 44 ms returned sat
[2023-04-07 05:32:05] [INFO ] Computed and/alt/rep : 436/1058/310 causal constraints (skipped 188 transitions) in 53 ms.
[2023-04-07 05:32:06] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 9 ms to minimize.
[2023-04-07 05:32:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2023-04-07 05:32:06] [INFO ] Added : 69 causal constraints over 15 iterations in 962 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 113 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 309/309 places, 1464/1464 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 69 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
[2023-04-07 05:32:07] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 05:32:07] [INFO ] Invariant cache hit.
[2023-04-07 05:32:07] [INFO ] Implicit Places using invariants in 492 ms returned []
[2023-04-07 05:32:07] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 05:32:07] [INFO ] Invariant cache hit.
[2023-04-07 05:32:07] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 05:32:09] [INFO ] Implicit Places using invariants and state equation in 1777 ms returned []
Implicit Place search using SMT with State Equation took 2313 ms to find 0 implicit places.
[2023-04-07 05:32:09] [INFO ] Redundant transitions in 179 ms returned []
[2023-04-07 05:32:09] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 05:32:09] [INFO ] Invariant cache hit.
[2023-04-07 05:32:10] [INFO ] Dead Transitions using invariants and state equation in 858 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3458 ms. Remains : 309/309 places, 1464/1464 transitions.
Starting property specific reduction for EisenbergMcGuire-PT-07-UpperBounds-03
Normalized transition count is 505 out of 1464 initially.
// Phase 1: matrix 505 rows 309 cols
[2023-04-07 05:32:10] [INFO ] Computed 22 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-04-07 05:32:10] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
// Phase 1: matrix 505 rows 309 cols
[2023-04-07 05:32:10] [INFO ] Computed 22 invariants in 2 ms
[2023-04-07 05:32:10] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 05:32:10] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-07 05:32:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:32:10] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2023-04-07 05:32:10] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:32:10] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 05:32:10] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 05:32:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:32:11] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2023-04-07 05:32:11] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 05:32:11] [INFO ] [Nat]Added 220 Read/Feed constraints in 39 ms returned sat
[2023-04-07 05:32:11] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2023-04-07 05:32:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2023-04-07 05:32:11] [INFO ] Computed and/alt/rep : 436/1058/310 causal constraints (skipped 188 transitions) in 53 ms.
[2023-04-07 05:32:12] [INFO ] Added : 101 causal constraints over 21 iterations in 825 ms. Result :sat
Minimization took 82 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 309 transition count 1463
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 308 transition count 1463
Applied a total of 2 rules in 39 ms. Remains 308 /309 variables (removed 1) and now considering 1463/1464 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 308/309 places, 1463/1464 transitions.
Normalized transition count is 504 out of 1463 initially.
// Phase 1: matrix 504 rows 308 cols
[2023-04-07 05:32:12] [INFO ] Computed 22 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1765 ms. (steps per millisecond=566 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 477 ms. (steps per millisecond=2096 ) properties (out of 1) seen :0
[2023-04-07 05:32:14] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-07 05:32:14] [INFO ] Computed 22 invariants in 2 ms
[2023-04-07 05:32:14] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 05:32:14] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 05:32:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:32:14] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2023-04-07 05:32:14] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:32:14] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 05:32:14] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 05:32:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:32:14] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2023-04-07 05:32:15] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 05:32:15] [INFO ] [Nat]Added 220 Read/Feed constraints in 27 ms returned sat
[2023-04-07 05:32:15] [INFO ] Deduced a trap composed of 23 places in 209 ms of which 1 ms to minimize.
[2023-04-07 05:32:15] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 0 ms to minimize.
[2023-04-07 05:32:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 450 ms
[2023-04-07 05:32:15] [INFO ] Computed and/alt/rep : 435/1057/309 causal constraints (skipped 188 transitions) in 67 ms.
[2023-04-07 05:32:16] [INFO ] Added : 66 causal constraints over 14 iterations in 551 ms. Result :sat
Minimization took 74 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 81 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 53 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-07 05:32:16] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 05:32:16] [INFO ] Invariant cache hit.
[2023-04-07 05:32:18] [INFO ] Implicit Places using invariants in 2447 ms returned []
[2023-04-07 05:32:18] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 05:32:18] [INFO ] Invariant cache hit.
[2023-04-07 05:32:21] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 05:32:26] [INFO ] Implicit Places using invariants and state equation in 7127 ms returned []
Implicit Place search using SMT with State Equation took 9668 ms to find 0 implicit places.
[2023-04-07 05:32:26] [INFO ] Redundant transitions in 128 ms returned []
[2023-04-07 05:32:26] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 05:32:26] [INFO ] Invariant cache hit.
[2023-04-07 05:32:26] [INFO ] Dead Transitions using invariants and state equation in 707 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10601 ms. Remains : 308/308 places, 1463/1463 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-07-UpperBounds-03 in 16525 ms.
Starting property specific reduction for EisenbergMcGuire-PT-07-UpperBounds-04
Normalized transition count is 505 out of 1464 initially.
// Phase 1: matrix 505 rows 309 cols
[2023-04-07 05:32:26] [INFO ] Computed 22 invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-04-07 05:32:26] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
// Phase 1: matrix 505 rows 309 cols
[2023-04-07 05:32:26] [INFO ] Computed 22 invariants in 1 ms
[2023-04-07 05:32:27] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 05:32:27] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 05:32:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:32:27] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2023-04-07 05:32:27] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:32:27] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-04-07 05:32:27] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 05:32:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:32:27] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2023-04-07 05:32:27] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 05:32:27] [INFO ] [Nat]Added 220 Read/Feed constraints in 55 ms returned sat
[2023-04-07 05:32:27] [INFO ] Computed and/alt/rep : 436/1058/310 causal constraints (skipped 188 transitions) in 62 ms.
[2023-04-07 05:32:27] [INFO ] Added : 20 causal constraints over 4 iterations in 224 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 309 transition count 1463
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 308 transition count 1463
Applied a total of 2 rules in 57 ms. Remains 308 /309 variables (removed 1) and now considering 1463/1464 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 308/309 places, 1463/1464 transitions.
Normalized transition count is 504 out of 1463 initially.
// Phase 1: matrix 504 rows 308 cols
[2023-04-07 05:32:27] [INFO ] Computed 22 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1709 ms. (steps per millisecond=585 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 483 ms. (steps per millisecond=2070 ) properties (out of 1) seen :0
[2023-04-07 05:32:30] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-07 05:32:30] [INFO ] Computed 22 invariants in 5 ms
[2023-04-07 05:32:30] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 05:32:30] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 05:32:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:32:30] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2023-04-07 05:32:30] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:32:30] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 05:32:30] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 05:32:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:32:30] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2023-04-07 05:32:30] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 05:32:30] [INFO ] [Nat]Added 220 Read/Feed constraints in 30 ms returned sat
[2023-04-07 05:32:30] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 1 ms to minimize.
[2023-04-07 05:32:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-04-07 05:32:30] [INFO ] Computed and/alt/rep : 435/1057/309 causal constraints (skipped 188 transitions) in 59 ms.
[2023-04-07 05:32:31] [INFO ] Added : 30 causal constraints over 6 iterations in 273 ms. Result :sat
Minimization took 80 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 60 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 32 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-07 05:32:31] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 05:32:31] [INFO ] Invariant cache hit.
[2023-04-07 05:32:31] [INFO ] Implicit Places using invariants in 502 ms returned []
[2023-04-07 05:32:31] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 05:32:31] [INFO ] Invariant cache hit.
[2023-04-07 05:32:32] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 05:32:33] [INFO ] Implicit Places using invariants and state equation in 1234 ms returned []
Implicit Place search using SMT with State Equation took 1741 ms to find 0 implicit places.
[2023-04-07 05:32:33] [INFO ] Redundant transitions in 30 ms returned []
[2023-04-07 05:32:33] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 05:32:33] [INFO ] Invariant cache hit.
[2023-04-07 05:32:33] [INFO ] Dead Transitions using invariants and state equation in 675 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2506 ms. Remains : 308/308 places, 1463/1463 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-07-UpperBounds-04 in 6964 ms.
Starting property specific reduction for EisenbergMcGuire-PT-07-UpperBounds-07
Normalized transition count is 505 out of 1464 initially.
// Phase 1: matrix 505 rows 309 cols
[2023-04-07 05:32:33] [INFO ] Computed 22 invariants in 4 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-04-07 05:32:33] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
// Phase 1: matrix 505 rows 309 cols
[2023-04-07 05:32:33] [INFO ] Computed 22 invariants in 3 ms
[2023-04-07 05:32:34] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 05:32:34] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-07 05:32:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:32:34] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2023-04-07 05:32:34] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:32:34] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 05:32:34] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 7 ms returned sat
[2023-04-07 05:32:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:32:34] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2023-04-07 05:32:34] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 05:32:34] [INFO ] [Nat]Added 220 Read/Feed constraints in 37 ms returned sat
[2023-04-07 05:32:34] [INFO ] Computed and/alt/rep : 436/1058/310 causal constraints (skipped 188 transitions) in 56 ms.
[2023-04-07 05:32:35] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 1 ms to minimize.
[2023-04-07 05:32:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-04-07 05:32:35] [INFO ] Added : 69 causal constraints over 15 iterations in 692 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 34 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 309/309 places, 1464/1464 transitions.
Normalized transition count is 505 out of 1464 initially.
// Phase 1: matrix 505 rows 309 cols
[2023-04-07 05:32:35] [INFO ] Computed 22 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1784 ms. (steps per millisecond=560 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 462 ms. (steps per millisecond=2164 ) properties (out of 1) seen :0
[2023-04-07 05:32:37] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
// Phase 1: matrix 505 rows 309 cols
[2023-04-07 05:32:37] [INFO ] Computed 22 invariants in 9 ms
[2023-04-07 05:32:37] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 05:32:37] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 05:32:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:32:37] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2023-04-07 05:32:37] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:32:37] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 05:32:38] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 05:32:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:32:38] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2023-04-07 05:32:38] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 05:32:38] [INFO ] [Nat]Added 220 Read/Feed constraints in 24 ms returned sat
[2023-04-07 05:32:38] [INFO ] Computed and/alt/rep : 436/1058/310 causal constraints (skipped 188 transitions) in 42 ms.
[2023-04-07 05:32:38] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2023-04-07 05:32:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-04-07 05:32:38] [INFO ] Added : 69 causal constraints over 15 iterations in 679 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 51 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 309/309 places, 1464/1464 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 52 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
[2023-04-07 05:32:39] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 05:32:39] [INFO ] Invariant cache hit.
[2023-04-07 05:32:39] [INFO ] Implicit Places using invariants in 471 ms returned []
[2023-04-07 05:32:39] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 05:32:39] [INFO ] Invariant cache hit.
[2023-04-07 05:32:39] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 05:32:41] [INFO ] Implicit Places using invariants and state equation in 1876 ms returned []
Implicit Place search using SMT with State Equation took 2359 ms to find 0 implicit places.
[2023-04-07 05:32:41] [INFO ] Redundant transitions in 19 ms returned []
[2023-04-07 05:32:41] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 05:32:41] [INFO ] Invariant cache hit.
[2023-04-07 05:32:42] [INFO ] Dead Transitions using invariants and state equation in 525 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2992 ms. Remains : 309/309 places, 1464/1464 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-07-UpperBounds-07 in 8151 ms.
[2023-04-07 05:32:42] [INFO ] Flatten gal took : 229 ms
[2023-04-07 05:32:42] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-04-07 05:32:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 309 places, 1464 transitions and 7632 arcs took 24 ms.
Total runtime 88935 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/812/ub_0_ --maxsum=/tmp/812/ub_1_ --maxsum=/tmp/812/ub_2_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15346680 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16103256 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is EisenbergMcGuire-PT-07, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r521-tall-167987246400253"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-07.tgz
mv EisenbergMcGuire-PT-07 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;