Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r153-tall-174876824800071.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is Peterson-COL-4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-174876824800071
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 44K May 29 14:32 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

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Peterson-COL-4-UpperBounds-00
FORMULA_NAME Peterson-COL-4-UpperBounds-01
FORMULA_NAME Peterson-COL-4-UpperBounds-02
FORMULA_NAME Peterson-COL-4-UpperBounds-03
FORMULA_NAME Peterson-COL-4-UpperBounds-04
FORMULA_NAME Peterson-COL-4-UpperBounds-05
FORMULA_NAME Peterson-COL-4-UpperBounds-06
FORMULA_NAME Peterson-COL-4-UpperBounds-07
FORMULA_NAME Peterson-COL-4-UpperBounds-08
FORMULA_NAME Peterson-COL-4-UpperBounds-09
FORMULA_NAME Peterson-COL-4-UpperBounds-10
FORMULA_NAME Peterson-COL-4-UpperBounds-11
FORMULA_NAME Peterson-COL-4-UpperBounds-12
FORMULA_NAME Peterson-COL-4-UpperBounds-13
FORMULA_NAME Peterson-COL-4-UpperBounds-14
FORMULA_NAME Peterson-COL-4-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748841532165

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-02 05:18:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 05:18:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:18:53] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-02 05:18:53] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 05:18:54] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 554 ms
[2025-06-02 05:18:54] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 500 PT places and 795.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Reduction of identical properties reduced properties to check from 16 to 9
[2025-06-02 05:18:54] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 4 ms.
[2025-06-02 05:18:54] [INFO ] Skeletonized 9 HLPN properties in 0 ms.
Reduce places removed 2 places and 0 transitions.
// Phase 1: matrix 14 rows 9 cols
[2025-06-02 05:18:54] [INFO ] Computed 1 invariants in 4 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 5, 0, 0, 0, 0, 0, 5, 4] Max Struct:[5, 5, 5, 5, 5, 5, 5, 5, 4]
FORMULA Peterson-COL-4-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-4-UpperBounds-14 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-4-UpperBounds-07 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-4-UpperBounds-09 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-4-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-02 05:18:54] [INFO ] Invariant cache hit.
[2025-06-02 05:18:54] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2025-06-02 05:18:54] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-02 05:18:54] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 05:18:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:18:54] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-02 05:18:54] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 05:18:54] [INFO ] Added : 11 causal constraints over 3 iterations in 16 ms. Result :sat
Minimization took 7 ms.
[2025-06-02 05:18:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:18:54] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:18:54] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 05:18:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:18:54] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:18:54] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 05:18:54] [INFO ] Added : 11 causal constraints over 5 iterations in 18 ms. Result :sat
Minimization took 5 ms.
[2025-06-02 05:18:54] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:18:54] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:18:54] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:18:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:18:54] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:18:54] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:18:54] [INFO ] Added : 11 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2025-06-02 05:18:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:18:54] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:18:54] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 05:18:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:18:54] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:18:54] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:18:54] [INFO ] Added : 11 causal constraints over 4 iterations in 12 ms. Result :sat
Minimization took 5 ms.
[2025-06-02 05:18:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:18:54] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:18:54] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:18:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:18:54] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:18:54] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:18:54] [INFO ] Added : 12 causal constraints over 4 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2025-06-02 05:18:54] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:18:54] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:18:54] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:18:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:18:54] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-02 05:18:54] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:18:54] [INFO ] Added : 11 causal constraints over 4 iterations in 17 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[5, 5, 5, 5, 5, 5]
Domain [Process(5), Tour(4), Process(5)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 4)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2025-06-02 05:18:55] [INFO ] Unfolded HLPN to a Petri net with 500 places and 730 transitions 2280 arcs in 42 ms.
[2025-06-02 05:18:55] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Deduced a syphon composed of 20 places in 4 ms
Reduce places removed 20 places and 40 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[5, 5, 5, 5, 5, 5]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[5, 5, 5, 5, 5, 5]
[2025-06-02 05:18:55] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2025-06-02 05:18:55] [INFO ] Computed 19 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[5, 5, 5, 5, 5, 5]
RANDOM walk for 10000 steps (2 resets) in 72 ms. (136 steps per ms)
FORMULA Peterson-COL-4-UpperBounds-05 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-4-UpperBounds-02 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-4-UpperBounds-12 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-4-UpperBounds-00 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 2, 1, 4] Max Struct:[5, 5, 5, 5]
[2025-06-02 05:18:55] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2025-06-02 05:18:55] [INFO ] Invariant cache hit.
[2025-06-02 05:18:55] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2025-06-02 05:18:55] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2025-06-02 05:18:55] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2025-06-02 05:18:55] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-02 05:18:55] [INFO ] [Real]Added 116 Read/Feed constraints in 28 ms returned sat
[2025-06-02 05:18:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:55] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2025-06-02 05:18:55] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 6 ms returned sat
[2025-06-02 05:18:55] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2025-06-02 05:18:55] [INFO ] [Nat]Added 116 Read/Feed constraints in 37 ms returned sat
[2025-06-02 05:18:56] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 45 ms.
[2025-06-02 05:18:56] [INFO ] Added : 0 causal constraints over 0 iterations in 137 ms. Result :sat
Minimization took 165 ms.
[2025-06-02 05:18:56] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2025-06-02 05:18:56] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2025-06-02 05:18:56] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2025-06-02 05:18:56] [INFO ] [Real]Added 116 Read/Feed constraints in 28 ms returned sat
[2025-06-02 05:18:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2025-06-02 05:18:56] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2025-06-02 05:18:56] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2025-06-02 05:18:56] [INFO ] [Nat]Added 116 Read/Feed constraints in 29 ms returned sat
[2025-06-02 05:18:56] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 49 ms.
[2025-06-02 05:18:57] [INFO ] Added : 66 causal constraints over 14 iterations in 680 ms. Result :sat
Minimization took 216 ms.
[2025-06-02 05:18:57] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2025-06-02 05:18:57] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2025-06-02 05:18:58] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2025-06-02 05:18:58] [INFO ] [Real]Added 116 Read/Feed constraints in 16 ms returned sat
[2025-06-02 05:18:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:58] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2025-06-02 05:18:58] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2025-06-02 05:18:58] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2025-06-02 05:18:58] [INFO ] [Nat]Added 116 Read/Feed constraints in 58 ms returned sat
[2025-06-02 05:18:58] [INFO ] Deduced a trap composed of 61 places in 171 ms of which 27 ms to minimize.
[2025-06-02 05:18:58] [INFO ] Deduced a trap composed of 13 places in 238 ms of which 3 ms to minimize.
[2025-06-02 05:18:59] [INFO ] Deduced a trap composed of 74 places in 174 ms of which 5 ms to minimize.
[2025-06-02 05:18:59] [INFO ] Deduced a trap composed of 92 places in 179 ms of which 7 ms to minimize.
[2025-06-02 05:18:59] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 3 ms to minimize.
[2025-06-02 05:18:59] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 2 ms to minimize.
[2025-06-02 05:18:59] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 3 ms to minimize.
[2025-06-02 05:18:59] [INFO ] Deduced a trap composed of 73 places in 139 ms of which 8 ms to minimize.
[2025-06-02 05:19:00] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 2 ms to minimize.
[2025-06-02 05:19:00] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:19:00] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 3 ms to minimize.
[2025-06-02 05:19:00] [INFO ] Deduced a trap composed of 83 places in 124 ms of which 2 ms to minimize.
[2025-06-02 05:19:00] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 2 ms to minimize.
[2025-06-02 05:19:00] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 2 ms to minimize.
[2025-06-02 05:19:00] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
[2025-06-02 05:19:01] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 3 ms to minimize.
[2025-06-02 05:19:01] [INFO ] Deduced a trap composed of 48 places in 115 ms of which 3 ms to minimize.
[2025-06-02 05:19:01] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 2 ms to minimize.
[2025-06-02 05:19:01] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 2 ms to minimize.
[2025-06-02 05:19:01] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 2 ms to minimize.
[2025-06-02 05:19:01] [INFO ] Deduced a trap composed of 70 places in 93 ms of which 1 ms to minimize.
[2025-06-02 05:19:02] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2025-06-02 05:19:02] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 2 ms to minimize.
[2025-06-02 05:19:02] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 2 ms to minimize.
[2025-06-02 05:19:02] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 2 ms to minimize.
[2025-06-02 05:19:02] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2025-06-02 05:19:02] [INFO ] Deduced a trap composed of 70 places in 103 ms of which 2 ms to minimize.
[2025-06-02 05:19:02] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 2 ms to minimize.
[2025-06-02 05:19:03] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 3 ms to minimize.
[2025-06-02 05:19:03] [INFO ] Deduced a trap composed of 131 places in 127 ms of which 2 ms to minimize.
[2025-06-02 05:19:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-02 05:19:03] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2025-06-02 05:19:03] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2025-06-02 05:19:03] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2025-06-02 05:19:03] [INFO ] [Real]Added 116 Read/Feed constraints in 45 ms returned sat
[2025-06-02 05:19:03] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:19:03] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2025-06-02 05:19:03] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 7 ms returned sat
[2025-06-02 05:19:03] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2025-06-02 05:19:03] [INFO ] [Nat]Added 116 Read/Feed constraints in 60 ms returned sat
[2025-06-02 05:19:04] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 2 ms to minimize.
[2025-06-02 05:19:04] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 2 ms to minimize.
[2025-06-02 05:19:04] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 3 ms to minimize.
[2025-06-02 05:19:04] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 3 ms to minimize.
[2025-06-02 05:19:04] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 6 ms to minimize.
[2025-06-02 05:19:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 813 ms
Current structural bounds on expressions (after SMT) : Max Seen:[4, 2, 1, 4] Max Struct:[5, 5, 5, 4]
FORMULA Peterson-COL-4-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-4-UpperBounds-08 5 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-COL-4-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 1] Max Struct:[5, 5]
Support contains 105 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 480 transition count 610
Reduce places removed 80 places and 0 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Iterating post reduction 1 with 160 rules applied. Total rules applied 240 place count 400 transition count 530
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 320 place count 320 transition count 530
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 320 place count 320 transition count 495
Deduced a syphon composed of 35 places in 3 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 390 place count 285 transition count 495
Applied a total of 390 rules in 87 ms. Remains 285 /480 variables (removed 195) and now considering 495/690 (removed 195) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 285/480 places, 495/690 transitions.
[2025-06-02 05:19:05] [INFO ] Flow matrix only has 435 transitions (discarded 60 similar events)
// Phase 1: matrix 435 rows 285 cols
[2025-06-02 05:19:05] [INFO ] Computed 19 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4, 1] Max Struct:[5, 5]
RANDOM walk for 1000000 steps (2 resets) in 2315 ms. (431 steps per ms)
FORMULA Peterson-COL-4-UpperBounds-10 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-4-UpperBounds-13 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-4-UpperBounds-04 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 1194 ms. (836 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[5]
[2025-06-02 05:19:08] [INFO ] Flow matrix only has 435 transitions (discarded 60 similar events)
[2025-06-02 05:19:08] [INFO ] Invariant cache hit.
[2025-06-02 05:19:08] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-06-02 05:19:08] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2025-06-02 05:19:08] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2025-06-02 05:19:08] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-02 05:19:08] [INFO ] [Real]Added 116 Read/Feed constraints in 14 ms returned sat
[2025-06-02 05:19:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:19:08] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-06-02 05:19:08] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2025-06-02 05:19:08] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2025-06-02 05:19:08] [INFO ] [Nat]Added 116 Read/Feed constraints in 27 ms returned sat
[2025-06-02 05:19:09] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:19:09] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 2 ms to minimize.
[2025-06-02 05:19:09] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 2 ms to minimize.
[2025-06-02 05:19:09] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2025-06-02 05:19:09] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2025-06-02 05:19:09] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 1 ms to minimize.
[2025-06-02 05:19:09] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 2 ms to minimize.
[2025-06-02 05:19:09] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2025-06-02 05:19:09] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:19:09] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2025-06-02 05:19:09] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 1 ms to minimize.
[2025-06-02 05:19:10] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2025-06-02 05:19:10] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:19:10] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:19:10] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 2 ms to minimize.
[2025-06-02 05:19:10] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 2 ms to minimize.
[2025-06-02 05:19:10] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2025-06-02 05:19:10] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2025-06-02 05:19:10] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:19:10] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:19:10] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2025-06-02 05:19:10] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 5 ms to minimize.
[2025-06-02 05:19:11] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2025-06-02 05:19:11] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2025-06-02 05:19:11] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2025-06-02 05:19:11] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2025-06-02 05:19:11] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2025-06-02 05:19:11] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 2 ms to minimize.
[2025-06-02 05:19:11] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:19:11] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2025-06-02 05:19:12] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:19:12] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 2 ms to minimize.
[2025-06-02 05:19:12] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:19:12] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2025-06-02 05:19:12] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
[2025-06-02 05:19:12] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2025-06-02 05:19:12] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 2 ms to minimize.
[2025-06-02 05:19:12] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2025-06-02 05:19:12] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:19:13] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
[2025-06-02 05:19:13] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 2 ms to minimize.
[2025-06-02 05:19:13] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 2 ms to minimize.
[2025-06-02 05:19:14] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2025-06-02 05:19:14] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:19:14] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 2 ms to minimize.
[2025-06-02 05:19:15] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:19:15] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:19:15] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 2 ms to minimize.
[2025-06-02 05:19:15] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:19:15] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 2 ms to minimize.
[2025-06-02 05:19:15] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:19:15] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:19:16] [INFO ] Deduced a trap composed of 69 places in 96 ms of which 1 ms to minimize.
[2025-06-02 05:19:16] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:19:16] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2025-06-02 05:19:16] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
[2025-06-02 05:19:16] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2025-06-02 05:19:16] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 2 ms to minimize.
[2025-06-02 05:19:16] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:19:16] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:19:16] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:19:17] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:19:17] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2025-06-02 05:19:17] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:19:17] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:19:17] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2025-06-02 05:19:17] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:19:17] [INFO ] Deduced a trap composed of 67 places in 47 ms of which 1 ms to minimize.
[2025-06-02 05:19:18] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:19:18] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:19:19] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:19:19] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:19:19] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 2 ms to minimize.
[2025-06-02 05:19:19] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2025-06-02 05:19:19] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:19:19] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 4 ms to minimize.
[2025-06-02 05:19:20] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:19:20] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2025-06-02 05:19:23] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
[2025-06-02 05:19:23] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2025-06-02 05:19:24] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
[2025-06-02 05:19:24] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2025-06-02 05:19:25] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:19:25] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:19:26] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:19:27] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:19:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 86 trap constraints in 19988 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[1]
FORMULA Peterson-COL-4-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided 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 )
[2025-06-02 05:19:29] [INFO ] Flatten gal took : 70 ms
[2025-06-02 05:19:29] [INFO ] Flatten gal took : 31 ms
[2025-06-02 05:19:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10225048459886059072.gal : 15 ms
[2025-06-02 05:19:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1238016972049287004.prop : 17 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10225048459886059072.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1238016972049287004.prop' '--nowitness' '--gen-order' 'FOLLOW'

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

BK_STOP 1748841569399

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-COL-4"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is Peterson-COL-4, 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 r153-tall-174876824800071"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-4.tgz
mv Peterson-COL-4 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.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 ;