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.r575-smll-171734919600117.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 greatspnxred
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 r575-smll-171734919600117
=====================================================================

--------------------
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 1717364889939

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 21:48:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 21:48:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:48:13] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2024-06-02 21:48:13] [INFO ] Transformed 192 places.
[2024-06-02 21:48:13] [INFO ] Transformed 475 transitions.
[2024-06-02 21:48:13] [INFO ] Found NUPN structural information;
[2024-06-02 21:48:13] [INFO ] Parsed PT model containing 192 places and 475 transitions and 1522 arcs in 479 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 21:48:13] [INFO ] Computed 7 invariants in 47 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 94 ms. (105 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 488 ms. (265 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 21:48:14] [INFO ] Invariant cache hit.
[2024-06-02 21:48:14] [INFO ] [Real]Absence check using 7 positive place invariants in 15 ms returned sat
[2024-06-02 21:48:14] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2024-06-02 21:48:15] [INFO ] Deduced a trap composed of 29 places in 329 ms of which 40 ms to minimize.
[2024-06-02 21:48:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:48:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2024-06-02 21:48:15] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2024-06-02 21:48:16] [INFO ] Deduced a trap composed of 29 places in 269 ms of which 5 ms to minimize.
[2024-06-02 21:48:16] [INFO ] Deduced a trap composed of 27 places in 228 ms of which 4 ms to minimize.
[2024-06-02 21:48:16] [INFO ] Deduced a trap composed of 97 places in 210 ms of which 4 ms to minimize.
[2024-06-02 21:48:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 867 ms
[2024-06-02 21:48:16] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 102 ms.
[2024-06-02 21:48:19] [INFO ] Deduced a trap composed of 52 places in 270 ms of which 3 ms to minimize.
[2024-06-02 21:48:20] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 3 ms to minimize.
[2024-06-02 21:48:20] [INFO ] Deduced a trap composed of 21 places in 240 ms of which 3 ms to minimize.
[2024-06-02 21:48:20] [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 21:48:20] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned sat
[2024-06-02 21:48:20] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2024-06-02 21:48:21] [INFO ] Deduced a trap composed of 33 places in 231 ms of which 4 ms to minimize.
[2024-06-02 21:48:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:48:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 21:48:21] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2024-06-02 21:48:21] [INFO ] Deduced a trap composed of 33 places in 249 ms of which 4 ms to minimize.
[2024-06-02 21:48:21] [INFO ] Deduced a trap composed of 30 places in 236 ms of which 3 ms to minimize.
[2024-06-02 21:48:22] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 3 ms to minimize.
[2024-06-02 21:48:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 768 ms
[2024-06-02 21:48:22] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 69 ms.
[2024-06-02 21:48:25] [INFO ] Deduced a trap composed of 19 places in 200 ms of which 3 ms to minimize.
[2024-06-02 21:48:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 318 ms
[2024-06-02 21:48:25] [INFO ] Added : 221 causal constraints over 46 iterations in 3252 ms. Result :sat
Minimization took 375 ms.
[2024-06-02 21:48:25] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 21:48:26] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2024-06-02 21:48:26] [INFO ] Deduced a trap composed of 27 places in 201 ms of which 4 ms to minimize.
[2024-06-02 21:48:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:48:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2024-06-02 21:48:26] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2024-06-02 21:48:27] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 3 ms to minimize.
[2024-06-02 21:48:27] [INFO ] Deduced a trap composed of 26 places in 243 ms of which 4 ms to minimize.
[2024-06-02 21:48:27] [INFO ] Deduced a trap composed of 46 places in 189 ms of which 3 ms to minimize.
[2024-06-02 21:48:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 724 ms
[2024-06-02 21:48:27] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 53 ms.
[2024-06-02 21:48:30] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
[2024-06-02 21:48:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2024-06-02 21:48:30] [INFO ] Added : 255 causal constraints over 51 iterations in 3069 ms. Result :sat
Minimization took 506 ms.
[2024-06-02 21:48:31] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:48:31] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2024-06-02 21:48:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:48:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2024-06-02 21:48:31] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2024-06-02 21:48:31] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 2 ms to minimize.
[2024-06-02 21:48:32] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
[2024-06-02 21:48:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 379 ms
[2024-06-02 21:48:32] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 68 ms.
[2024-06-02 21:48:35] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 3 ms to minimize.
[2024-06-02 21:48:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2024-06-02 21:48:35] [INFO ] Added : 258 causal constraints over 52 iterations in 3293 ms. Result :sat
Minimization took 343 ms.
[2024-06-02 21:48:35] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned sat
[2024-06-02 21:48:36] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2024-06-02 21:48:36] [INFO ] Deduced a trap composed of 26 places in 242 ms of which 3 ms to minimize.
[2024-06-02 21:48:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:48:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2024-06-02 21:48:36] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2024-06-02 21:48:37] [INFO ] Deduced a trap composed of 26 places in 260 ms of which 5 ms to minimize.
[2024-06-02 21:48:37] [INFO ] Deduced a trap composed of 31 places in 247 ms of which 9 ms to minimize.
[2024-06-02 21:48:37] [INFO ] Deduced a trap composed of 46 places in 208 ms of which 4 ms to minimize.
[2024-06-02 21:48:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 826 ms
[2024-06-02 21:48:37] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 56 ms.
[2024-06-02 21:48:40] [INFO ] Added : 222 causal constraints over 45 iterations in 2419 ms. Result :sat
Minimization took 503 ms.
[2024-06-02 21:48:40] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 21:48:40] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2024-06-02 21:48:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:48:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2024-06-02 21:48:41] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2024-06-02 21:48:41] [INFO ] Deduced a trap composed of 37 places in 225 ms of which 3 ms to minimize.
[2024-06-02 21:48:41] [INFO ] Deduced a trap composed of 26 places in 213 ms of which 3 ms to minimize.
[2024-06-02 21:48:41] [INFO ] Deduced a trap composed of 66 places in 110 ms of which 2 ms to minimize.
[2024-06-02 21:48:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 652 ms
[2024-06-02 21:48:41] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 54 ms.
[2024-06-02 21:48:44] [INFO ] Added : 275 causal constraints over 55 iterations in 2933 ms. Result :sat
Minimization took 322 ms.
[2024-06-02 21:48:45] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 21:48:45] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2024-06-02 21:48:45] [INFO ] Deduced a trap composed of 27 places in 238 ms of which 3 ms to minimize.
[2024-06-02 21:48:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:48:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2024-06-02 21:48:46] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2024-06-02 21:48:46] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 3 ms to minimize.
[2024-06-02 21:48:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2024-06-02 21:48:46] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 48 ms.
[2024-06-02 21:48:48] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 3 ms to minimize.
[2024-06-02 21:48:48] [INFO ] Deduced a trap composed of 40 places in 200 ms of which 3 ms to minimize.
[2024-06-02 21:48:48] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 4 ms to minimize.
[2024-06-02 21:48:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 752 ms
[2024-06-02 21:48:48] [INFO ] Added : 205 causal constraints over 43 iterations in 2664 ms. Result :sat
Minimization took 281 ms.
[2024-06-02 21:48:49] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 21:48:49] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2024-06-02 21:48:49] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 41 ms.
[2024-06-02 21:48:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:48:49] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:48:50] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2024-06-02 21:48:50] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 46 ms.
[2024-06-02 21:48:52] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 3 ms to minimize.
[2024-06-02 21:48:52] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 4 ms to minimize.
[2024-06-02 21:48:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 527 ms
[2024-06-02 21:48:52] [INFO ] Added : 222 causal constraints over 45 iterations in 2827 ms. Result :sat
Minimization took 233 ms.
[2024-06-02 21:48:53] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 21:48:53] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2024-06-02 21:48:53] [INFO ] Deduced a trap composed of 65 places in 156 ms of which 4 ms to minimize.
[2024-06-02 21:48:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:48:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 21:48:53] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2024-06-02 21:48:54] [INFO ] Deduced a trap composed of 65 places in 184 ms of which 4 ms to minimize.
[2024-06-02 21:48:54] [INFO ] Deduced a trap composed of 41 places in 207 ms of which 3 ms to minimize.
[2024-06-02 21:48:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 462 ms
[2024-06-02 21:48:54] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 59 ms.
[2024-06-02 21:48:57] [INFO ] Deduced a trap composed of 32 places in 233 ms of which 4 ms to minimize.
[2024-06-02 21:48:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 343 ms
[2024-06-02 21:48:57] [INFO ] Added : 228 causal constraints over 46 iterations in 3075 ms. Result :sat
Minimization took 282 ms.
[2024-06-02 21:48:57] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 21:48:58] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-06-02 21:48:58] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 3 ms to minimize.
[2024-06-02 21:48:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:48:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 21:48:58] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2024-06-02 21:48:58] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
[2024-06-02 21:48:58] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-06-02 21:48:58] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 2 ms to minimize.
[2024-06-02 21:48:59] [INFO ] Deduced a trap composed of 99 places in 132 ms of which 2 ms to minimize.
[2024-06-02 21:48:59] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 2 ms to minimize.
[2024-06-02 21:48:59] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 2 ms to minimize.
[2024-06-02 21:48:59] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 2 ms to minimize.
[2024-06-02 21:48:59] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
[2024-06-02 21:48:59] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 2 ms to minimize.
[2024-06-02 21:48:59] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 3 ms to minimize.
[2024-06-02 21:48:59] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1488 ms
[2024-06-02 21:49:00] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 34 ms.
[2024-06-02 21:49:02] [INFO ] Deduced a trap composed of 18 places in 251 ms of which 3 ms to minimize.
[2024-06-02 21:49:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 343 ms
[2024-06-02 21:49:02] [INFO ] Added : 250 causal constraints over 51 iterations in 2784 ms. Result :sat
Minimization took 414 ms.
[2024-06-02 21:49:03] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 21:49:03] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2024-06-02 21:49:03] [INFO ] Deduced a trap composed of 114 places in 237 ms of which 3 ms to minimize.
[2024-06-02 21:49:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:49:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2024-06-02 21:49:04] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2024-06-02 21:49:04] [INFO ] Deduced a trap composed of 114 places in 231 ms of which 3 ms to minimize.
[2024-06-02 21:49:04] [INFO ] Deduced a trap composed of 28 places in 210 ms of which 3 ms to minimize.
[2024-06-02 21:49:04] [INFO ] Deduced a trap composed of 49 places in 201 ms of which 3 ms to minimize.
[2024-06-02 21:49:05] [INFO ] Deduced a trap composed of 26 places in 226 ms of which 3 ms to minimize.
[2024-06-02 21:49:05] [INFO ] Deduced a trap composed of 44 places in 188 ms of which 3 ms to minimize.
[2024-06-02 21:49:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1195 ms
[2024-06-02 21:49:05] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 59 ms.
[2024-06-02 21:49:08] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 5 ms to minimize.
[2024-06-02 21:49:08] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 3 ms to minimize.
[2024-06-02 21:49:08] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 492 ms
Maximisation of solution failed !
Minimization took 2 ms.
[2024-06-02 21:49:08] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 21:49:09] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2024-06-02 21:49:09] [INFO ] Deduced a trap composed of 30 places in 199 ms of which 4 ms to minimize.
[2024-06-02 21:49:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:49:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2024-06-02 21:49:09] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2024-06-02 21:49:10] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 3 ms to minimize.
[2024-06-02 21:49:10] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 3 ms to minimize.
[2024-06-02 21:49:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 441 ms
[2024-06-02 21:49:10] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 53 ms.
[2024-06-02 21:49:13] [INFO ] Added : 266 causal constraints over 54 iterations in 2905 ms. Result :sat
Minimization took 323 ms.
[2024-06-02 21:49:13] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned sat
[2024-06-02 21:49:13] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2024-06-02 21:49:14] [INFO ] Deduced a trap composed of 30 places in 170 ms of which 4 ms to minimize.
[2024-06-02 21:49:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:49:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 21:49:14] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2024-06-02 21:49:14] [INFO ] Deduced a trap composed of 30 places in 207 ms of which 4 ms to minimize.
[2024-06-02 21:49:14] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 3 ms to minimize.
[2024-06-02 21:49:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 421 ms
[2024-06-02 21:49:14] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 63 ms.
[2024-06-02 21:49:17] [INFO ] Deduced a trap composed of 52 places in 198 ms of which 3 ms to minimize.
[2024-06-02 21:49:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 405 ms
[2024-06-02 21:49:18] [INFO ] Added : 254 causal constraints over 51 iterations in 3346 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
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[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]
Support contains 12 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 473/473 transitions.
Graph (trivial) has 200 edges and 192 vertex of which 9 / 192 are part of one of the 3 SCC in 5 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 4 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 0 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 19 Post agglomeration using F-continuation condition.Transition count delta: -139
Deduced a syphon composed of 19 places in 4 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 240 place count 75 transition count 459
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 245 place count 75 transition count 454
Drop transitions (Redundant composition of simpler transitions.) removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 5 with 58 rules applied. Total rules applied 303 place count 75 transition count 396
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 305 place count 74 transition count 409
Free-agglomeration rule applied 14 times with reduction of 6 identical transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 319 place count 74 transition count 389
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 349 place count 60 transition count 373
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 361 place count 60 transition count 361
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 362 place count 59 transition count 360
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 36 edges and 57 vertex of which 9 / 57 are part of one of the 4 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 365 place count 52 transition count 360
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 7 with 45 rules applied. Total rules applied 410 place count 52 transition count 315
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 411 place count 51 transition count 305
Iterating global reduction 8 with 1 rules applied. Total rules applied 412 place count 51 transition count 305
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 424 place count 51 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 81 transitions
Redundant transition composition rules discarded 81 transitions
Iterating global reduction 9 with 81 rules applied. Total rules applied 505 place count 51 transition count 212
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 506 place count 51 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 507 place count 50 transition count 211
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 507 place count 50 transition count 210
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 509 place count 49 transition count 210
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 511 place count 47 transition count 200
Iterating global reduction 11 with 2 rules applied. Total rules applied 513 place count 47 transition count 200
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 515 place count 46 transition count 199
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 517 place count 45 transition count 210
Applied a total of 517 rules in 219 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 235 ms. Remains : 45/192 places, 210/473 transitions.
[2024-06-02 21:49:19] [INFO ] Flow matrix only has 194 transitions (discarded 16 similar events)
// Phase 1: matrix 194 rows 45 cols
[2024-06-02 21:49:19] [INFO ] Computed 5 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[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]
RANDOM walk for 1000000 steps (52 resets) in 1433 ms. (697 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-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 540 ms. (1848 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 69183 ms.
ITS solved all properties within timeout

BK_STOP 1717364961962

--------------------
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="greatspnxred"
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 greatspnxred"
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 r575-smll-171734919600117"
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 ;