Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620399800597.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BusinessProcesses-PT-19, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399800597
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 11 16:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 189K May 18 16:42 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 BusinessProcesses-PT-19-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717226121639

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-19
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:15:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 07:15:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:15:23] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-06-01 07:15:23] [INFO ] Transformed 772 places.
[2024-06-01 07:15:23] [INFO ] Transformed 685 transitions.
[2024-06-01 07:15:23] [INFO ] Found NUPN structural information;
[2024-06-01 07:15:23] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 226 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 15 places in 13 ms
Reduce places removed 15 places and 15 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 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, 1]
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:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 670 rows 757 cols
[2024-06-01 07:15:23] [INFO ] Computed 125 invariants in 50 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:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (55 resets) in 47 ms. (208 steps per ms)
FORMULA BusinessProcesses-PT-19-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (46 resets) in 72 ms. (684 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-06-01 07:15:23] [INFO ] Invariant cache hit.
[2024-06-01 07:15:23] [INFO ] [Real]Absence check using 78 positive place invariants in 32 ms returned sat
[2024-06-01 07:15:23] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 18 ms returned sat
[2024-06-01 07:15:24] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2024-06-01 07:15:24] [INFO ] Deduced a trap composed of 14 places in 280 ms of which 35 ms to minimize.
[2024-06-01 07:15:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:15:24] [INFO ] [Nat]Absence check using 78 positive place invariants in 28 ms returned sat
[2024-06-01 07:15:24] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 15 ms returned sat
[2024-06-01 07:15:24] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 4 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 4 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 12 places in 246 ms of which 4 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 16 places in 211 ms of which 3 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 11 places in 213 ms of which 4 ms to minimize.
[2024-06-01 07:15:26] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 4 ms to minimize.
[2024-06-01 07:15:26] [INFO ] Deduced a trap composed of 141 places in 202 ms of which 4 ms to minimize.
[2024-06-01 07:15:26] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 5 ms to minimize.
[2024-06-01 07:15:26] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 4 ms to minimize.
[2024-06-01 07:15:27] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 3 ms to minimize.
[2024-06-01 07:15:27] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:15:27] [INFO ] Deduced a trap composed of 20 places in 179 ms of which 4 ms to minimize.
[2024-06-01 07:15:27] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 4 ms to minimize.
[2024-06-01 07:15:27] [INFO ] Deduced a trap composed of 30 places in 178 ms of which 3 ms to minimize.
[2024-06-01 07:15:27] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:15:28] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:15:28] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:15:28] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:15:28] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 3 ms to minimize.
[2024-06-01 07:15:28] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:15:28] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 3 ms to minimize.
[2024-06-01 07:15:28] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 4470 ms
[2024-06-01 07:15:29] [INFO ] Computed and/alt/rep : 629/987/629 causal constraints (skipped 40 transitions) in 43 ms.
[2024-06-01 07:15:29] [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.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)
[2024-06-01 07:15:29] [INFO ] [Real]Absence check using 78 positive place invariants in 36 ms returned sat
[2024-06-01 07:15:29] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 20 ms returned sat
[2024-06-01 07:15:29] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 8 places in 242 ms of which 5 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:15:30] [INFO ] [Nat]Absence check using 78 positive place invariants in 34 ms returned sat
[2024-06-01 07:15:30] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 17 ms returned sat
[2024-06-01 07:15:30] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 8 places in 208 ms of which 4 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 15 places in 219 ms of which 4 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 14 places in 253 ms of which 5 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 11 places in 261 ms of which 5 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 4 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 5 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 16 places in 223 ms of which 5 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 25 places in 238 ms of which 4 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 25 places in 217 ms of which 5 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 23 places in 221 ms of which 4 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 5 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 5 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 37 places in 204 ms of which 3 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 22 places in 223 ms of which 4 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 20 places in 251 ms of which 5 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 146 places in 238 ms of which 5 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 20 places in 225 ms of which 4 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 26 places in 250 ms of which 5 ms to minimize.
[2024-06-01 07:15:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 07:15:35] [INFO ] [Real]Absence check using 78 positive place invariants in 35 ms returned sat
[2024-06-01 07:15:35] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 18 ms returned sat
[2024-06-01 07:15:35] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 13 places in 254 ms of which 5 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:15:36] [INFO ] [Nat]Absence check using 78 positive place invariants in 34 ms returned sat
[2024-06-01 07:15:36] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 16 ms returned sat
[2024-06-01 07:15:36] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 4 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 8 places in 258 ms of which 5 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 12 places in 230 ms of which 5 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 142 places in 246 ms of which 5 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 15 places in 254 ms of which 6 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 8 places in 231 ms of which 5 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 15 places in 230 ms of which 5 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 5 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 15 places in 224 ms of which 4 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3272 ms
[2024-06-01 07:15:39] [INFO ] Computed and/alt/rep : 629/987/629 causal constraints (skipped 40 transitions) in 43 ms.
[2024-06-01 07:15:41] [INFO ] Added : 160 causal constraints over 32 iterations in 1271 ms. Result :unknown
[2024-06-01 07:15:41] [INFO ] [Real]Absence check using 78 positive place invariants in 40 ms returned sat
[2024-06-01 07:15:41] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 21 ms returned sat
[2024-06-01 07:15:41] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 8 places in 279 ms of which 5 ms to minimize.
[2024-06-01 07:15:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:15:42] [INFO ] [Nat]Absence check using 78 positive place invariants in 34 ms returned sat
[2024-06-01 07:15:42] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 16 ms returned sat
[2024-06-01 07:15:42] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2024-06-01 07:15:42] [INFO ] Deduced a trap composed of 8 places in 263 ms of which 5 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 8 places in 309 ms of which 5 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 12 places in 263 ms of which 4 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 15 places in 277 ms of which 4 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 16 places in 242 ms of which 5 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 23 places in 248 ms of which 8 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 24 places in 232 ms of which 4 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 18 places in 229 ms of which 4 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 3 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 25 places in 235 ms of which 4 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 39 places in 235 ms of which 4 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 26 places in 196 ms of which 5 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 34 places in 177 ms of which 3 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 4 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 4 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 4 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 40 places in 193 ms of which 5 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 131 places in 182 ms of which 3 ms to minimize.
[2024-06-01 07:15:47] [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, 1, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 670/670 transitions.
Graph (trivial) has 434 edges and 757 vertex of which 7 / 757 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1512 edges and 751 vertex of which 742 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 171 transitions
Trivial Post-agglo rules discarded 171 transitions
Performed 171 trivial Post agglomeration. Transition count delta: 171
Iterating post reduction 0 with 171 rules applied. Total rules applied 173 place count 742 transition count 490
Reduce places removed 171 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 174 rules applied. Total rules applied 347 place count 571 transition count 487
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 350 place count 568 transition count 487
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 113 Pre rules applied. Total rules applied 350 place count 568 transition count 374
Deduced a syphon composed of 113 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 250 rules applied. Total rules applied 600 place count 431 transition count 374
Discarding 97 places :
Symmetric choice reduction at 3 with 97 rule applications. Total rules 697 place count 334 transition count 277
Iterating global reduction 3 with 97 rules applied. Total rules applied 794 place count 334 transition count 277
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 794 place count 334 transition count 268
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 814 place count 323 transition count 268
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 815 place count 322 transition count 267
Iterating global reduction 3 with 1 rules applied. Total rules applied 816 place count 322 transition count 267
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 1056 place count 201 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1058 place count 200 transition count 151
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1060 place count 200 transition count 149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1062 place count 198 transition count 149
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1063 place count 198 transition count 149
Applied a total of 1063 rules in 221 ms. Remains 198 /757 variables (removed 559) and now considering 149/670 (removed 521) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 231 ms. Remains : 198/757 places, 149/670 transitions.
// Phase 1: matrix 149 rows 198 cols
[2024-06-01 07:15:47] [INFO ] Computed 89 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 0] Max Struct:[1, 1, 1, 1]
FORMULA BusinessProcesses-PT-19-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (48554 resets) in 3305 ms. (302 steps per ms)
FORMULA BusinessProcesses-PT-19-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (25649 resets) in 2260 ms. (442 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 30196 ms.
ITS solved all properties within timeout

BK_STOP 1717226153177

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="BusinessProcesses-PT-19"
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 BusinessProcesses-PT-19, 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 r472-tajo-171620399800597"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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