About the Execution of LTSMin+red for RERS17pb113-PT-2
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16155.724 | 859739.00 | 969867.00 | 2032.70 | 2 2 2 ? 2 2 2 2 2 ? 2 2 2 2 2 2 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r520-tall-171662337900125.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is RERS17pb113-PT-2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337900125
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 15M May 18 16:43 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 RERS17pb113-PT-2-UpperBounds-00
FORMULA_NAME RERS17pb113-PT-2-UpperBounds-01
FORMULA_NAME RERS17pb113-PT-2-UpperBounds-02
FORMULA_NAME RERS17pb113-PT-2-UpperBounds-03
FORMULA_NAME RERS17pb113-PT-2-UpperBounds-04
FORMULA_NAME RERS17pb113-PT-2-UpperBounds-05
FORMULA_NAME RERS17pb113-PT-2-UpperBounds-06
FORMULA_NAME RERS17pb113-PT-2-UpperBounds-07
FORMULA_NAME RERS17pb113-PT-2-UpperBounds-08
FORMULA_NAME RERS17pb113-PT-2-UpperBounds-09
FORMULA_NAME RERS17pb113-PT-2-UpperBounds-10
FORMULA_NAME RERS17pb113-PT-2-UpperBounds-11
FORMULA_NAME RERS17pb113-PT-2-UpperBounds-12
FORMULA_NAME RERS17pb113-PT-2-UpperBounds-13
FORMULA_NAME RERS17pb113-PT-2-UpperBounds-14
FORMULA_NAME RERS17pb113-PT-2-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717222913169
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS17pb113-PT-2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:21:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 06:21:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:21:55] [INFO ] Load time of PNML (sax parser for PT used): 685 ms
[2024-06-01 06:21:55] [INFO ] Transformed 639 places.
[2024-06-01 06:21:55] [INFO ] Transformed 31353 transitions.
[2024-06-01 06:21:55] [INFO ] Parsed PT model containing 639 places and 31353 transitions and 125418 arcs in 946 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 06:21:55] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 639 cols
[2024-06-01 06:21:55] [INFO ] Computed 25 invariants in 97 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2]
RANDOM walk for 10000 steps (2 resets) in 430 ms. (23 steps per ms)
FORMULA RERS17pb113-PT-2-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RERS17pb113-PT-2-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RERS17pb113-PT-2-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RERS17pb113-PT-2-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RERS17pb113-PT-2-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RERS17pb113-PT-2-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RERS17pb113-PT-2-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80008 steps (16 resets) in 281 ms. (283 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[2, 2, 2, 2, 2, 2, 2, 2]
[2024-06-01 06:21:56] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2024-06-01 06:21:56] [INFO ] Invariant cache hit.
[2024-06-01 06:21:57] [INFO ] [Real]Absence check using 13 positive place invariants in 24 ms returned sat
[2024-06-01 06:21:57] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 2 ms returned sat
[2024-06-01 06:21:59] [INFO ] [Real]Absence check using state equation in 2061 ms returned sat
[2024-06-01 06:21:59] [INFO ] State equation strengthened by 829 read => feed constraints.
[2024-06-01 06:22:00] [INFO ] [Real]Added 829 Read/Feed constraints in 1125 ms returned sat
[2024-06-01 06:22:04] [INFO ] Deduced a trap composed of 49 places in 2854 ms of which 50 ms to minimize.
[2024-06-01 06:22: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 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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 06:22:04] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-06-01 06:22:04] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 4 ms returned sat
[2024-06-01 06:22:06] [INFO ] [Real]Absence check using state equation in 2076 ms returned sat
[2024-06-01 06:22:07] [INFO ] [Real]Added 829 Read/Feed constraints in 1104 ms returned sat
[2024-06-01 06:22:11] [INFO ] Deduced a trap composed of 49 places in 2897 ms of which 4 ms to minimize.
[2024-06-01 06:22:11] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 06:22:11] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-06-01 06:22:11] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 2 ms returned sat
[2024-06-01 06:22:13] [INFO ] [Real]Absence check using state equation in 2005 ms returned sat
[2024-06-01 06:22:14] [INFO ] [Real]Added 829 Read/Feed constraints in 1117 ms returned sat
[2024-06-01 06:22:17] [INFO ] Deduced a trap composed of 97 places in 2517 ms of which 10 ms to minimize.
[2024-06-01 06:22:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 06:22:17] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-06-01 06:22:17] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 2 ms returned sat
[2024-06-01 06:22:19] [INFO ] [Real]Absence check using state equation in 2002 ms returned sat
[2024-06-01 06:22:21] [INFO ] [Real]Added 829 Read/Feed constraints in 1115 ms returned sat
[2024-06-01 06:22:23] [INFO ] Deduced a trap composed of 65 places in 2458 ms of which 3 ms to minimize.
[2024-06-01 06:22:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 06:22:24] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-06-01 06:22:24] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 2 ms returned sat
[2024-06-01 06:22:26] [INFO ] [Real]Absence check using state equation in 2068 ms returned sat
[2024-06-01 06:22:27] [INFO ] [Real]Added 829 Read/Feed constraints in 1040 ms returned sat
[2024-06-01 06:22:30] [INFO ] Deduced a trap composed of 97 places in 2240 ms of which 4 ms to minimize.
[2024-06-01 06:22: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 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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 06:22:30] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-06-01 06:22:30] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 2 ms returned sat
[2024-06-01 06:22:32] [INFO ] [Real]Absence check using state equation in 1933 ms returned sat
[2024-06-01 06:22:33] [INFO ] [Real]Added 829 Read/Feed constraints in 1055 ms returned sat
[2024-06-01 06:22:36] [INFO ] Deduced a trap composed of 41 places in 3022 ms of which 4 ms to minimize.
[2024-06-01 06:22:36] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 06:22:36] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-06-01 06:22:36] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 2 ms returned sat
[2024-06-01 06:22:38] [INFO ] [Real]Absence check using state equation in 1920 ms returned sat
[2024-06-01 06:22:40] [INFO ] [Real]Added 829 Read/Feed constraints in 1055 ms returned sat
[2024-06-01 06:22:43] [INFO ] Deduced a trap composed of 89 places in 2485 ms of which 4 ms to minimize.
[2024-06-01 06:22:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 06:22:43] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-06-01 06:22:43] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 2 ms returned sat
[2024-06-01 06:22:45] [INFO ] [Real]Absence check using state equation in 2034 ms returned sat
[2024-06-01 06:22:46] [INFO ] [Real]Added 829 Read/Feed constraints in 1042 ms returned sat
[2024-06-01 06:22:49] [INFO ] Deduced a trap composed of 57 places in 2199 ms of which 4 ms to minimize.
[2024-06-01 06:22: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 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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[2, 2, 2, 2, 2, 2, 2, 2]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[2, 2, 2, 2, 2, 2, 2, 2]
Support contains 8 out of 639 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 31353/31353 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 627 transition count 31353
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 626 transition count 31352
Applied a total of 13 rules in 705 ms. Remains 626 /639 variables (removed 13) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 727 ms. Remains : 626/639 places, 31352/31353 transitions.
[2024-06-01 06:22:49] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2024-06-01 06:22:49] [INFO ] Computed 13 invariants in 87 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[2, 2, 2, 2, 2, 2, 2, 2]
RANDOM walk for 1000000 steps (2 resets) in 29551 ms. (33 steps per ms)
FORMULA RERS17pb113-PT-2-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 7000004 steps (14 resets) in 16892 ms. (414 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1] Max Struct:[2, 2, 2, 2, 2, 2, 2]
[2024-06-01 06:23:36] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-06-01 06:23:36] [INFO ] Invariant cache hit.
[2024-06-01 06:23:36] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-06-01 06:23:45] [INFO ] [Real]Absence check using state equation in 9174 ms returned sat
[2024-06-01 06:23:46] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-06-01 06:23:51] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 06:23:55] [INFO ] [Real]Added 268 Read/Feed constraints in 9558 ms returned unknown
[2024-06-01 06:23:56] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-06-01 06:24:28] [INFO ] [Real]Absence check using state equation in 32012 ms returned sat
[2024-06-01 06:24:33] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 06:24:37] [INFO ] [Real]Added 268 Read/Feed constraints in 9257 ms returned sat
[2024-06-01 06:24:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:24:38] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-06-01 06:25:03] [INFO ] [Nat]Absence check using state equation in 25854 ms returned sat
[2024-06-01 06:25:09] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 06:25:13] [INFO ] [Nat]Added 268 Read/Feed constraints in 9562 ms returned unknown
[2024-06-01 06:25:13] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-06-01 06:25:27] [INFO ] [Real]Absence check using state equation in 13728 ms returned sat
[2024-06-01 06:25:32] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 06:25:37] [INFO ] [Real]Added 268 Read/Feed constraints in 9768 ms returned unknown
[2024-06-01 06:25:37] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-06-01 06:25:51] [INFO ] [Real]Absence check using state equation in 13662 ms returned sat
[2024-06-01 06:25:56] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 06:26:01] [INFO ] [Real]Added 268 Read/Feed constraints in 9506 ms returned unknown
[2024-06-01 06:26:01] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-06-01 06:26:46] [INFO ] [Real]Absence check using state equation in 44932 ms returned unknown
[2024-06-01 06:26:46] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-06-01 06:27:31] [INFO ] [Real]Absence check using state equation in 44952 ms returned unknown
[2024-06-01 06:27:31] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-06-01 06:27:44] [INFO ] [Real]Absence check using state equation in 13160 ms returned sat
[2024-06-01 06:27:49] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 06:27:54] [INFO ] [Real]Added 268 Read/Feed constraints in 9451 ms returned sat
[2024-06-01 06:27:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:27:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-06-01 06:28:07] [INFO ] [Nat]Absence check using state equation in 13354 ms returned sat
[2024-06-01 06:28:12] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 06:28:17] [INFO ] [Nat]Added 268 Read/Feed constraints in 9491 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1] Max Struct:[2, 2, 2, 2, 2, 2, 2]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1] Max Struct:[2, 2, 2, 2, 2, 2, 2]
Support contains 7 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 259 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 259 ms. Remains : 626/626 places, 31352/31352 transitions.
[2024-06-01 06:28:18] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-06-01 06:28:18] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1] Max Struct:[2, 2, 2, 2, 2, 2, 2]
RANDOM walk for 1000000 steps (2 resets) in 29260 ms. (34 steps per ms)
BEST_FIRST walk for 7000006 steps (14 resets) in 21411 ms. (326 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1] Max Struct:[2, 2, 2, 2, 2, 2, 2]
[2024-06-01 06:29:09] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-06-01 06:29:09] [INFO ] Invariant cache hit.
[2024-06-01 06:29:09] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-06-01 06:29:18] [INFO ] [Real]Absence check using state equation in 9203 ms returned sat
[2024-06-01 06:29:18] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-06-01 06:29:23] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 06:29:28] [INFO ] [Real]Added 268 Read/Feed constraints in 9481 ms returned unknown
[2024-06-01 06:29:28] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-06-01 06:29:52] [INFO ] [Real]Absence check using state equation in 24083 ms returned sat
[2024-06-01 06:29:57] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 06:30:02] [INFO ] [Real]Added 268 Read/Feed constraints in 9392 ms returned unknown
[2024-06-01 06:30:02] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-06-01 06:30:16] [INFO ] [Real]Absence check using state equation in 13679 ms returned sat
[2024-06-01 06:30:21] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 06:30:25] [INFO ] [Real]Added 268 Read/Feed constraints in 9522 ms returned unknown
[2024-06-01 06:30:26] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-06-01 06:30:40] [INFO ] [Real]Absence check using state equation in 14751 ms returned sat
[2024-06-01 06:30:46] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 06:30:50] [INFO ] [Real]Added 268 Read/Feed constraints in 9679 ms returned unknown
[2024-06-01 06:30:50] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-06-01 06:31:35] [INFO ] [Real]Absence check using state equation in 44951 ms returned unknown
[2024-06-01 06:31:35] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-06-01 06:32:20] [INFO ] [Real]Absence check using state equation in 44948 ms returned unknown
[2024-06-01 06:32:21] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-06-01 06:32:34] [INFO ] [Real]Absence check using state equation in 13067 ms returned sat
[2024-06-01 06:32:39] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 06:32:43] [INFO ] [Real]Added 268 Read/Feed constraints in 9483 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1] Max Struct:[2, 2, 2, 2, 2, 2, 2]
FORMULA RERS17pb113-PT-2-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA RERS17pb113-PT-2-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA RERS17pb113-PT-2-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA RERS17pb113-PT-2-UpperBounds-10 2 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA RERS17pb113-PT-2-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA RERS17pb113-PT-2-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1] Max Struct:[2, 2]
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 244 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 259 ms. Remains : 626/626 places, 31352/31352 transitions.
[2024-06-01 06:32:46] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-06-01 06:32:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1] Max Struct:[2, 2]
RANDOM walk for 854534 steps (2 resets) in 30001 ms. (28 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 4664 ms. (428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1] Max Struct:[2, 2]
[2024-06-01 06:33:21] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-06-01 06:33:21] [INFO ] Invariant cache hit.
[2024-06-01 06:33:21] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-06-01 06:33:35] [INFO ] [Real]Absence check using state equation in 13984 ms returned sat
[2024-06-01 06:33:35] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-06-01 06:33:40] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 06:33:45] [INFO ] [Real]Added 268 Read/Feed constraints in 9601 ms returned unknown
[2024-06-01 06:33:45] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-06-01 06:33:59] [INFO ] [Real]Absence check using state equation in 13526 ms returned sat
[2024-06-01 06:34:04] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 06:34:08] [INFO ] [Real]Added 268 Read/Feed constraints in 9550 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1] Max Struct:[2, 2]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1] Max Struct:[2, 2]
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 204 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 189 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2024-06-01 06:34:09] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-06-01 06:34:09] [INFO ] Invariant cache hit.
[2024-06-01 06:34:11] [INFO ] Implicit Places using invariants in 2123 ms returned []
Implicit Place search using SMT only with invariants took 2125 ms to find 0 implicit places.
Running 31351 sub problems to find dead transitions.
[2024-06-01 06:34:11] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-06-01 06:34:12] [INFO ] Invariant cache hit.
[2024-06-01 06:34:12] [INFO ] State equation strengthened by 268 read => feed constraints.
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : RERS17pb113-PT-2-UpperBounds-00
Could not compute solution for formula : RERS17pb113-PT-2-UpperBounds-01
Could not compute solution for formula : RERS17pb113-PT-2-UpperBounds-02
Could not compute solution for formula : RERS17pb113-PT-2-UpperBounds-03
Could not compute solution for formula : RERS17pb113-PT-2-UpperBounds-04
Could not compute solution for formula : RERS17pb113-PT-2-UpperBounds-05
Could not compute solution for formula : RERS17pb113-PT-2-UpperBounds-06
Could not compute solution for formula : RERS17pb113-PT-2-UpperBounds-07
Could not compute solution for formula : RERS17pb113-PT-2-UpperBounds-08
Could not compute solution for formula : RERS17pb113-PT-2-UpperBounds-09
Could not compute solution for formula : RERS17pb113-PT-2-UpperBounds-10
Could not compute solution for formula : RERS17pb113-PT-2-UpperBounds-11
Could not compute solution for formula : RERS17pb113-PT-2-UpperBounds-12
Could not compute solution for formula : RERS17pb113-PT-2-UpperBounds-13
Could not compute solution for formula : RERS17pb113-PT-2-UpperBounds-14
Could not compute solution for formula : RERS17pb113-PT-2-UpperBounds-15
BK_STOP 1717223772908
--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name RERS17pb113-PT-2-UpperBounds-00
ub formula formula --maxsum=/tmp/629/ub_0_
ub formula name RERS17pb113-PT-2-UpperBounds-01
ub formula formula --maxsum=/tmp/629/ub_1_
ub formula name RERS17pb113-PT-2-UpperBounds-02
ub formula formula --maxsum=/tmp/629/ub_2_
ub formula name RERS17pb113-PT-2-UpperBounds-03
ub formula formula --maxsum=/tmp/629/ub_3_
ub formula name RERS17pb113-PT-2-UpperBounds-04
ub formula formula --maxsum=/tmp/629/ub_4_
ub formula name RERS17pb113-PT-2-UpperBounds-05
ub formula formula --maxsum=/tmp/629/ub_5_
ub formula name RERS17pb113-PT-2-UpperBounds-06
ub formula formula --maxsum=/tmp/629/ub_6_
ub formula name RERS17pb113-PT-2-UpperBounds-07
ub formula formula --maxsum=/tmp/629/ub_7_
ub formula name RERS17pb113-PT-2-UpperBounds-08
ub formula formula --maxsum=/tmp/629/ub_8_
ub formula name RERS17pb113-PT-2-UpperBounds-09
ub formula formula --maxsum=/tmp/629/ub_9_
ub formula name RERS17pb113-PT-2-UpperBounds-10
ub formula formula --maxsum=/tmp/629/ub_10_
ub formula name RERS17pb113-PT-2-UpperBounds-11
ub formula formula --maxsum=/tmp/629/ub_11_
ub formula name RERS17pb113-PT-2-UpperBounds-12
ub formula formula --maxsum=/tmp/629/ub_12_
ub formula name RERS17pb113-PT-2-UpperBounds-13
ub formula formula --maxsum=/tmp/629/ub_13_
ub formula name RERS17pb113-PT-2-UpperBounds-14
ub formula formula --maxsum=/tmp/629/ub_14_
ub formula name RERS17pb113-PT-2-UpperBounds-15
ub formula formula --maxsum=/tmp/629/ub_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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="RERS17pb113-PT-2"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is RERS17pb113-PT-2, 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 r520-tall-171662337900125"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RERS17pb113-PT-2.tgz
mv RERS17pb113-PT-2 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 '
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 ;