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.r536-tall-171690531600085.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 SquareGrid-PT-130613, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690531600085
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 6.8K 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 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 06:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 12 06:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 05:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 123K Apr 12 05:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rwxr-xr-x 1 mcc users 1.3M 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 SquareGrid-PT-130613-UpperBounds-00
FORMULA_NAME SquareGrid-PT-130613-UpperBounds-01
FORMULA_NAME SquareGrid-PT-130613-UpperBounds-02
FORMULA_NAME SquareGrid-PT-130613-UpperBounds-03
FORMULA_NAME SquareGrid-PT-130613-UpperBounds-04
FORMULA_NAME SquareGrid-PT-130613-UpperBounds-05
FORMULA_NAME SquareGrid-PT-130613-UpperBounds-06
FORMULA_NAME SquareGrid-PT-130613-UpperBounds-07
FORMULA_NAME SquareGrid-PT-130613-UpperBounds-08
FORMULA_NAME SquareGrid-PT-130613-UpperBounds-09
FORMULA_NAME SquareGrid-PT-130613-UpperBounds-10
FORMULA_NAME SquareGrid-PT-130613-UpperBounds-11
FORMULA_NAME SquareGrid-PT-130613-UpperBounds-12
FORMULA_NAME SquareGrid-PT-130613-UpperBounds-13
FORMULA_NAME SquareGrid-PT-130613-UpperBounds-14
FORMULA_NAME SquareGrid-PT-130613-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717227184221

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SquareGrid-PT-130613
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:33:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 07:33:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:33:05] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2024-06-01 07:33:05] [INFO ] Transformed 2301 places.
[2024-06-01 07:33:05] [INFO ] Transformed 2756 transitions.
[2024-06-01 07:33:05] [INFO ] Parsed PT model containing 2301 places and 2756 transitions and 11024 arcs in 290 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 1, 1, 1, 6, 0, 1, 0, 6, 0, 0, 1, 1, 1, 6, 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, 1, 1, 1, 6, 0, 1, 0, 6, 0, 0, 1, 1, 1, 6, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 2756 rows 2301 cols
[2024-06-01 07:33:05] [INFO ] Computed 898 invariants in 208 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 1, 1, 6, 0, 1, 0, 6, 0, 0, 1, 1, 1, 6, 0] Max Struct:[1, 1, 1, 1, 37, 1, 1, 1, 37, 1, 1, 1, 1, 1, 37, 1]
FORMULA SquareGrid-PT-130613-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SquareGrid-PT-130613-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SquareGrid-PT-130613-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SquareGrid-PT-130613-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SquareGrid-PT-130613-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SquareGrid-PT-130613-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SquareGrid-PT-130613-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (2 resets) in 2118 ms. (4 steps per ms)
FORMULA SquareGrid-PT-130613-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SquareGrid-PT-130613-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SquareGrid-PT-130613-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SquareGrid-PT-130613-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SquareGrid-PT-130613-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SquareGrid-PT-130613-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (6 resets) in 737 ms. (40 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[8, 10, 9] Max Struct:[37, 37, 37]
[2024-06-01 07:33:08] [INFO ] Invariant cache hit.
[2024-06-01 07:33:09] [INFO ] [Real]Absence check using 897 positive place invariants in 170 ms returned sat
[2024-06-01 07:33:09] [INFO ] [Real]Absence check using 897 positive and 1 generalized place invariants in 45 ms returned sat
[2024-06-01 07:33:10] [INFO ] [Real]Absence check using state equation in 919 ms returned sat
[2024-06-01 07:33:10] [INFO ] Computed and/alt/rep : 2080/2080/2080 causal constraints (skipped 0 transitions) in 181 ms.
[2024-06-01 07:33:13] [INFO ] Added : 120 causal constraints over 24 iterations in 3208 ms. Result :unknown
[2024-06-01 07:33:14] [INFO ] [Real]Absence check using 897 positive place invariants in 186 ms returned sat
[2024-06-01 07:33:14] [INFO ] [Real]Absence check using 897 positive and 1 generalized place invariants in 43 ms returned sat
[2024-06-01 07:33:15] [INFO ] [Real]Absence check using state equation in 939 ms returned sat
[2024-06-01 07:33:15] [INFO ] Computed and/alt/rep : 2080/2080/2080 causal constraints (skipped 0 transitions) in 134 ms.
[2024-06-01 07:33:18] [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.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 07:33:19] [INFO ] [Real]Absence check using 897 positive place invariants in 151 ms returned sat
[2024-06-01 07:33:19] [INFO ] [Real]Absence check using 897 positive and 1 generalized place invariants in 53 ms returned sat
[2024-06-01 07:33:20] [INFO ] [Real]Absence check using state equation in 858 ms returned sat
[2024-06-01 07:33:20] [INFO ] Computed and/alt/rep : 2080/2080/2080 causal constraints (skipped 0 transitions) in 119 ms.
[2024-06-01 07:33:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:33:24] [INFO ] [Nat]Absence check using 897 positive place invariants in 171 ms returned sat
[2024-06-01 07:33:24] [INFO ] [Nat]Absence check using 897 positive and 1 generalized place invariants in 45 ms returned sat
[2024-06-01 07:33:25] [INFO ] [Nat]Absence check using state equation in 941 ms returned sat
[2024-06-01 07:33:25] [INFO ] Computed and/alt/rep : 2080/2080/2080 causal constraints (skipped 0 transitions) in 214 ms.
[2024-06-01 07:33:28] [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.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
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:[8, 10, 9] Max Struct:[37, 37, 37]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10, 9] Max Struct:[37, 37, 37]
Support contains 3 out of 2301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2301/2301 places, 2756/2756 transitions.
Applied a total of 0 rules in 257 ms. Remains 2301 /2301 variables (removed 0) and now considering 2756/2756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 267 ms. Remains : 2301/2301 places, 2756/2756 transitions.
[2024-06-01 07:33:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10, 10, 9] Max Struct:[37, 37, 37]
RANDOM walk for 200847 steps (1 resets) in 30001 ms. (6 steps per ms)
BEST_FIRST walk for 743124 steps (0 resets) in 15033 ms. (49 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12, 11, 15] Max Struct:[37, 37, 37]
[2024-06-01 07:34:44] [INFO ] Invariant cache hit.
[2024-06-01 07:34:44] [INFO ] [Real]Absence check using 897 positive place invariants in 163 ms returned sat
[2024-06-01 07:34:44] [INFO ] [Real]Absence check using 897 positive and 1 generalized place invariants in 46 ms returned sat
[2024-06-01 07:34:45] [INFO ] [Real]Absence check using state equation in 894 ms returned sat
[2024-06-01 07:34:45] [INFO ] Computed and/alt/rep : 2080/2080/2080 causal constraints (skipped 0 transitions) in 119 ms.
[2024-06-01 07:34:57] [INFO ] Added : 441 causal constraints over 89 iterations in 11525 ms. Result :sat
Minimization took 3985 ms.
[2024-06-01 07:35:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:35:01] [INFO ] [Nat]Absence check using 897 positive place invariants in 164 ms returned sat
[2024-06-01 07:35:02] [INFO ] [Nat]Absence check using 897 positive and 1 generalized place invariants in 42 ms returned sat
[2024-06-01 07:35:02] [INFO ] [Nat]Absence check using state equation in 900 ms returned sat
[2024-06-01 07:35:03] [INFO ] Computed and/alt/rep : 2080/2080/2080 causal constraints (skipped 0 transitions) in 114 ms.
[2024-06-01 07:35:13] [INFO ] Added : 441 causal constraints over 89 iterations in 10655 ms. Result :sat
Minimization took 4066 ms.
[2024-06-01 07:35:18] [INFO ] [Real]Absence check using 897 positive place invariants in 150 ms returned sat
[2024-06-01 07:35:18] [INFO ] [Real]Absence check using 897 positive and 1 generalized place invariants in 45 ms returned sat
[2024-06-01 07:35:19] [INFO ] [Real]Absence check using state equation in 900 ms returned sat
[2024-06-01 07:35:19] [INFO ] Computed and/alt/rep : 2080/2080/2080 causal constraints (skipped 0 transitions) in 122 ms.
[2024-06-01 07:35:31] [INFO ] Added : 467 causal constraints over 94 iterations in 12319 ms. Result :sat
Minimization took 3975 ms.
[2024-06-01 07:35:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:35:36] [INFO ] [Nat]Absence check using 897 positive place invariants in 169 ms returned sat
[2024-06-01 07:35:36] [INFO ] [Nat]Absence check using 897 positive and 1 generalized place invariants in 44 ms returned sat
[2024-06-01 07:35:37] [INFO ] [Nat]Absence check using state equation in 929 ms returned sat
[2024-06-01 07:35:37] [INFO ] Computed and/alt/rep : 2080/2080/2080 causal constraints (skipped 0 transitions) in 116 ms.
[2024-06-01 07:35:48] [INFO ] Added : 467 causal constraints over 94 iterations in 11280 ms. Result :sat
Minimization took 3777 ms.
[2024-06-01 07:35:52] [INFO ] [Real]Absence check using 897 positive place invariants in 157 ms returned sat
[2024-06-01 07:35:52] [INFO ] [Real]Absence check using 897 positive and 1 generalized place invariants in 43 ms returned sat
[2024-06-01 07:35:53] [INFO ] [Real]Absence check using state equation in 889 ms returned sat
[2024-06-01 07:35:53] [INFO ] Computed and/alt/rep : 2080/2080/2080 causal constraints (skipped 0 transitions) in 119 ms.
[2024-06-01 07:36:05] [INFO ] Added : 443 causal constraints over 89 iterations in 11431 ms. Result :sat
Minimization took 3935 ms.
[2024-06-01 07:36:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:36:09] [INFO ] [Nat]Absence check using 897 positive place invariants in 152 ms returned sat
[2024-06-01 07:36:09] [INFO ] [Nat]Absence check using 897 positive and 1 generalized place invariants in 43 ms returned sat
[2024-06-01 07:36:10] [INFO ] [Nat]Absence check using state equation in 873 ms returned sat
[2024-06-01 07:36:10] [INFO ] Computed and/alt/rep : 2080/2080/2080 causal constraints (skipped 0 transitions) in 120 ms.
[2024-06-01 07:36:21] [INFO ] Added : 443 causal constraints over 89 iterations in 10645 ms. Result :sat
Minimization took 3814 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12, 11, 15] Max Struct:[37, 37, 37]
FORMULA SquareGrid-PT-130613-UpperBounds-14 37 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[37, 35] Max Struct:[37, 37]
Support contains 2 out of 2301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2301/2301 places, 2756/2756 transitions.
Applied a total of 0 rules in 213 ms. Remains 2301 /2301 variables (removed 0) and now considering 2756/2756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 2301/2301 places, 2756/2756 transitions.
[2024-06-01 07:37:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[37, 35] Max Struct:[37, 37]
FORMULA SquareGrid-PT-130613-UpperBounds-04 37 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 201089 steps (1 resets) in 30001 ms. (6 steps per ms)
BEST_FIRST walk for 248930 steps (0 resets) in 5009 ms. (49 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[35] Max Struct:[37]
[2024-06-01 07:38:30] [INFO ] Invariant cache hit.
[2024-06-01 07:38:31] [INFO ] [Real]Absence check using 897 positive place invariants in 151 ms returned sat
[2024-06-01 07:38:31] [INFO ] [Real]Absence check using 897 positive and 1 generalized place invariants in 48 ms returned sat
[2024-06-01 07:38:32] [INFO ] [Real]Absence check using state equation in 927 ms returned sat
[2024-06-01 07:38:32] [INFO ] Computed and/alt/rep : 2080/2080/2080 causal constraints (skipped 0 transitions) in 121 ms.
[2024-06-01 07:38:44] [INFO ] Added : 494 causal constraints over 99 iterations in 12693 ms. Result :sat
Minimization took 3941 ms.
[2024-06-01 07:38:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:38:49] [INFO ] [Nat]Absence check using 897 positive place invariants in 152 ms returned sat
[2024-06-01 07:38:49] [INFO ] [Nat]Absence check using 897 positive and 1 generalized place invariants in 44 ms returned sat
[2024-06-01 07:38:50] [INFO ] [Nat]Absence check using state equation in 972 ms returned sat
[2024-06-01 07:38:50] [INFO ] Computed and/alt/rep : 2080/2080/2080 causal constraints (skipped 0 transitions) in 121 ms.
[2024-06-01 07:39:02] [INFO ] Added : 494 causal constraints over 99 iterations in 11922 ms. Result :sat
Minimization took 3783 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[35] Max Struct:[37]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[35] Max Struct:[37]
Support contains 1 out of 2301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2301/2301 places, 2756/2756 transitions.
Applied a total of 0 rules in 90 ms. Remains 2301 /2301 variables (removed 0) and now considering 2756/2756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 2301/2301 places, 2756/2756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2301/2301 places, 2756/2756 transitions.
Applied a total of 0 rules in 75 ms. Remains 2301 /2301 variables (removed 0) and now considering 2756/2756 (removed 0) transitions.
[2024-06-01 07:39:36] [INFO ] Invariant cache hit.
[2024-06-01 07:39:38] [INFO ] Implicit Places using invariants in 1556 ms returned []
[2024-06-01 07:39:38] [INFO ] Invariant cache hit.
[2024-06-01 07:39:41] [INFO ] Implicit Places using invariants and state equation in 3338 ms returned []
Implicit Place search using SMT with State Equation took 4896 ms to find 0 implicit places.
[2024-06-01 07:39:41] [INFO ] Redundant transitions in 135 ms returned []
Running 2080 sub problems to find dead transitions.
[2024-06-01 07:39:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/949 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 949/5057 variables, and 52 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 52/897 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/2301 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/949 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/949 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
SMT process timed out in 61266ms, After SMT, problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 61315ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66455 ms. Remains : 2301/2301 places, 2756/2756 transitions.
RANDOM walk for 40000 steps (8 resets) in 8800 ms. (4 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 978 ms. (40 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 873 ms. (45 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 166568 steps, run timeout after 6020 ms. (steps per millisecond=27 ) properties seen :0 out of 2
Probabilistic random walk after 166568 steps, saw 166350 distinct states, run finished after 6024 ms. (steps per millisecond=27 ) properties seen :0
[2024-06-01 07:40:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 896/901 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/901 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1399/2300 variables, 895/897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2300 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/2301 variables, 1/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2301 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2756/5057 variables, 2301/3199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5057 variables, 0/3199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/5057 variables, 0/3199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5057/5057 variables, and 3199 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1797 ms.
Refiners :[Positive P Invariants (semi-flows): 897/897 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 2301/2301 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 896/901 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/901 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1399/2300 variables, 895/897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2300 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/2301 variables, 1/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2301 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2756/5057 variables, 2301/3199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5057 variables, 2/3201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5057 variables, 0/3201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/5057 variables, 0/3201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5057/5057 variables, and 3201 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1613 ms.
Refiners :[Positive P Invariants (semi-flows): 897/897 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 2301/2301 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 3461ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 9843 steps, including 0 resets, run visited all 2 properties in 866 ms. (steps per millisecond=11 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 872 ms.
FORMULA SquareGrid-PT-130613-UpperBounds-08 37 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 470825 ms.
ITS solved all properties within timeout

BK_STOP 1717227656229

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ 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

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="SquareGrid-PT-130613"
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 SquareGrid-PT-130613, 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 r536-tall-171690531600085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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