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.r285-smll-171654422100161.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 gold2023
Input is Peterson-PT-3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654422100161
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 27K Apr 12 02:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 12 02:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Apr 12 02:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 134K Apr 12 02:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 108K Apr 12 02:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 511K Apr 12 02:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 71K Apr 12 02:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 344K Apr 12 02:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.5K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 143K May 18 16:43 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 Peterson-PT-3-UpperBounds-00
FORMULA_NAME Peterson-PT-3-UpperBounds-01
FORMULA_NAME Peterson-PT-3-UpperBounds-02
FORMULA_NAME Peterson-PT-3-UpperBounds-03
FORMULA_NAME Peterson-PT-3-UpperBounds-04
FORMULA_NAME Peterson-PT-3-UpperBounds-05
FORMULA_NAME Peterson-PT-3-UpperBounds-06
FORMULA_NAME Peterson-PT-3-UpperBounds-07
FORMULA_NAME Peterson-PT-3-UpperBounds-08
FORMULA_NAME Peterson-PT-3-UpperBounds-09
FORMULA_NAME Peterson-PT-3-UpperBounds-10
FORMULA_NAME Peterson-PT-3-UpperBounds-11
FORMULA_NAME Peterson-PT-3-UpperBounds-12
FORMULA_NAME Peterson-PT-3-UpperBounds-13
FORMULA_NAME Peterson-PT-3-UpperBounds-14
FORMULA_NAME Peterson-PT-3-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716898857472

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-3
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-28 12:21:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 12:21:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 12:21:00] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2024-05-28 12:21:00] [INFO ] Transformed 244 places.
[2024-05-28 12:21:00] [INFO ] Transformed 332 transitions.
[2024-05-28 12:21:00] [INFO ] Found NUPN structural information;
[2024-05-28 12:21:00] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 373 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
FORMULA Peterson-PT-3-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 308 out of 332 initially.
// Phase 1: matrix 308 rows 244 cols
[2024-05-28 12:21:00] [INFO ] Computed 15 invariants in 31 ms
FORMULA Peterson-PT-3-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 13) seen :26
FORMULA Peterson-PT-3-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :20
[2024-05-28 12:21:01] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-28 12:21:01] [INFO ] Computed 15 invariants in 7 ms
[2024-05-28 12:21:01] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned unsat
[2024-05-28 12:21:01] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned unsat
[2024-05-28 12:21:01] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned unsat
[2024-05-28 12:21:01] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned unsat
[2024-05-28 12:21:02] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned unsat
[2024-05-28 12:21:02] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2024-05-28 12:21:02] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-28 12:21:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 12:21:02] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-28 12:21:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 12:21:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-05-28 12:21:02] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-28 12:21:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 12:21:02] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2024-05-28 12:21:02] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 12:21:02] [INFO ] [Nat]Added 57 Read/Feed constraints in 21 ms returned sat
[2024-05-28 12:21:02] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 5 ms to minimize.
[2024-05-28 12:21:03] [INFO ] Deduced a trap composed of 50 places in 162 ms of which 2 ms to minimize.
[2024-05-28 12:21:03] [INFO ] Deduced a trap composed of 27 places in 253 ms of which 2 ms to minimize.
[2024-05-28 12:21:03] [INFO ] Deduced a trap composed of 20 places in 213 ms of which 3 ms to minimize.
[2024-05-28 12:21:03] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 1 ms to minimize.
[2024-05-28 12:21:03] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 1 ms to minimize.
[2024-05-28 12:21:04] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 1 ms to minimize.
[2024-05-28 12:21:04] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 1 ms to minimize.
[2024-05-28 12:21:04] [INFO ] Deduced a trap composed of 55 places in 102 ms of which 1 ms to minimize.
[2024-05-28 12:21:04] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 1 ms to minimize.
[2024-05-28 12:21:04] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 1 ms to minimize.
[2024-05-28 12:21:04] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 3 ms to minimize.
[2024-05-28 12:21:04] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 1 ms to minimize.
[2024-05-28 12:21:05] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 0 ms to minimize.
[2024-05-28 12:21:05] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2024-05-28 12:21:05] [INFO ] Deduced a trap composed of 52 places in 112 ms of which 0 ms to minimize.
[2024-05-28 12:21:05] [INFO ] Deduced a trap composed of 48 places in 115 ms of which 1 ms to minimize.
[2024-05-28 12:21:05] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 1 ms to minimize.
[2024-05-28 12:21:06] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 1 ms to minimize.
[2024-05-28 12:21:06] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 0 ms to minimize.
[2024-05-28 12:21:06] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 1 ms to minimize.
[2024-05-28 12:21:06] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 1 ms to minimize.
[2024-05-28 12:21:06] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 1 ms to minimize.
[2024-05-28 12:21:06] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2024-05-28 12:21:06] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 1 ms to minimize.
[2024-05-28 12:21:06] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 1 ms to minimize.
[2024-05-28 12:21:07] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 1 ms to minimize.
[2024-05-28 12:21:07] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 1 ms to minimize.
[2024-05-28 12:21:07] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
[2024-05-28 12:21:07] [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 5
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-28 12:21:07] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2024-05-28 12:21:07] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-28 12:21:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 12:21:07] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2024-05-28 12:21:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 12:21:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-05-28 12:21:07] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-28 12:21:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 12:21:07] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2024-05-28 12:21:07] [INFO ] [Nat]Added 57 Read/Feed constraints in 12 ms returned sat
[2024-05-28 12:21:07] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 35 ms.
[2024-05-28 12:21:09] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 0 ms to minimize.
[2024-05-28 12:21:09] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 1 ms to minimize.
[2024-05-28 12:21:09] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2024-05-28 12:21:09] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 0 ms to minimize.
[2024-05-28 12:21:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 562 ms
[2024-05-28 12:21:09] [INFO ] Added : 178 causal constraints over 37 iterations in 1687 ms. Result :sat
Minimization took 76 ms.
Current structural bounds on expressions (after SMT) : [4, 4, 4, 4, 4, 4, 1] Max seen :[4, 4, 4, 4, 4, 1, 0]
FORMULA Peterson-PT-3-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 5 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 244 transition count 237
Reduce places removed 95 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 96 rules applied. Total rules applied 191 place count 149 transition count 236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 192 place count 148 transition count 236
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 192 place count 148 transition count 193
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 278 place count 105 transition count 193
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 302 place count 93 transition count 181
Applied a total of 302 rules in 82 ms. Remains 93 /244 variables (removed 151) and now considering 181/332 (removed 151) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 93/244 places, 181/332 transitions.
Normalized transition count is 157 out of 181 initially.
// Phase 1: matrix 157 rows 93 cols
[2024-05-28 12:21:09] [INFO ] Computed 15 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1438 ms. (steps per millisecond=695 ) properties (out of 2) seen :2
FORMULA Peterson-PT-3-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 414 ms. (steps per millisecond=2415 ) properties (out of 1) seen :1
[2024-05-28 12:21:11] [INFO ] Flow matrix only has 157 transitions (discarded 24 similar events)
// Phase 1: matrix 157 rows 93 cols
[2024-05-28 12:21:11] [INFO ] Computed 15 invariants in 3 ms
[2024-05-28 12:21:11] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-28 12:21:11] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-28 12:21:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 12:21:11] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-28 12:21:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 12:21:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-28 12:21:11] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-28 12:21:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 12:21:11] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-28 12:21:11] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 12:21:11] [INFO ] [Nat]Added 57 Read/Feed constraints in 8 ms returned sat
[2024-05-28 12:21:11] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-28 12:21:12] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 2 ms to minimize.
[2024-05-28 12:21:12] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2024-05-28 12:21:12] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-28 12:21:12] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2024-05-28 12:21:12] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
[2024-05-28 12:21:12] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-28 12:21:12] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2024-05-28 12:21:12] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-28 12:21:12] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 0 ms to minimize.
[2024-05-28 12:21:12] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-05-28 12:21:12] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-28 12:21:12] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-28 12:21:12] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-05-28 12:21:12] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 0 ms to minimize.
[2024-05-28 12:21:13] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-28 12:21:13] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-28 12:21:13] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-28 12:21:13] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2024-05-28 12:21:13] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-28 12:21:13] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-28 12:21:13] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-05-28 12:21:13] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 0 ms to minimize.
[2024-05-28 12:21:13] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-28 12:21:13] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2024-05-28 12:21:13] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 0 ms to minimize.
[2024-05-28 12:21:13] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-28 12:21:13] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 12:21:13] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-28 12:21:13] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-28 12:21:14] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-28 12:21:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 31 trap constraints in 2891 ms
Current structural bounds on expressions (after SMT) : [1] Max seen :[1]
FORMULA Peterson-PT-3-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 14502 ms.

BK_STOP 1716898875815

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-PT-3"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is Peterson-PT-3, 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 r285-smll-171654422100161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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