About the Execution of ITS-Tools for RERS2020-PT-pb103
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 273571.00 | 0.00 | 0.00 | ? 1 1 1 1 ? ? 1 1 1 1 1 1 1 1 ? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r312-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 itstools
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 r312-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 1716691372886
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS2020-PT-pb103
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-26 02:42:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 02:42:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 02:42:54] [INFO ] Load time of PNML (sax parser for PT used): 799 ms
[2024-05-26 02:42:54] [INFO ] Transformed 520 places.
[2024-05-26 02:42:55] [INFO ] Transformed 31658 transitions.
[2024-05-26 02:42:55] [INFO ] Found NUPN structural information;
[2024-05-26 02:42:55] [INFO ] Parsed PT model containing 520 places and 31658 transitions and 125892 arcs in 1137 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 77 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-05-26 02:42:55] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 520 cols
[2024-05-26 02:42:55] [INFO ] Computed 15 invariants in 138 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 392 ms. (25 steps per ms)
FORMULA RERS2020-PT-pb103-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RERS2020-PT-pb103-UpperBounds-13 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-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RERS2020-PT-pb103-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RERS2020-PT-pb103-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RERS2020-PT-pb103-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RERS2020-PT-pb103-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RERS2020-PT-pb103-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-05-26 02:42:56] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-26 02:42:56] [INFO ] Invariant cache hit.
[2024-05-26 02:42:56] [INFO ] [Real]Absence check using 8 positive place invariants in 16 ms returned sat
[2024-05-26 02:42:56] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-26 02:42:58] [INFO ] [Real]Absence check using state equation in 2097 ms returned sat
[2024-05-26 02:42:59] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2024-05-26 02:43:00] [INFO ] [Real]Added 1379 Read/Feed constraints in 966 ms returned sat
[2024-05-26 02:43:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 02:43:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-05-26 02:43:00] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-26 02:43:02] [INFO ] [Nat]Absence check using state equation in 2063 ms returned sat
[2024-05-26 02:43:03] [INFO ] [Nat]Added 1379 Read/Feed constraints in 951 ms returned sat
[2024-05-26 02:43:05] [INFO ] Deduced a trap composed of 102 places in 1335 ms of which 23 ms to minimize.
[2024-05-26 02:43:07] [INFO ] Deduced a trap composed of 67 places in 1712 ms of which 4 ms to minimize.
[2024-05-26 02:43:07] [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-05-26 02:43:07] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-05-26 02:43:07] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-26 02:43:09] [INFO ] [Real]Absence check using state equation in 2099 ms returned sat
[2024-05-26 02:43:10] [INFO ] [Real]Added 1379 Read/Feed constraints in 939 ms returned sat
[2024-05-26 02:43:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 02:43:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-05-26 02:43:10] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-26 02:43:12] [INFO ] [Nat]Absence check using state equation in 1943 ms returned sat
[2024-05-26 02:43:13] [INFO ] [Nat]Added 1379 Read/Feed constraints in 1023 ms returned sat
[2024-05-26 02:43:16] [INFO ] Deduced a trap composed of 102 places in 2355 ms of which 5 ms to minimize.
[2024-05-26 02:43:16] [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-05-26 02:43:16] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-05-26 02:43:16] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-26 02:43:18] [INFO ] [Real]Absence check using state equation in 1923 ms returned sat
[2024-05-26 02:43:19] [INFO ] [Real]Added 1379 Read/Feed constraints in 1114 ms returned sat
[2024-05-26 02:43:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 02:43:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2024-05-26 02:43:20] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-26 02:43:22] [INFO ] [Nat]Absence check using state equation in 1935 ms returned sat
[2024-05-26 02:43:22] [INFO ] [Nat]Added 1379 Read/Feed constraints in 863 ms returned sat
[2024-05-26 02:43:25] [INFO ] Deduced a trap composed of 12 places in 2045 ms of which 6 ms to minimize.
[2024-05-26 02:43:25] [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-05-26 02:43:25] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-05-26 02:43:25] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-26 02:43:27] [INFO ] [Real]Absence check using state equation in 1913 ms returned sat
[2024-05-26 02:43:28] [INFO ] [Real]Added 1379 Read/Feed constraints in 934 ms returned sat
[2024-05-26 02:43:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 02:43:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 16 ms returned sat
[2024-05-26 02:43:28] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-26 02:43:30] [INFO ] [Nat]Absence check using state equation in 1916 ms returned sat
[2024-05-26 02:43:31] [INFO ] [Nat]Added 1379 Read/Feed constraints in 938 ms returned sat
[2024-05-26 02:43:33] [INFO ] Deduced a trap composed of 50 places in 1856 ms of which 3 ms to minimize.
[2024-05-26 02:43:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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)
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 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 30 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 30 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 994 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 1024 ms. Remains : 497/520 places, 27456/28429 transitions.
[2024-05-26 02:43:34] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2024-05-26 02:43:34] [INFO ] Computed 8 invariants in 78 ms
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 20198 ms. (49 steps per ms)
BEST_FIRST walk for 4000003 steps (8 resets) in 10553 ms. (379 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-05-26 02:44:05] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2024-05-26 02:44:05] [INFO ] Invariant cache hit.
[2024-05-26 02:44:05] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-05-26 02:44:12] [INFO ] [Real]Absence check using state equation in 6512 ms returned sat
[2024-05-26 02:44:12] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2024-05-26 02:44:13] [INFO ] [Real]Added 1374 Read/Feed constraints in 1193 ms returned sat
[2024-05-26 02:44:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 02:44:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-05-26 02:44:21] [INFO ] [Nat]Absence check using state equation in 6622 ms returned sat
[2024-05-26 02:44:26] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-26 02:44:29] [INFO ] [Nat]Added 1374 Read/Feed constraints in 8046 ms returned sat
[2024-05-26 02:44:31] [INFO ] Deduced a trap composed of 49 places in 1822 ms of which 3 ms to minimize.
[2024-05-26 02:44:34] [INFO ] Deduced a trap composed of 39 places in 1900 ms of which 4 ms to minimize.
[2024-05-26 02:44:36] [INFO ] Deduced a trap composed of 51 places in 1839 ms of which 3 ms to minimize.
[2024-05-26 02:44:39] [INFO ] Deduced a trap composed of 19 places in 1557 ms of which 2 ms to minimize.
[2024-05-26 02:44:41] [INFO ] Deduced a trap composed of 185 places in 1529 ms of which 3 ms to minimize.
[2024-05-26 02:44:44] [INFO ] Deduced a trap composed of 147 places in 1430 ms of which 3 ms to minimize.
[2024-05-26 02:44:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 16054 ms
[2024-05-26 02:44:48] [INFO ] Computed and/alt/rep : 109/757/109 causal constraints (skipped 18615 transitions) in 3094 ms.
[2024-05-26 02:44:49] [INFO ] Added : 0 causal constraints over 0 iterations in 4059 ms. Result :sat
Minimization took 5349 ms.
[2024-05-26 02:44:54] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-26 02:44:59] [INFO ] [Real]Absence check using state equation in 4368 ms returned sat
[2024-05-26 02:45:00] [INFO ] [Real]Added 1374 Read/Feed constraints in 1499 ms returned sat
[2024-05-26 02:45:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 02:45:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-05-26 02:45:05] [INFO ] [Nat]Absence check using state equation in 4333 ms returned sat
[2024-05-26 02:45:11] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-26 02:45:15] [INFO ] [Nat]Added 1374 Read/Feed constraints in 10256 ms returned unknown
[2024-05-26 02:45:15] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-05-26 02:45:21] [INFO ] [Real]Absence check using state equation in 5445 ms returned sat
[2024-05-26 02:45:23] [INFO ] [Real]Added 1374 Read/Feed constraints in 1925 ms returned sat
[2024-05-26 02:45:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 02:45:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-05-26 02:45:28] [INFO ] [Nat]Absence check using state equation in 4839 ms returned sat
[2024-05-26 02:45:34] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-26 02:45:37] [INFO ] [Nat]Added 1374 Read/Feed constraints in 8699 ms returned sat
[2024-05-26 02:45:40] [INFO ] Deduced a trap composed of 194 places in 2306 ms of which 3 ms to minimize.
[2024-05-26 02:45:43] [INFO ] Deduced a trap composed of 19 places in 2358 ms of which 4 ms to minimize.
[2024-05-26 02:45:47] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 9863 ms
[2024-05-26 02:45:47] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-26 02:45:52] [INFO ] [Real]Absence check using state equation in 4512 ms returned sat
[2024-05-26 02:45:55] [INFO ] [Real]Added 1374 Read/Feed constraints in 2671 ms returned sat
[2024-05-26 02:45:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 02:45:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-05-26 02:46:00] [INFO ] [Nat]Absence check using state equation in 4931 ms returned sat
[2024-05-26 02:46:05] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-26 02:46:10] [INFO ] [Nat]Added 1374 Read/Feed constraints in 9778 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 111 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 111 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 104 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2024-05-26 02:46:10] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2024-05-26 02:46:10] [INFO ] Invariant cache hit.
[2024-05-26 02:46:11] [INFO ] Implicit Places using invariants in 1120 ms returned []
Implicit Place search using SMT only with invariants took 1122 ms to find 0 implicit places.
Running 27453 sub problems to find dead transitions.
[2024-05-26 02:46:12] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2024-05-26 02:46:12] [INFO ] Invariant cache hit.
[2024-05-26 02:46:12] [INFO ] State equation strengthened by 1374 read => feed constraints.
BK_STOP 1716691646457
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RERS2020-PT-pb103"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
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 r312-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 '
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 ;