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.r579-smll-171734921300117.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 MedleyA-PT-15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921300117
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.4K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 110K Jun 2 16:33 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 MedleyA-PT-15-UpperBounds-00
FORMULA_NAME MedleyA-PT-15-UpperBounds-01
FORMULA_NAME MedleyA-PT-15-UpperBounds-02
FORMULA_NAME MedleyA-PT-15-UpperBounds-03
FORMULA_NAME MedleyA-PT-15-UpperBounds-04
FORMULA_NAME MedleyA-PT-15-UpperBounds-05
FORMULA_NAME MedleyA-PT-15-UpperBounds-06
FORMULA_NAME MedleyA-PT-15-UpperBounds-07
FORMULA_NAME MedleyA-PT-15-UpperBounds-08
FORMULA_NAME MedleyA-PT-15-UpperBounds-09
FORMULA_NAME MedleyA-PT-15-UpperBounds-10
FORMULA_NAME MedleyA-PT-15-UpperBounds-11
FORMULA_NAME MedleyA-PT-15-UpperBounds-12
FORMULA_NAME MedleyA-PT-15-UpperBounds-13
FORMULA_NAME MedleyA-PT-15-UpperBounds-14
FORMULA_NAME MedleyA-PT-15-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717357962226

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:52:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 19:52:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:52:44] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2024-06-02 19:52:44] [INFO ] Transformed 192 places.
[2024-06-02 19:52:44] [INFO ] Transformed 475 transitions.
[2024-06-02 19:52:44] [INFO ] Found NUPN structural information;
[2024-06-02 19:52:44] [INFO ] Parsed PT model containing 192 places and 475 transitions and 1522 arcs in 402 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 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 473 rows 192 cols
[2024-06-02 19:52:45] [INFO ] Computed 7 invariants in 35 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 (2 resets) in 75 ms. (131 steps per ms)
FORMULA MedleyA-PT-15-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130008 steps (26 resets) in 350 ms. (370 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 19:52:45] [INFO ] Invariant cache hit.
[2024-06-02 19:52:45] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned sat
[2024-06-02 19:52:46] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2024-06-02 19:52:46] [INFO ] Deduced a trap composed of 29 places in 452 ms of which 25 ms to minimize.
[2024-06-02 19:52:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:52:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 28 ms returned sat
[2024-06-02 19:52:47] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2024-06-02 19:52:47] [INFO ] Deduced a trap composed of 29 places in 274 ms of which 26 ms to minimize.
[2024-06-02 19:52:48] [INFO ] Deduced a trap composed of 27 places in 213 ms of which 3 ms to minimize.
[2024-06-02 19:52:48] [INFO ] Deduced a trap composed of 97 places in 201 ms of which 4 ms to minimize.
[2024-06-02 19:52:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 817 ms
[2024-06-02 19:52:48] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 93 ms.
[2024-06-02 19:52:51] [INFO ] Deduced a trap composed of 52 places in 254 ms of which 3 ms to minimize.
[2024-06-02 19:52:51] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 3 ms to minimize.
[2024-06-02 19:52:52] [INFO ] Deduced a trap composed of 21 places in 250 ms of which 4 ms to minimize.
[2024-06-02 19:52:52] [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.refineWithCausalOrder(DeadlockTester.java:1128)
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-02 19:52:52] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 19:52:52] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2024-06-02 19:52:52] [INFO ] Deduced a trap composed of 33 places in 195 ms of which 2 ms to minimize.
[2024-06-02 19:52:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:52:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 19:52:52] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2024-06-02 19:52:53] [INFO ] Deduced a trap composed of 33 places in 270 ms of which 4 ms to minimize.
[2024-06-02 19:52:53] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 2 ms to minimize.
[2024-06-02 19:52:53] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 2 ms to minimize.
[2024-06-02 19:52:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 615 ms
[2024-06-02 19:52:53] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 72 ms.
[2024-06-02 19:52:56] [INFO ] Deduced a trap composed of 19 places in 198 ms of which 4 ms to minimize.
[2024-06-02 19:52:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 292 ms
[2024-06-02 19:52:56] [INFO ] Added : 221 causal constraints over 46 iterations in 2822 ms. Result :sat
Minimization took 373 ms.
[2024-06-02 19:52:56] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 19:52:57] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2024-06-02 19:52:57] [INFO ] Deduced a trap composed of 27 places in 225 ms of which 4 ms to minimize.
[2024-06-02 19:52:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:52:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2024-06-02 19:52:57] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2024-06-02 19:52:58] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 3 ms to minimize.
[2024-06-02 19:52:58] [INFO ] Deduced a trap composed of 26 places in 236 ms of which 3 ms to minimize.
[2024-06-02 19:52:58] [INFO ] Deduced a trap composed of 46 places in 146 ms of which 2 ms to minimize.
[2024-06-02 19:52:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 648 ms
[2024-06-02 19:52:58] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 70 ms.
[2024-06-02 19:53:01] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 2 ms to minimize.
[2024-06-02 19:53:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2024-06-02 19:53:01] [INFO ] Added : 255 causal constraints over 51 iterations in 3153 ms. Result :sat
Minimization took 501 ms.
[2024-06-02 19:53:02] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-06-02 19:53:02] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-06-02 19:53:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:53:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 19:53:02] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-06-02 19:53:02] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 3 ms to minimize.
[2024-06-02 19:53:02] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-06-02 19:53:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 360 ms
[2024-06-02 19:53:03] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 68 ms.
[2024-06-02 19:53:06] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 3 ms to minimize.
[2024-06-02 19:53:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2024-06-02 19:53:06] [INFO ] Added : 258 causal constraints over 52 iterations in 3206 ms. Result :sat
Minimization took 325 ms.
[2024-06-02 19:53:06] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 19:53:06] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2024-06-02 19:53:07] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 3 ms to minimize.
[2024-06-02 19:53:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:53:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 19:53:07] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2024-06-02 19:53:07] [INFO ] Deduced a trap composed of 26 places in 214 ms of which 4 ms to minimize.
[2024-06-02 19:53:07] [INFO ] Deduced a trap composed of 31 places in 227 ms of which 3 ms to minimize.
[2024-06-02 19:53:08] [INFO ] Deduced a trap composed of 46 places in 213 ms of which 4 ms to minimize.
[2024-06-02 19:53:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 754 ms
[2024-06-02 19:53:08] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 53 ms.
[2024-06-02 19:53:10] [INFO ] Added : 222 causal constraints over 45 iterations in 2414 ms. Result :sat
Minimization took 502 ms.
[2024-06-02 19:53:11] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 19:53:11] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2024-06-02 19:53:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:53:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2024-06-02 19:53:11] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2024-06-02 19:53:11] [INFO ] Deduced a trap composed of 37 places in 230 ms of which 3 ms to minimize.
[2024-06-02 19:53:12] [INFO ] Deduced a trap composed of 26 places in 225 ms of which 4 ms to minimize.
[2024-06-02 19:53:12] [INFO ] Deduced a trap composed of 66 places in 99 ms of which 2 ms to minimize.
[2024-06-02 19:53:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 658 ms
[2024-06-02 19:53:12] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 60 ms.
[2024-06-02 19:53:15] [INFO ] Added : 275 causal constraints over 55 iterations in 2773 ms. Result :sat
Minimization took 334 ms.
[2024-06-02 19:53:15] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 19:53:15] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2024-06-02 19:53:15] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 3 ms to minimize.
[2024-06-02 19:53:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:53:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 19:53:16] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2024-06-02 19:53:16] [INFO ] Deduced a trap composed of 27 places in 240 ms of which 3 ms to minimize.
[2024-06-02 19:53:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 286 ms
[2024-06-02 19:53:16] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 63 ms.
[2024-06-02 19:53:19] [INFO ] Deduced a trap composed of 30 places in 192 ms of which 3 ms to minimize.
[2024-06-02 19:53:19] [INFO ] Deduced a trap composed of 40 places in 198 ms of which 3 ms to minimize.
[2024-06-02 19:53:19] [INFO ] Deduced a trap composed of 26 places in 218 ms of which 3 ms to minimize.
[2024-06-02 19:53:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 832 ms
[2024-06-02 19:53:19] [INFO ] Added : 205 causal constraints over 43 iterations in 3299 ms. Result :sat
Minimization took 284 ms.
[2024-06-02 19:53:20] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 19:53:20] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2024-06-02 19:53:20] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 56 ms.
[2024-06-02 19:53:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:53:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2024-06-02 19:53:21] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2024-06-02 19:53:21] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 70 ms.
[2024-06-02 19:53:23] [INFO ] Deduced a trap composed of 35 places in 229 ms of which 3 ms to minimize.
[2024-06-02 19:53:24] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 4 ms to minimize.
[2024-06-02 19:53:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 613 ms
[2024-06-02 19:53:24] [INFO ] Added : 222 causal constraints over 45 iterations in 3084 ms. Result :sat
Minimization took 274 ms.
[2024-06-02 19:53:24] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned sat
[2024-06-02 19:53:24] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2024-06-02 19:53:25] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 4 ms to minimize.
[2024-06-02 19:53:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:53:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2024-06-02 19:53:25] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2024-06-02 19:53:25] [INFO ] Deduced a trap composed of 65 places in 218 ms of which 3 ms to minimize.
[2024-06-02 19:53:26] [INFO ] Deduced a trap composed of 41 places in 200 ms of which 3 ms to minimize.
[2024-06-02 19:53:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 485 ms
[2024-06-02 19:53:26] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 59 ms.
[2024-06-02 19:53:28] [INFO ] Deduced a trap composed of 32 places in 225 ms of which 3 ms to minimize.
[2024-06-02 19:53:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 332 ms
[2024-06-02 19:53:29] [INFO ] Added : 228 causal constraints over 46 iterations in 3011 ms. Result :sat
Minimization took 287 ms.
[2024-06-02 19:53:29] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 19:53:29] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2024-06-02 19:53:29] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 2 ms to minimize.
[2024-06-02 19:53:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:53:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2024-06-02 19:53:30] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2024-06-02 19:53:30] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 3 ms to minimize.
[2024-06-02 19:53:30] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 2 ms to minimize.
[2024-06-02 19:53:30] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 2 ms to minimize.
[2024-06-02 19:53:30] [INFO ] Deduced a trap composed of 99 places in 218 ms of which 3 ms to minimize.
[2024-06-02 19:53:31] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 2 ms to minimize.
[2024-06-02 19:53:31] [INFO ] Deduced a trap composed of 44 places in 180 ms of which 3 ms to minimize.
[2024-06-02 19:53:31] [INFO ] Deduced a trap composed of 44 places in 228 ms of which 3 ms to minimize.
[2024-06-02 19:53:31] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 3 ms to minimize.
[2024-06-02 19:53:31] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 2 ms to minimize.
[2024-06-02 19:53:32] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 3 ms to minimize.
[2024-06-02 19:53:32] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1987 ms
[2024-06-02 19:53:32] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 54 ms.
[2024-06-02 19:53:34] [INFO ] Deduced a trap composed of 18 places in 240 ms of which 4 ms to minimize.
[2024-06-02 19:53:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 327 ms
Maximisation of solution failed !
Minimization took 1 ms.
[2024-06-02 19:53:35] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 19:53:35] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2024-06-02 19:53:35] [INFO ] Deduced a trap composed of 114 places in 201 ms of which 3 ms to minimize.
[2024-06-02 19:53:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:53:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2024-06-02 19:53:35] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2024-06-02 19:53:36] [INFO ] Deduced a trap composed of 114 places in 187 ms of which 4 ms to minimize.
[2024-06-02 19:53:36] [INFO ] Deduced a trap composed of 28 places in 174 ms of which 3 ms to minimize.
[2024-06-02 19:53:36] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 2 ms to minimize.
[2024-06-02 19:53:36] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 2 ms to minimize.
[2024-06-02 19:53:36] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 2 ms to minimize.
[2024-06-02 19:53:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 947 ms
[2024-06-02 19:53:36] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 59 ms.
[2024-06-02 19:53:39] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 3 ms to minimize.
[2024-06-02 19:53:40] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 3 ms to minimize.
[2024-06-02 19:53:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 620 ms
[2024-06-02 19:53:40] [INFO ] Added : 248 causal constraints over 52 iterations in 3671 ms. Result :sat
Minimization took 49 ms.
[2024-06-02 19:53:40] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 19:53:40] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2024-06-02 19:53:41] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 3 ms to minimize.
[2024-06-02 19:53:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:53:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 19:53:41] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2024-06-02 19:53:41] [INFO ] Deduced a trap composed of 30 places in 181 ms of which 3 ms to minimize.
[2024-06-02 19:53:41] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 3 ms to minimize.
[2024-06-02 19:53:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 388 ms
[2024-06-02 19:53:41] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 57 ms.
[2024-06-02 19:53:44] [INFO ] Added : 266 causal constraints over 54 iterations in 3074 ms. Result :sat
Minimization took 334 ms.
[2024-06-02 19:53:45] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 19:53:45] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2024-06-02 19:53:45] [INFO ] Deduced a trap composed of 30 places in 176 ms of which 3 ms to minimize.
[2024-06-02 19:53:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:53:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 19:53:46] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2024-06-02 19:53:46] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 3 ms to minimize.
[2024-06-02 19:53:46] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 3 ms to minimize.
[2024-06-02 19:53:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 419 ms
[2024-06-02 19:53:46] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 53 ms.
[2024-06-02 19:53:49] [INFO ] Deduced a trap composed of 52 places in 202 ms of which 3 ms to minimize.
[2024-06-02 19:53:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 409 ms
[2024-06-02 19:53:49] [INFO ] Added : 254 causal constraints over 51 iterations in 2806 ms. Result :sat
Minimization took 474 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[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]
FORMULA MedleyA-PT-15-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-15-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 11 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 473/473 transitions.
Graph (trivial) has 203 edges and 192 vertex of which 9 / 192 are part of one of the 3 SCC in 6 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 186 transition count 437
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 57 place count 159 transition count 435
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 57 place count 159 transition count 429
Deduced a syphon composed of 6 places in 5 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 69 place count 153 transition count 429
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 110 place count 112 transition count 358
Iterating global reduction 2 with 41 rules applied. Total rules applied 151 place count 112 transition count 358
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 165 place count 112 transition count 344
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 165 place count 112 transition count 336
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 181 place count 104 transition count 336
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 182 place count 104 transition count 335
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 184 place count 102 transition count 328
Iterating global reduction 4 with 2 rules applied. Total rules applied 186 place count 102 transition count 328
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 202 place count 94 transition count 320
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -152
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 242 place count 74 transition count 472
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 249 place count 74 transition count 465
Drop transitions (Redundant composition of simpler transitions.) removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 5 with 72 rules applied. Total rules applied 321 place count 74 transition count 393
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 323 place count 73 transition count 406
Free-agglomeration rule applied 14 times with reduction of 6 identical transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 337 place count 73 transition count 386
Reduce places removed 14 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 30 rules applied. Total rules applied 367 place count 59 transition count 370
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 379 place count 59 transition count 358
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 380 place count 58 transition count 357
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 37 edges and 56 vertex of which 7 / 56 are part of one of the 3 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 383 place count 52 transition count 357
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 7 with 40 rules applied. Total rules applied 423 place count 52 transition count 317
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 424 place count 51 transition count 307
Iterating global reduction 8 with 1 rules applied. Total rules applied 425 place count 51 transition count 307
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 437 place count 51 transition count 295
Drop transitions (Redundant composition of simpler transitions.) removed 76 transitions
Redundant transition composition rules discarded 76 transitions
Iterating global reduction 9 with 76 rules applied. Total rules applied 513 place count 51 transition count 219
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 514 place count 51 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 515 place count 50 transition count 218
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 515 place count 50 transition count 217
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 517 place count 49 transition count 217
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 519 place count 47 transition count 207
Iterating global reduction 11 with 2 rules applied. Total rules applied 521 place count 47 transition count 207
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 523 place count 46 transition count 206
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 525 place count 45 transition count 217
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 11 with 7 rules applied. Total rules applied 532 place count 45 transition count 210
Applied a total of 532 rules in 293 ms. Remains 45 /192 variables (removed 147) and now considering 210/473 (removed 263) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 312 ms. Remains : 45/192 places, 210/473 transitions.
[2024-06-02 19:53:51] [INFO ] Flow matrix only has 194 transitions (discarded 16 similar events)
// Phase 1: matrix 194 rows 45 cols
[2024-06-02 19:53:51] [INFO ] Computed 5 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (115 resets) in 2001 ms. (499 steps per ms)
FORMULA MedleyA-PT-15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000000 steps (162 resets) in 2791 ms. (716 steps per ms)
FORMULA MedleyA-PT-15-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 71601 ms.
ITS solved all properties within timeout

BK_STOP 1717358036159

--------------------
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="MedleyA-PT-15"
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 MedleyA-PT-15, 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 r579-smll-171734921300117"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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