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.r048-tajo-171620399600485.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 itstools
Input is BusinessProcesses-PT-05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399600485
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Apr 11 16:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 11 16:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 11 16:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 85K 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-05-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716333790365

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-21 23:23:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:23:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:23:11] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2024-05-21 23:23:11] [INFO ] Transformed 368 places.
[2024-05-21 23:23:11] [INFO ] Transformed 319 transitions.
[2024-05-21 23:23:11] [INFO ] Found NUPN structural information;
[2024-05-21 23:23:11] [INFO ] Parsed PT model containing 368 places and 319 transitions and 854 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 1 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 318 rows 367 cols
[2024-05-21 23:23:11] [INFO ] Computed 57 invariants in 27 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 (86 resets) in 46 ms. (212 steps per ms)
FORMULA BusinessProcesses-PT-05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20001 steps (34 resets) in 32 ms. (606 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-05-21 23:23:12] [INFO ] Invariant cache hit.
[2024-05-21 23:23:12] [INFO ] [Real]Absence check using 41 positive place invariants in 22 ms returned sat
[2024-05-21 23:23:12] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 12 ms returned sat
[2024-05-21 23:23:12] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2024-05-21 23:23:12] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 11 ms to minimize.
[2024-05-21 23:23:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:23:13] [INFO ] [Nat]Absence check using 41 positive place invariants in 23 ms returned sat
[2024-05-21 23:23:13] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 3 ms returned sat
[2024-05-21 23:23:14] [INFO ] [Nat]Absence check using state equation in 1251 ms returned sat
[2024-05-21 23:23:14] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 4 ms to minimize.
[2024-05-21 23:23:14] [INFO ] Deduced a trap composed of 8 places in 247 ms of which 3 ms to minimize.
[2024-05-21 23:23:15] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 4 ms to minimize.
[2024-05-21 23:23:15] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 6 ms to minimize.
[2024-05-21 23:23:15] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:23:15] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:23:15] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:23:15] [INFO ] Deduced a trap composed of 81 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:23:15] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:23:16] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:23:16] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:23:16] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 5 ms to minimize.
[2024-05-21 23:23:16] [INFO ] Deduced a trap composed of 84 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:23:16] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:23:16] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 3 ms to minimize.
[2024-05-21 23:23:17] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 2 ms to minimize.
[2024-05-21 23:23:17] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:23:17] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:23:17] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:23:17] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:23:17] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:23:17] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:23:17] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:23:18] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:23: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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 23:23:18] [INFO ] [Real]Absence check using 41 positive place invariants in 16 ms returned sat
[2024-05-21 23:23:18] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 4 ms returned sat
[2024-05-21 23:23:18] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2024-05-21 23:23:18] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:23:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:23:18] [INFO ] [Nat]Absence check using 41 positive place invariants in 18 ms returned sat
[2024-05-21 23:23:18] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 4 ms returned sat
[2024-05-21 23:23:18] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2024-05-21 23:23:18] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:23:18] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:23:19] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:23:19] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 3 ms to minimize.
[2024-05-21 23:23:19] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:23:19] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:23:19] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:23:19] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:23:19] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 11 ms to minimize.
[2024-05-21 23:23:19] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:23:19] [INFO ] Deduced a trap composed of 91 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:23:20] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:23:20] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:23:20] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 3 ms to minimize.
[2024-05-21 23:23:20] [INFO ] Deduced a trap composed of 88 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:23:20] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:23:20] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:23:20] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:23:20] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:23:20] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:23:20] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2048 ms
[2024-05-21 23:23:20] [INFO ] Computed and/alt/rep : 291/355/291 causal constraints (skipped 26 transitions) in 33 ms.
[2024-05-21 23:23:21] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:23:21] [INFO ] Deduced a trap composed of 94 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:23:21] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:23:21] [INFO ] Deduced a trap composed of 86 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:23:21] [INFO ] Deduced a trap composed of 89 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:23:21] [INFO ] Deduced a trap composed of 93 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 89 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 91 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 91 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 94 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 93 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1272 ms
[2024-05-21 23:23:22] [INFO ] Added : 174 causal constraints over 36 iterations in 1993 ms. Result :sat
Minimization took 175 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1] Max Struct:[1, 1]
Support contains 2 out of 367 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 367/367 places, 318/318 transitions.
Graph (trivial) has 231 edges and 367 vertex of which 8 / 367 are part of one of the 1 SCC in 3 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 700 edges and 360 vertex of which 357 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 88 rules applied. Total rules applied 90 place count 357 transition count 219
Reduce places removed 87 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 88 rules applied. Total rules applied 178 place count 270 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 179 place count 269 transition count 218
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 179 place count 269 transition count 169
Deduced a syphon composed of 49 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 111 rules applied. Total rules applied 290 place count 207 transition count 169
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 348 place count 149 transition count 111
Iterating global reduction 3 with 58 rules applied. Total rules applied 406 place count 149 transition count 111
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 406 place count 149 transition count 105
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 421 place count 140 transition count 105
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 535 place count 83 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 536 place count 82 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 537 place count 81 transition count 47
Applied a total of 537 rules in 98 ms. Remains 81 /367 variables (removed 286) and now considering 47/318 (removed 271) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 81/367 places, 47/318 transitions.
// Phase 1: matrix 47 rows 81 cols
[2024-05-21 23:23:23] [INFO ] Computed 39 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1] Max Struct:[1, 1]
FORMULA BusinessProcesses-PT-05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (39023 resets) in 1868 ms. (535 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 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 )
[2024-05-21 23:23:25] [INFO ] Flatten gal took : 35 ms
[2024-05-21 23:23:25] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:23:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality616625610712591163.gal : 6 ms
[2024-05-21 23:23:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1011329925323630086.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality616625610712591163.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1011329925323630086.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 13700 ms.

BK_STOP 1716333805371

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-05"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-05, 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 r048-tajo-171620399600485"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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