About the Execution of 2024-gold for DoubleExponent-PT-100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15691.420 | 3600000.00 | 3698022.00 | 8969.20 | [undef] | Time out reached |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r083-tall-174860079700064.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is DoubleExponent-PT-100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-174860079700064
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.8M May 29 14:32 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
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748731037206
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 22:37:18] [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]
[2025-05-31 22:37:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 22:37:18] [INFO ] Load time of PNML (sax parser for PT used): 209 ms
[2025-05-31 22:37:18] [INFO ] Transformed 5304 places.
[2025-05-31 22:37:18] [INFO ] Transformed 4998 transitions.
[2025-05-31 22:37:18] [INFO ] Parsed PT model containing 5304 places and 4998 transitions and 14094 arcs in 333 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 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, +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, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 4998 rows 5304 cols
[2025-05-31 22:37:19] [INFO ] Invariants computation overflowed in 220 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, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 10000 steps (341 resets) in 57 ms. (172 steps per ms)
BEST_FIRST walk for 160000 steps (4542 resets) in 470 ms. (339 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 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, +inf]
// Phase 1: matrix 4998 rows 5304 cols
[2025-05-31 22:37:20] [INFO ] Invariants computation overflowed in 141 ms
[2025-05-31 22:37:25] [INFO ] [Real]Absence check using state equation in 4332 ms returned unknown
[2025-05-31 22:37:28] [INFO ] [Real]Absence check using state equation in 2519 ms returned sat
[2025-05-31 22:37:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:32] [INFO ] [Nat]Absence check using state equation in 2539 ms returned sat
[2025-05-31 22:37:32] [INFO ] Computed and/alt/rep : 4997/9693/4997 causal constraints (skipped 0 transitions) in 412 ms.
[2025-05-31 22:37:33] [INFO ] Added : 5 causal constraints over 1 iterations in 1647 ms. Result :unknown
[2025-05-31 22:37:38] [INFO ] [Real]Absence check using state equation in 4566 ms returned unknown
[2025-05-31 22:37:42] [INFO ] [Real]Absence check using state equation in 2749 ms returned sat
[2025-05-31 22:37:42] [INFO ] Computed and/alt/rep : 4997/9693/4997 causal constraints (skipped 0 transitions) in 233 ms.
[2025-05-31 22:37:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:46] [INFO ] [Nat]Absence check using state equation in 2768 ms returned sat
[2025-05-31 22:37:46] [INFO ] Computed and/alt/rep : 4997/9693/4997 causal constraints (skipped 0 transitions) in 236 ms.
[2025-05-31 22:37:47] [INFO ] Added : 15 causal constraints over 3 iterations in 1339 ms. Result :sat
Minimization took 294 ms.
[2025-05-31 22:37:50] [INFO ] [Real]Absence check using state equation in 1714 ms returned sat
[2025-05-31 22:37:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:52] [INFO ] [Nat]Absence check using state equation in 1715 ms returned sat
[2025-05-31 22:37:52] [INFO ] Computed and/alt/rep : 4997/9693/4997 causal constraints (skipped 0 transitions) in 216 ms.
[2025-05-31 22:37:54] [INFO ] Added : 15 causal constraints over 3 iterations in 1780 ms. Result :unknown
[2025-05-31 22:37:59] [INFO ] [Real]Absence check using state equation in 4556 ms returned unknown
[2025-05-31 22:38:04] [INFO ] [Real]Absence check using state equation in 4555 ms returned unknown
[2025-05-31 22:38:09] [INFO ] [Real]Absence check using state equation in 4510 ms returned unknown
[2025-05-31 22:38:12] [INFO ] [Real]Absence check using state equation in 2323 ms returned sat
[2025-05-31 22:38:17] [INFO ] Deduced a trap composed of 113 places in 4334 ms of which 238 ms to minimize.
[2025-05-31 22:38: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 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
[2025-05-31 22:38:22] [INFO ] [Real]Absence check using state equation in 4466 ms returned unknown
[2025-05-31 22:38:25] [INFO ] [Real]Absence check using state equation in 3057 ms returned sat
[2025-05-31 22:38:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:38:29] [INFO ] [Nat]Absence check using state equation in 3138 ms returned sat
[2025-05-31 22:38:29] [INFO ] Computed and/alt/rep : 4997/9693/4997 causal constraints (skipped 0 transitions) in 224 ms.
[2025-05-31 22:38:30] [INFO ] Added : 15 causal constraints over 3 iterations in 1287 ms. Result :unknown
[2025-05-31 22:38:35] [INFO ] [Real]Absence check using state equation in 4522 ms returned unknown
[2025-05-31 22:38:40] [INFO ] [Real]Absence check using state equation in 4423 ms returned unknown
[2025-05-31 22:38:45] [INFO ] [Real]Absence check using state equation in 4485 ms returned unknown
[2025-05-31 22:38:49] [INFO ] [Real]Absence check using state equation in 2904 ms returned sat
[2025-05-31 22:38:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:38:54] [INFO ] [Nat]Absence check using state equation in 4505 ms returned unknown
[2025-05-31 22:38:56] [INFO ] [Real]Absence check using state equation in 1575 ms returned sat
[2025-05-31 22:38:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:38:58] [INFO ] [Nat]Absence check using state equation in 1591 ms returned sat
[2025-05-31 22:38:59] [INFO ] Computed and/alt/rep : 4997/9693/4997 causal constraints (skipped 0 transitions) in 248 ms.
[2025-05-31 22:39:00] [INFO ] Added : 5 causal constraints over 1 iterations in 1487 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 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, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 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, +inf]
Support contains 16 out of 5304 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5304/5304 places, 4998/4998 transitions.
Graph (complete) has 9096 edges and 5304 vertex of which 5298 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.15 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1185 transitions
Trivial Post-agglo rules discarded 1185 transitions
Performed 1185 trivial Post agglomeration. Transition count delta: 1185
Iterating post reduction 0 with 1188 rules applied. Total rules applied 1189 place count 5297 transition count 3811
Reduce places removed 1185 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 1194 rules applied. Total rules applied 2383 place count 4112 transition count 3802
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 2392 place count 4103 transition count 3802
Performed 203 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 203 Pre rules applied. Total rules applied 2392 place count 4103 transition count 3599
Deduced a syphon composed of 203 places in 175 ms
Reduce places removed 203 places and 0 transitions.
Iterating global reduction 3 with 406 rules applied. Total rules applied 2798 place count 3900 transition count 3599
Performed 896 Post agglomeration using F-continuation condition.Transition count delta: 896
Deduced a syphon composed of 896 places in 94 ms
Reduce places removed 896 places and 0 transitions.
Iterating global reduction 3 with 1792 rules applied. Total rules applied 4590 place count 3004 transition count 2703
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 52 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4792 place count 2903 transition count 2703
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 91 places in 52 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 4974 place count 2812 transition count 2703
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 4977 place count 2812 transition count 2700
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 4980 place count 2809 transition count 2700
Free-agglomeration rule (complex) applied 398 times.
Iterating global reduction 4 with 398 rules applied. Total rules applied 5378 place count 2809 transition count 2302
Reduce places removed 398 places and 0 transitions.
Iterating post reduction 4 with 398 rules applied. Total rules applied 5776 place count 2411 transition count 2302
Partial Free-agglomeration rule applied 400 times.
Drop transitions (Partial Free agglomeration) removed 400 transitions
Iterating global reduction 5 with 400 rules applied. Total rules applied 6176 place count 2411 transition count 2302
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6177 place count 2410 transition count 2301
Applied a total of 6177 rules in 2565 ms. Remains 2410 /5304 variables (removed 2894) and now considering 2301/4998 (removed 2697) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2578 ms. Remains : 2410/5304 places, 2301/4998 transitions.
Found an invariant !
This invariant on transitions {277=1, 389=1, 412=1, 696=1, 715=1, 1045=1, 1372=1, 1998=1, 2177=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {277=1, 389=1, 412=1, 696=1, 715=1, 1045=1, 1372=1, 1998=1, 2177=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1259 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 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, +inf]
// Phase 1: matrix 2301 rows 2410 cols
[2025-05-31 22:49:12] [INFO ] Invariants computation overflowed in 42 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, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (128353 resets) in 1726 ms. (579 steps per ms)
BEST_FIRST walk for 16000007 steps (1356117 resets) in 17339 ms. (922 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 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, +inf]
// Phase 1: matrix 2301 rows 2410 cols
[2025-05-31 22:49:31] [INFO ] Invariants computation overflowed in 46 ms
[2025-05-31 22:49:32] [INFO ] [Real]Absence check using state equation in 1008 ms returned sat
[2025-05-31 22:49:32] [INFO ] State equation strengthened by 395 read => feed constraints.
[2025-05-31 22:49:37] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 22:49:41] [INFO ] [Real]Added 395 Read/Feed constraints in 8740 ms returned sat
[2025-05-31 22:49:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:49:42] [INFO ] [Nat]Absence check using state equation in 1024 ms returned sat
[2025-05-31 22:49:47] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 22:49:51] [INFO ] [Nat]Added 395 Read/Feed constraints in 9164 ms returned unknown
[2025-05-31 22:50:02] [INFO ] [Real]Absence check using state equation in 9936 ms returned sat
[2025-05-31 22:50:06] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 22:50:11] [INFO ] [Real]Added 395 Read/Feed constraints in 9182 ms returned unknown
[2025-05-31 22:50:54] [INFO ] [Real]Absence check using state equation in 42658 ms returned sat
[2025-05-31 22:50:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:51:37] [INFO ] [Nat]Absence check using state equation in 43294 ms returned sat
[2025-05-31 22:51:39] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 22:51:39] [INFO ] [Nat]Added 395 Read/Feed constraints in 1530 ms returned unknown
[2025-05-31 22:52:21] [INFO ] [Real]Absence check using state equation in 41490 ms returned sat
[2025-05-31 22:52:24] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 22:52:24] [INFO ] [Real]Added 395 Read/Feed constraints in 3247 ms returned unknown
[2025-05-31 22:52:35] [INFO ] [Real]Absence check using state equation in 10964 ms returned sat
[2025-05-31 22:52:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:53:20] [INFO ] [Nat]Absence check using state equation in 44789 ms returned unknown
[2025-05-31 22:53:25] [INFO ] [Real]Absence check using state equation in 4987 ms returned sat
[2025-05-31 22:53:30] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 22:53:40] [INFO ] [Real]Added 395 Read/Feed constraints in 14407 ms returned unknown
[2025-05-31 22:53:58] [INFO ] [Real]Absence check using state equation in 17542 ms returned sat
[2025-05-31 22:53:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:54:16] [INFO ] [Nat]Absence check using state equation in 17977 ms returned sat
[2025-05-31 22:54:20] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 22:54:26] [INFO ] [Nat]Added 395 Read/Feed constraints in 9839 ms returned unknown
[2025-05-31 22:54:33] [INFO ] [Real]Absence check using state equation in 7375 ms returned sat
[2025-05-31 22:54:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:54:49] [INFO ] [Nat]Absence check using state equation in 15449 ms returned sat
[2025-05-31 22:54:54] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 22:54:58] [INFO ] [Nat]Added 395 Read/Feed constraints in 9303 ms returned unknown
[2025-05-31 22:55:00] [INFO ] [Real]Absence check using state equation in 989 ms returned sat
[2025-05-31 22:55:04] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 22:55:09] [INFO ] [Real]Added 395 Read/Feed constraints in 9106 ms returned unknown
[2025-05-31 22:55:48] [INFO ] [Real]Absence check using state equation in 38766 ms returned sat
[2025-05-31 22:55:48] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:56:27] [INFO ] [Nat]Absence check using state equation in 39013 ms returned sat
[2025-05-31 22:56:32] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 22:56:33] [INFO ] [Nat]Added 395 Read/Feed constraints in 5782 ms returned unknown
[2025-05-31 22:56:39] [INFO ] [Real]Absence check using state equation in 6266 ms returned sat
[2025-05-31 22:56:45] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 22:56:54] [INFO ] [Real]Added 395 Read/Feed constraints in 14912 ms returned unknown
[2025-05-31 22:57:00] [INFO ] [Real]Absence check using state equation in 5209 ms returned sat
[2025-05-31 22:57:03] [INFO ] [Real]Added 395 Read/Feed constraints in 3265 ms returned sat
[2025-05-31 22:57:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:57:05] [INFO ] [Nat]Absence check using state equation in 1669 ms returned sat
[2025-05-31 22:57:10] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 22:57:15] [INFO ] [Nat]Added 395 Read/Feed constraints in 9564 ms returned unknown
[2025-05-31 22:57:19] [INFO ] [Real]Absence check using state equation in 4000 ms returned sat
[2025-05-31 22:57:24] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 22:57:26] [INFO ] [Real]Added 395 Read/Feed constraints in 6921 ms returned sat
[2025-05-31 22:57:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:57:30] [INFO ] [Nat]Absence check using state equation in 4024 ms returned sat
[2025-05-31 22:57:35] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 22:57:39] [INFO ] [Nat]Added 395 Read/Feed constraints in 9229 ms returned unknown
[2025-05-31 22:57:56] [INFO ] [Real]Absence check using state equation in 16528 ms returned sat
[2025-05-31 22:57:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:58:27] [INFO ] [Nat]Absence check using state equation in 31002 ms returned sat
[2025-05-31 22:58:32] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 22:58:37] [INFO ] [Nat]Added 395 Read/Feed constraints in 9363 ms returned unknown
[2025-05-31 22:58:55] [INFO ] [Real]Absence check using state equation in 18311 ms returned sat
[2025-05-31 22:58:56] [INFO ] [Real]Added 395 Read/Feed constraints in 841 ms returned sat
[2025-05-31 22:58:59] [INFO ] Deduced a trap composed of 2 places in 2337 ms of which 15 ms to minimize.
[2025-05-31 22:58:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:59:08] [INFO ] [Nat]Absence check using state equation in 9400 ms returned sat
[2025-05-31 22:59:13] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 22:59:17] [INFO ] [Nat]Added 395 Read/Feed constraints in 9031 ms returned unknown
[2025-05-31 22:59:28] [INFO ] [Real]Absence check using state equation in 10821 ms returned sat
[2025-05-31 22:59:33] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 22:59:38] [INFO ] [Real]Added 395 Read/Feed constraints in 9043 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 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, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 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, +inf]
Support contains 16 out of 2410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2410/2410 places, 2301/2301 transitions.
Applied a total of 0 rules in 162 ms. Remains 2410 /2410 variables (removed 0) and now considering 2301/2301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 2410/2410 places, 2301/2301 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2410/2410 places, 2301/2301 transitions.
Applied a total of 0 rules in 177 ms. Remains 2410 /2410 variables (removed 0) and now considering 2301/2301 (removed 0) transitions.
// Phase 1: matrix 2301 rows 2410 cols
[2025-05-31 23:00:41] [INFO ] Invariants computation overflowed in 45 ms
[2025-05-31 23:00:53] [INFO ] Implicit Places using invariants in 11887 ms returned []
// Phase 1: matrix 2301 rows 2410 cols
[2025-05-31 23:00:53] [INFO ] Invariants computation overflowed in 40 ms
[2025-05-31 23:00:54] [INFO ] State equation strengthened by 395 read => feed constraints.
[2025-05-31 23:01:25] [INFO ] Performed 7/2410 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-05-31 23:03:33] [INFO ] Performed 25/2410 implicitness test of which 2 returned IMPLICIT in 158 seconds.
[2025-05-31 23:03:33] [INFO ] Implicit Places using invariants and state equation in 160074 ms returned [19, 25]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 171973 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2408/2410 places, 2301/2301 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2408 transition count 2300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2407 transition count 2300
Applied a total of 2 rules in 297 ms. Remains 2407 /2408 variables (removed 1) and now considering 2300/2301 (removed 1) transitions.
// Phase 1: matrix 2300 rows 2407 cols
[2025-05-31 23:03:33] [INFO ] Invariants computation overflowed in 59 ms
[2025-05-31 23:03:45] [INFO ] Implicit Places using invariants in 11592 ms returned []
// Phase 1: matrix 2300 rows 2407 cols
[2025-05-31 23:03:45] [INFO ] Invariants computation overflowed in 62 ms
[2025-05-31 23:03:48] [INFO ] State equation strengthened by 395 read => feed constraints.
[2025-05-31 23:04:35] [INFO ] Performed 5/2407 implicitness test of which 0 returned IMPLICIT in 47 seconds.
[2025-05-31 23:06:25] [INFO ] Performed 6/2407 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2025-05-31 23:06:25] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2025-05-31 23:06:25] [INFO ] Implicit Places using invariants and state equation in 160113 ms returned []
Implicit Place search using SMT with State Equation took 171707 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2407/2410 places, 2300/2301 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 344157 ms. Remains : 2407/2410 places, 2300/2301 transitions.
Found an invariant !
This invariant on transitions {277=1, 389=1, 412=1, 454=1, 462=1, 489=1, 693=1, 712=1, 1040=1, 1285=1, 1371=1, 2019=1, 2070=1, 2174=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {277=1, 389=1, 412=1, 454=1, 462=1, 489=1, 693=1, 712=1, 1040=1, 1285=1, 1371=1, 2019=1, 2070=1, 2174=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1291 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 16) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 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, +inf]
// Phase 1: matrix 2300 rows 2407 cols
[2025-05-31 23:16:39] [INFO ] Invariants computation overflowed in 60 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, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (128197 resets) in 1590 ms. (628 steps per ms)
BEST_FIRST walk for 16000004 steps (1354788 resets) in 17485 ms. (915 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 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, +inf]
// Phase 1: matrix 2300 rows 2407 cols
[2025-05-31 23:16:58] [INFO ] Invariants computation overflowed in 66 ms
[2025-05-31 23:17:04] [INFO ] [Real]Absence check using state equation in 5632 ms returned sat
[2025-05-31 23:17:04] [INFO ] State equation strengthened by 395 read => feed constraints.
[2025-05-31 23:17:09] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 23:17:09] [INFO ] [Real]Added 395 Read/Feed constraints in 5239 ms returned sat
[2025-05-31 23:17:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:17:15] [INFO ] [Nat]Absence check using state equation in 5695 ms returned sat
[2025-05-31 23:17:21] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 23:17:25] [INFO ] [Nat]Added 395 Read/Feed constraints in 9770 ms returned unknown
[2025-05-31 23:17:30] [INFO ] [Real]Absence check using state equation in 4729 ms returned sat
[2025-05-31 23:17:35] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 23:17:40] [INFO ] [Real]Added 395 Read/Feed constraints in 10193 ms returned unknown
[2025-05-31 23:18:02] [INFO ] [Real]Absence check using state equation in 21718 ms returned sat
[2025-05-31 23:18:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:18:25] [INFO ] [Nat]Absence check using state equation in 22119 ms returned sat
[2025-05-31 23:18:29] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 23:18:34] [INFO ] [Nat]Added 395 Read/Feed constraints in 9276 ms returned unknown
[2025-05-31 23:18:40] [INFO ] [Real]Absence check using state equation in 5544 ms returned sat
[2025-05-31 23:18:44] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 23:18:49] [INFO ] [Real]Added 395 Read/Feed constraints in 9068 ms returned unknown
[2025-05-31 23:19:12] [INFO ] [Real]Absence check using state equation in 22527 ms returned sat
[2025-05-31 23:19:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:19:15] [INFO ] [Nat]Absence check using state equation in 2508 ms returned sat
[2025-05-31 23:19:19] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 23:19:24] [INFO ] [Nat]Added 395 Read/Feed constraints in 9115 ms returned unknown
[2025-05-31 23:19:59] [INFO ] [Real]Absence check using state equation in 35465 ms returned sat
[2025-05-31 23:20:04] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 23:20:09] [INFO ] [Real]Added 395 Read/Feed constraints in 9233 ms returned unknown
[2025-05-31 23:20:23] [INFO ] [Real]Absence check using state equation in 14143 ms returned sat
[2025-05-31 23:20:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:20:38] [INFO ] [Nat]Absence check using state equation in 14479 ms returned sat
[2025-05-31 23:20:42] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 23:20:47] [INFO ] [Nat]Added 395 Read/Feed constraints in 9682 ms returned unknown
[2025-05-31 23:21:01] [INFO ] [Real]Absence check using state equation in 13037 ms returned sat
[2025-05-31 23:21:06] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 23:21:10] [INFO ] [Real]Added 395 Read/Feed constraints in 9398 ms returned unknown
[2025-05-31 23:21:14] [INFO ] [Real]Absence check using state equation in 3726 ms returned sat
[2025-05-31 23:21:19] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 23:21:21] [INFO ] [Real]Added 395 Read/Feed constraints in 7119 ms returned sat
[2025-05-31 23:21:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:21:25] [INFO ] [Nat]Absence check using state equation in 3712 ms returned sat
[2025-05-31 23:21:30] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 23:21:34] [INFO ] [Nat]Added 395 Read/Feed constraints in 9157 ms returned unknown
[2025-05-31 23:22:20] [INFO ] [Real]Absence check using state equation in 44830 ms returned unknown
[2025-05-31 23:22:26] [INFO ] [Real]Absence check using state equation in 6537 ms returned sat
[2025-05-31 23:22:31] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 23:22:36] [INFO ] [Real]Added 395 Read/Feed constraints in 9816 ms returned unknown
[2025-05-31 23:22:38] [INFO ] [Real]Absence check using state equation in 1140 ms returned sat
[2025-05-31 23:22:42] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 23:22:46] [INFO ] [Real]Added 395 Read/Feed constraints in 8179 ms returned sat
[2025-05-31 23:22:46] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:22:50] [INFO ] [Nat]Absence check using state equation in 4109 ms returned sat
[2025-05-31 23:22:55] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 23:23:00] [INFO ] [Nat]Added 395 Read/Feed constraints in 9550 ms returned unknown
[2025-05-31 23:23:06] [INFO ] [Real]Absence check using state equation in 5737 ms returned sat
[2025-05-31 23:23:10] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 23:23:13] [INFO ] [Real]Added 395 Read/Feed constraints in 7267 ms returned sat
[2025-05-31 23:23:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:23:18] [INFO ] [Nat]Absence check using state equation in 4930 ms returned sat
[2025-05-31 23:23:23] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 23:23:27] [INFO ] [Nat]Added 395 Read/Feed constraints in 9125 ms returned unknown
[2025-05-31 23:23:49] [INFO ] [Real]Absence check using state equation in 21702 ms returned sat
[2025-05-31 23:23:54] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 23:24:00] [INFO ] [Real]Added 395 Read/Feed constraints in 10242 ms returned unknown
[2025-05-31 23:24:37] [INFO ] [Real]Absence check using state equation in 36994 ms returned sat
[2025-05-31 23:24:38] [INFO ] [Real]Added 395 Read/Feed constraints in 966 ms returned sat
[2025-05-31 23:24:38] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:24:44] [INFO ] [Nat]Absence check using state equation in 5686 ms returned sat
[2025-05-31 23:24:49] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 23:24:53] [INFO ] [Nat]Added 395 Read/Feed constraints in 9394 ms returned unknown
[2025-05-31 23:25:05] [INFO ] [Real]Absence check using state equation in 11800 ms returned sat
[2025-05-31 23:25:11] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 23:25:16] [INFO ] [Real]Added 395 Read/Feed constraints in 10667 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 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, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 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, +inf]
Support contains 16 out of 2407 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2407/2407 places, 2300/2300 transitions.
Applied a total of 0 rules in 140 ms. Remains 2407 /2407 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 2407/2407 places, 2300/2300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2407/2407 places, 2300/2300 transitions.
Applied a total of 0 rules in 138 ms. Remains 2407 /2407 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
// Phase 1: matrix 2300 rows 2407 cols
[2025-05-31 23:25:46] [INFO ] Invariants computation overflowed in 66 ms
[2025-05-31 23:25:58] [INFO ] Implicit Places using invariants in 11537 ms returned []
// Phase 1: matrix 2300 rows 2407 cols
[2025-05-31 23:25:58] [INFO ] Invariants computation overflowed in 67 ms
[2025-05-31 23:26:01] [INFO ] State equation strengthened by 395 read => feed constraints.
[2025-05-31 23:26:47] [INFO ] Performed 5/2407 implicitness test of which 0 returned IMPLICIT in 46 seconds.
[2025-05-31 23:28:38] [INFO ] Performed 6/2407 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2025-05-31 23:28:38] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2025-05-31 23:28:38] [INFO ] Implicit Places using invariants and state equation in 160126 ms returned []
Implicit Place search using SMT with State Equation took 171664 ms to find 0 implicit places.
[2025-05-31 23:28:38] [INFO ] Redundant transitions in 162 ms returned []
Running 2299 sub problems to find dead transitions.
// Phase 1: matrix 2300 rows 2407 cols
[2025-05-31 23:28:38] [INFO ] Invariants computation overflowed in 64 ms
[2025-05-31 23:28:38] [INFO ] State equation strengthened by 395 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2406/4707 variables, and 0 constraints, problems are : Problem set: 0 solved, 2299 unsolved in 30061 ms.
Refiners :[State Equation: 0/2407 constraints, ReadFeed: 0/395 constraints, PredecessorRefiner: 2299/2299 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2299 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2406/4707 variables, and 0 constraints, problems are : Problem set: 0 solved, 2299 unsolved in 30034 ms.
Refiners :[State Equation: 0/2407 constraints, ReadFeed: 0/395 constraints, PredecessorRefiner: 0/2299 constraints, Known Traps: 0/0 constraints]
After SMT, in 75181ms problems are : Problem set: 0 solved, 2299 unsolved
Search for dead transitions found 0 dead transitions in 75235ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 247231 ms. Remains : 2407/2407 places, 2300/2300 transitions.
Found an invariant !
This invariant on transitions {277=1, 389=1, 412=1, 454=1, 462=1, 489=1, 693=1, 712=1, 1040=1, 1285=1, 1371=1, 2019=1, 2070=1, 2174=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
BK_TIME_CONFINEMENT_REACHED
--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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="DoubleExponent-PT-100"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is DoubleExponent-PT-100, 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 r083-tall-174860079700064"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-100.tgz
mv DoubleExponent-PT-100 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.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 ;