fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r520-tall-171662338400349
Last Updated
July 7, 2024

About the Execution of LTSMin+red for RERS2020-PT-pb103

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16193.871 473960.00 563100.00 1723.50 ? 1 1 1 1 ? ? 1 1 1 1 1 1 1 1 ? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r520-tall-171662338400349.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 RERS2020-PT-pb103, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662338400349
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 18M 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 RERS2020-PT-pb103-UpperBounds-00
FORMULA_NAME RERS2020-PT-pb103-UpperBounds-01
FORMULA_NAME RERS2020-PT-pb103-UpperBounds-02
FORMULA_NAME RERS2020-PT-pb103-UpperBounds-03
FORMULA_NAME RERS2020-PT-pb103-UpperBounds-04
FORMULA_NAME RERS2020-PT-pb103-UpperBounds-05
FORMULA_NAME RERS2020-PT-pb103-UpperBounds-06
FORMULA_NAME RERS2020-PT-pb103-UpperBounds-07
FORMULA_NAME RERS2020-PT-pb103-UpperBounds-08
FORMULA_NAME RERS2020-PT-pb103-UpperBounds-09
FORMULA_NAME RERS2020-PT-pb103-UpperBounds-10
FORMULA_NAME RERS2020-PT-pb103-UpperBounds-11
FORMULA_NAME RERS2020-PT-pb103-UpperBounds-12
FORMULA_NAME RERS2020-PT-pb103-UpperBounds-13
FORMULA_NAME RERS2020-PT-pb103-UpperBounds-14
FORMULA_NAME RERS2020-PT-pb103-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717253604173

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS2020-PT-pb103
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:53:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 14:53:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:53:26] [INFO ] Load time of PNML (sax parser for PT used): 786 ms
[2024-06-01 14:53:26] [INFO ] Transformed 520 places.
[2024-06-01 14:53:26] [INFO ] Transformed 31658 transitions.
[2024-06-01 14:53:26] [INFO ] Found NUPN structural information;
[2024-06-01 14:53:26] [INFO ] Parsed PT model containing 520 places and 31658 transitions and 125892 arcs in 1034 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Ensure Unique test removed 3229 transitions
Reduce redundant transitions removed 3229 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA RERS2020-PT-pb103-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
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:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-01 14:53:26] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 520 cols
[2024-06-01 14:53:26] [INFO ] Computed 15 invariants in 152 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:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 453 ms. (22 steps per ms)
FORMULA RERS2020-PT-pb103-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RERS2020-PT-pb103-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RERS2020-PT-pb103-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RERS2020-PT-pb103-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RERS2020-PT-pb103-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RERS2020-PT-pb103-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RERS2020-PT-pb103-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RERS2020-PT-pb103-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RERS2020-PT-pb103-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RERS2020-PT-pb103-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (10 resets) in 183 ms. (271 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2024-06-01 14:53:27] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-06-01 14:53:27] [INFO ] Invariant cache hit.
[2024-06-01 14:53:27] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-06-01 14:53:27] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-01 14:53:30] [INFO ] [Real]Absence check using state equation in 2140 ms returned sat
[2024-06-01 14:53:30] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2024-06-01 14:53:31] [INFO ] [Real]Added 1379 Read/Feed constraints in 1003 ms returned sat
[2024-06-01 14:53:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:53:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-06-01 14:53:32] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 3 ms returned sat
[2024-06-01 14:53:34] [INFO ] [Nat]Absence check using state equation in 2277 ms returned sat
[2024-06-01 14:53:35] [INFO ] [Nat]Added 1379 Read/Feed constraints in 1017 ms returned sat
[2024-06-01 14:53:37] [INFO ] Deduced a trap composed of 102 places in 1396 ms of which 23 ms to minimize.
[2024-06-01 14:53:37] [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:2251)
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 14:53:37] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-01 14:53:37] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-01 14:53:39] [INFO ] [Real]Absence check using state equation in 2224 ms returned sat
[2024-06-01 14:53:40] [INFO ] [Real]Added 1379 Read/Feed constraints in 1021 ms returned sat
[2024-06-01 14:53:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:53:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-01 14:53:41] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-01 14:53:43] [INFO ] [Nat]Absence check using state equation in 2208 ms returned sat
[2024-06-01 14:53:44] [INFO ] [Nat]Added 1379 Read/Feed constraints in 978 ms returned sat
[2024-06-01 14:53:46] [INFO ] Deduced a trap composed of 102 places in 2328 ms of which 4 ms to minimize.
[2024-06-01 14:53: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 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:2251)
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 14:53:47] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-01 14:53:47] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-01 14:53:49] [INFO ] [Real]Absence check using state equation in 2179 ms returned sat
[2024-06-01 14:53:50] [INFO ] [Real]Added 1379 Read/Feed constraints in 979 ms returned sat
[2024-06-01 14:53:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:53:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-01 14:53:50] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2024-06-01 14:53:52] [INFO ] [Nat]Absence check using state equation in 2003 ms returned sat
[2024-06-01 14:53:53] [INFO ] [Nat]Added 1379 Read/Feed constraints in 955 ms returned sat
[2024-06-01 14:53:56] [INFO ] Deduced a trap composed of 12 places in 2128 ms of which 4 ms to minimize.
[2024-06-01 14:53:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:2251)
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 14:53:56] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2024-06-01 14:53:56] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2024-06-01 14:53:58] [INFO ] [Real]Absence check using state equation in 1992 ms returned sat
[2024-06-01 14:53:59] [INFO ] [Real]Added 1379 Read/Feed constraints in 978 ms returned sat
[2024-06-01 14:53:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:53:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2024-06-01 14:53:59] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 3 ms returned sat
[2024-06-01 14:54:01] [INFO ] [Nat]Absence check using state equation in 2101 ms returned sat
[2024-06-01 14:54:02] [INFO ] [Nat]Added 1379 Read/Feed constraints in 1007 ms returned sat
[2024-06-01 14:54:05] [INFO ] Deduced a trap composed of 102 places in 2147 ms of which 4 ms to minimize.
[2024-06-01 14:54:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:2251)
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 14:54:05] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-01 14:54:05] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2024-06-01 14:54:07] [INFO ] [Real]Absence check using state equation in 2213 ms returned sat
[2024-06-01 14:54:08] [INFO ] [Real]Added 1379 Read/Feed constraints in 1019 ms returned sat
[2024-06-01 14:54:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:54:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-01 14:54:09] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2024-06-01 14:54:11] [INFO ] [Nat]Absence check using state equation in 2001 ms returned sat
[2024-06-01 14:54:12] [INFO ] [Nat]Added 1379 Read/Feed constraints in 986 ms returned sat
[2024-06-01 14:54:14] [INFO ] Deduced a trap composed of 50 places in 2078 ms of which 3 ms to minimize.
[2024-06-01 14:54:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:2251)
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:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 520 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 520/520 places, 28429/28429 transitions.
Ensure Unique test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1069 rules applied. Total rules applied 1069 place count 513 transition count 27367
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1071 place count 512 transition count 27366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 28 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1073 place count 511 transition count 27377
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1085 place count 511 transition count 27365
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1185 place count 499 transition count 27277
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1186 place count 499 transition count 27457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1187 place count 498 transition count 27457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1188 place count 497 transition count 27456
Applied a total of 1188 rules in 1000 ms. Remains 497 /520 variables (removed 23) and now considering 27456/28429 (removed 973) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1016 ms. Remains : 497/520 places, 27456/28429 transitions.
[2024-06-01 14:54:15] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2024-06-01 14:54:15] [INFO ] Computed 8 invariants in 94 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (3 resets) in 20361 ms. (49 steps per ms)
FORMULA RERS2020-PT-pb103-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000003 steps (8 resets) in 10285 ms. (388 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-06-01 14:54:46] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2024-06-01 14:54:46] [INFO ] Invariant cache hit.
[2024-06-01 14:54:46] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-01 14:54:53] [INFO ] [Real]Absence check using state equation in 7117 ms returned sat
[2024-06-01 14:54:54] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2024-06-01 14:54:55] [INFO ] [Real]Added 1374 Read/Feed constraints in 1232 ms returned sat
[2024-06-01 14:54:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:54:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-01 14:55:02] [INFO ] [Nat]Absence check using state equation in 7073 ms returned sat
[2024-06-01 14:55:08] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 14:55:11] [INFO ] [Nat]Added 1374 Read/Feed constraints in 8522 ms returned sat
[2024-06-01 14:55:13] [INFO ] Deduced a trap composed of 49 places in 2134 ms of which 3 ms to minimize.
[2024-06-01 14:55:15] [INFO ] Deduced a trap composed of 43 places in 1592 ms of which 3 ms to minimize.
[2024-06-01 14:55:17] [INFO ] Deduced a trap composed of 19 places in 1598 ms of which 3 ms to minimize.
[2024-06-01 14:55:20] [INFO ] Deduced a trap composed of 47 places in 1941 ms of which 3 ms to minimize.
[2024-06-01 14:55:23] [INFO ] Deduced a trap composed of 51 places in 1865 ms of which 3 ms to minimize.
[2024-06-01 14:55:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 12604 ms
[2024-06-01 14:55:26] [INFO ] Computed and/alt/rep : 109/757/109 causal constraints (skipped 18615 transitions) in 3001 ms.
[2024-06-01 14:55:28] [INFO ] Added : 0 causal constraints over 0 iterations in 4106 ms. Result :sat
Minimization took 5375 ms.
[2024-06-01 14:55:33] [INFO ] [Real]Absence check using 8 positive place invariants in 18 ms returned sat
[2024-06-01 14:55:38] [INFO ] [Real]Absence check using state equation in 4553 ms returned sat
[2024-06-01 14:55:39] [INFO ] [Real]Added 1374 Read/Feed constraints in 1477 ms returned sat
[2024-06-01 14:55:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:55:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-01 14:55:45] [INFO ] [Nat]Absence check using state equation in 4857 ms returned sat
[2024-06-01 14:55:50] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 14:55:55] [INFO ] [Nat]Added 1374 Read/Feed constraints in 9842 ms returned unknown
[2024-06-01 14:55:55] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-01 14:56:00] [INFO ] [Real]Absence check using state equation in 5370 ms returned sat
[2024-06-01 14:56:02] [INFO ] [Real]Added 1374 Read/Feed constraints in 1666 ms returned sat
[2024-06-01 14:56:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:56:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-01 14:56:07] [INFO ] [Nat]Absence check using state equation in 4850 ms returned sat
[2024-06-01 14:56:13] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 14:56:16] [INFO ] [Nat]Added 1374 Read/Feed constraints in 8757 ms returned sat
[2024-06-01 14:56:19] [INFO ] Deduced a trap composed of 194 places in 2431 ms of which 4 ms to minimize.
[2024-06-01 14:56:22] [INFO ] Deduced a trap composed of 19 places in 2368 ms of which 3 ms to minimize.
[2024-06-01 14:56:26] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 9942 ms
[2024-06-01 14:56:26] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-06-01 14:56:31] [INFO ] [Real]Absence check using state equation in 4879 ms returned sat
[2024-06-01 14:56:34] [INFO ] [Real]Added 1374 Read/Feed constraints in 2993 ms returned sat
[2024-06-01 14:56:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:56:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-01 14:56:40] [INFO ] [Nat]Absence check using state equation in 4943 ms returned sat
[2024-06-01 14:56:45] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 14:56:50] [INFO ] [Nat]Added 1374 Read/Feed constraints in 9845 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 114 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 497/497 places, 27456/27456 transitions.
[2024-06-01 14:56:50] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2024-06-01 14:56:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 22487 ms. (44 steps per ms)
BEST_FIRST walk for 4000003 steps (8 resets) in 11996 ms. (333 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-06-01 14:57:24] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2024-06-01 14:57:24] [INFO ] Invariant cache hit.
[2024-06-01 14:57:24] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-06-01 14:57:31] [INFO ] [Real]Absence check using state equation in 7029 ms returned sat
[2024-06-01 14:57:32] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2024-06-01 14:57:33] [INFO ] [Real]Added 1374 Read/Feed constraints in 1200 ms returned sat
[2024-06-01 14:57:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:57:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-01 14:57:40] [INFO ] [Nat]Absence check using state equation in 6927 ms returned sat
[2024-06-01 14:57:46] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 14:57:49] [INFO ] [Nat]Added 1374 Read/Feed constraints in 8341 ms returned sat
[2024-06-01 14:57:51] [INFO ] Deduced a trap composed of 49 places in 2146 ms of which 3 ms to minimize.
[2024-06-01 14:57:55] [INFO ] Deduced a trap composed of 39 places in 2108 ms of which 3 ms to minimize.
[2024-06-01 14:57:57] [INFO ] Deduced a trap composed of 51 places in 2001 ms of which 3 ms to minimize.
[2024-06-01 14:58:01] [INFO ] Deduced a trap composed of 19 places in 1680 ms of which 2 ms to minimize.
[2024-06-01 14:58:03] [INFO ] Deduced a trap composed of 185 places in 1591 ms of which 4 ms to minimize.
[2024-06-01 14:58:06] [INFO ] Deduced a trap composed of 147 places in 1669 ms of which 3 ms to minimize.
[2024-06-01 14:58:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 17975 ms
[2024-06-01 14:58:09] [INFO ] Computed and/alt/rep : 109/757/109 causal constraints (skipped 18615 transitions) in 2432 ms.
[2024-06-01 14:58:10] [INFO ] Added : 0 causal constraints over 0 iterations in 3391 ms. Result :sat
Minimization took 5837 ms.
[2024-06-01 14:58:16] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-01 14:58:21] [INFO ] [Real]Absence check using state equation in 4401 ms returned sat
[2024-06-01 14:58:22] [INFO ] [Real]Added 1374 Read/Feed constraints in 1493 ms returned sat
[2024-06-01 14:58:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:58:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-01 14:58:27] [INFO ] [Nat]Absence check using state equation in 4369 ms returned sat
[2024-06-01 14:58:33] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 14:58:37] [INFO ] [Nat]Added 1374 Read/Feed constraints in 9843 ms returned unknown
[2024-06-01 14:58:37] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-01 14:58:43] [INFO ] [Real]Absence check using state equation in 5729 ms returned sat
[2024-06-01 14:58:45] [INFO ] [Real]Added 1374 Read/Feed constraints in 1950 ms returned sat
[2024-06-01 14:58:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:58:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-01 14:58:51] [INFO ] [Nat]Absence check using state equation in 4820 ms returned sat
[2024-06-01 14:58:56] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 14:58:58] [INFO ] [Nat]Added 1374 Read/Feed constraints in 7245 ms returned sat
[2024-06-01 14:59:00] [INFO ] Deduced a trap composed of 194 places in 2257 ms of which 3 ms to minimize.
[2024-06-01 14:59:04] [INFO ] Deduced a trap composed of 19 places in 2252 ms of which 4 ms to minimize.
[2024-06-01 14:59:08] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 10475 ms
[2024-06-01 14:59:08] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-01 14:59:13] [INFO ] [Real]Absence check using state equation in 5101 ms returned sat
[2024-06-01 14:59:17] [INFO ] [Real]Added 1374 Read/Feed constraints in 3173 ms returned sat
[2024-06-01 14:59:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:59:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-01 14:59:22] [INFO ] [Nat]Absence check using state equation in 4888 ms returned sat
[2024-06-01 14:59:28] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 14:59:32] [INFO ] [Nat]Added 1374 Read/Feed constraints in 9861 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 126 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 124 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2024-06-01 14:59:32] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2024-06-01 14:59:33] [INFO ] Invariant cache hit.
[2024-06-01 14:59:34] [INFO ] Implicit Places using invariants in 1057 ms returned []
Implicit Place search using SMT only with invariants took 1058 ms to find 0 implicit places.
Running 27453 sub problems to find dead transitions.
[2024-06-01 14:59:34] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2024-06-01 14:59:34] [INFO ] Invariant cache hit.
[2024-06-01 14:59:34] [INFO ] State equation strengthened by 1374 read => feed constraints.
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : RERS2020-PT-pb103-UpperBounds-00
Could not compute solution for formula : RERS2020-PT-pb103-UpperBounds-01
Could not compute solution for formula : RERS2020-PT-pb103-UpperBounds-02
Could not compute solution for formula : RERS2020-PT-pb103-UpperBounds-03
Could not compute solution for formula : RERS2020-PT-pb103-UpperBounds-04
Could not compute solution for formula : RERS2020-PT-pb103-UpperBounds-05
Could not compute solution for formula : RERS2020-PT-pb103-UpperBounds-06
Could not compute solution for formula : RERS2020-PT-pb103-UpperBounds-07
Could not compute solution for formula : RERS2020-PT-pb103-UpperBounds-08
Could not compute solution for formula : RERS2020-PT-pb103-UpperBounds-09
Could not compute solution for formula : RERS2020-PT-pb103-UpperBounds-10
Could not compute solution for formula : RERS2020-PT-pb103-UpperBounds-11
Could not compute solution for formula : RERS2020-PT-pb103-UpperBounds-12
Could not compute solution for formula : RERS2020-PT-pb103-UpperBounds-13
Could not compute solution for formula : RERS2020-PT-pb103-UpperBounds-14
Could not compute solution for formula : RERS2020-PT-pb103-UpperBounds-15

BK_STOP 1717254078133

--------------------
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 RERS2020-PT-pb103-UpperBounds-00
ub formula formula --maxsum=/tmp/656/ub_0_
ub formula name RERS2020-PT-pb103-UpperBounds-01
ub formula formula --maxsum=/tmp/656/ub_1_
ub formula name RERS2020-PT-pb103-UpperBounds-02
ub formula formula --maxsum=/tmp/656/ub_2_
ub formula name RERS2020-PT-pb103-UpperBounds-03
ub formula formula --maxsum=/tmp/656/ub_3_
ub formula name RERS2020-PT-pb103-UpperBounds-04
ub formula formula --maxsum=/tmp/656/ub_4_
ub formula name RERS2020-PT-pb103-UpperBounds-05
ub formula formula --maxsum=/tmp/656/ub_5_
ub formula name RERS2020-PT-pb103-UpperBounds-06
ub formula formula --maxsum=/tmp/656/ub_6_
ub formula name RERS2020-PT-pb103-UpperBounds-07
ub formula formula --maxsum=/tmp/656/ub_7_
ub formula name RERS2020-PT-pb103-UpperBounds-08
ub formula formula --maxsum=/tmp/656/ub_8_
ub formula name RERS2020-PT-pb103-UpperBounds-09
ub formula formula --maxsum=/tmp/656/ub_9_
ub formula name RERS2020-PT-pb103-UpperBounds-10
ub formula formula --maxsum=/tmp/656/ub_10_
ub formula name RERS2020-PT-pb103-UpperBounds-11
ub formula formula --maxsum=/tmp/656/ub_11_
ub formula name RERS2020-PT-pb103-UpperBounds-12
ub formula formula --maxsum=/tmp/656/ub_12_
ub formula name RERS2020-PT-pb103-UpperBounds-13
ub formula formula --maxsum=/tmp/656/ub_13_
ub formula name RERS2020-PT-pb103-UpperBounds-14
ub formula formula --maxsum=/tmp/656/ub_14_
ub formula name RERS2020-PT-pb103-UpperBounds-15
ub formula formula --maxsum=/tmp/656/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="RERS2020-PT-pb103"
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 RERS2020-PT-pb103, 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-171662338400349"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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