Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r194-tall-177969914200549.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is Parking-PT-864, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914200549
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 928K
-rw-r--r-- 1 mcc users 7.8K Mar 8 08:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 8 08:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 8 08:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 8 08:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Mar 16 08:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 16 08:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 16 08:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 16 08:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 8 08:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Mar 8 08:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 8 08:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Mar 8 08:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 16 08:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 427K Mar 3 18:30 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 Parking-PT-864-UpperBounds-00
FORMULA_NAME Parking-PT-864-UpperBounds-01
FORMULA_NAME Parking-PT-864-UpperBounds-02
FORMULA_NAME Parking-PT-864-UpperBounds-03
FORMULA_NAME Parking-PT-864-UpperBounds-04
FORMULA_NAME Parking-PT-864-UpperBounds-05
FORMULA_NAME Parking-PT-864-UpperBounds-06
FORMULA_NAME Parking-PT-864-UpperBounds-07
FORMULA_NAME Parking-PT-864-UpperBounds-08
FORMULA_NAME Parking-PT-864-UpperBounds-09
FORMULA_NAME Parking-PT-864-UpperBounds-10
FORMULA_NAME Parking-PT-864-UpperBounds-11
FORMULA_NAME Parking-PT-864-UpperBounds-12
FORMULA_NAME Parking-PT-864-UpperBounds-13
FORMULA_NAME Parking-PT-864-UpperBounds-14
FORMULA_NAME Parking-PT-864-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779788992138

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-864
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-26 09:49: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]
[2026-05-26 09:49:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 09:49:53] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2026-05-26 09:49:53] [INFO ] Transformed 1185 places.
[2026-05-26 09:49:53] [INFO ] Transformed 1697 transitions.
[2026-05-26 09:49:53] [INFO ] Found NUPN structural information;
[2026-05-26 09:49:53] [INFO ] Parsed PT model containing 1185 places and 1697 transitions and 5073 arcs in 225 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 688 transitions
Reduce redundant transitions removed 688 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]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2755246717880850987.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2202927430559098003.kers'
[2026-05-26 09:49:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2755246717880850987.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2202927430559098003.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1009 rows 1185 cols 3137 entries
Finished phase 1 with 833 SingleSign rule and 72 generalized
[2026-05-26 09:49:53] [INFO ] Computed 280 invariants in 8 ms
Computed 280 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-2202927430559098003.kers
Total runtime 10 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 (38 resets) in 161 ms. (61 steps per ms)
FORMULA Parking-PT-864-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-864-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-864-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-864-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-864-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-864-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-864-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-864-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-864-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-864-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-864-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (10 resets) in 266 ms. (187 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2026-05-26 09:49:54] [INFO ] Invariant cache hit.
[2026-05-26 09:49:54] [INFO ] [Real]Absence check using 272 positive place invariants in 82 ms returned sat
[2026-05-26 09:49:54] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 3 ms returned sat
[2026-05-26 09:49:54] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2026-05-26 09:49:54] [INFO ] State equation strengthened by 248 read => feed constraints.
[2026-05-26 09:49:55] [INFO ] [Real]Added 248 Read/Feed constraints in 152 ms returned sat
[2026-05-26 09:49:55] [INFO ] Computed and/alt/rep : 864/2496/864 causal constraints (skipped 144 transitions) in 61 ms.
[2026-05-26 09:49:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 09:49:55] [INFO ] [Nat]Absence check using 272 positive place invariants in 74 ms returned sat
[2026-05-26 09:49:55] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 4 ms returned sat
[2026-05-26 09:49:56] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2026-05-26 09:49:56] [INFO ] [Nat]Added 248 Read/Feed constraints in 128 ms returned sat
[2026-05-26 09:49:56] [INFO ] Computed and/alt/rep : 864/2496/864 causal constraints (skipped 144 transitions) in 49 ms.
[2026-05-26 09:50:00] [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:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1143)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:881)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-26 09:50:00] [INFO ] [Real]Absence check using 272 positive place invariants in 63 ms returned sat
[2026-05-26 09:50:00] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 4 ms returned sat
[2026-05-26 09:50:01] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2026-05-26 09:50:01] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-26 09:50:01] [INFO ] [Real]Added 248 Read/Feed constraints in 776 ms returned sat
[2026-05-26 09:50:02] [INFO ] Computed and/alt/rep : 864/2496/864 causal constraints (skipped 144 transitions) in 63 ms.
[2026-05-26 09:50:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 09:50:02] [INFO ] [Nat]Absence check using 272 positive place invariants in 65 ms returned sat
[2026-05-26 09:50:02] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 3 ms returned sat
[2026-05-26 09:50:02] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2026-05-26 09:50:03] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-26 09:50:03] [INFO ] [Nat]Added 248 Read/Feed constraints in 576 ms returned sat
[2026-05-26 09:50:03] [INFO ] Computed and/alt/rep : 864/2496/864 causal constraints (skipped 144 transitions) in 55 ms.
[2026-05-26 09:50:07] [INFO ] Added : 200 causal constraints over 40 iterations in 3792 ms. Result :unknown
[2026-05-26 09:50:07] [INFO ] [Real]Absence check using 272 positive place invariants in 66 ms returned sat
[2026-05-26 09:50:07] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 3 ms returned sat
[2026-05-26 09:50:07] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2026-05-26 09:50:08] [INFO ] [Real]Added 248 Read/Feed constraints in 161 ms returned sat
[2026-05-26 09:50:08] [INFO ] Computed and/alt/rep : 864/2496/864 causal constraints (skipped 144 transitions) in 51 ms.
[2026-05-26 09:50:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 09:50:08] [INFO ] [Nat]Absence check using 272 positive place invariants in 65 ms returned sat
[2026-05-26 09:50:08] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 9 ms returned sat
[2026-05-26 09:50:08] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2026-05-26 09:50:09] [INFO ] [Nat]Added 248 Read/Feed constraints in 136 ms returned sat
[2026-05-26 09:50:09] [INFO ] Computed and/alt/rep : 864/2496/864 causal constraints (skipped 144 transitions) in 48 ms.
[2026-05-26 09:50:13] [INFO ] Added : 225 causal constraints over 45 iterations in 4261 ms. Result :unknown
[2026-05-26 09:50:13] [INFO ] [Real]Absence check using 272 positive place invariants in 65 ms returned sat
[2026-05-26 09:50:13] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 3 ms returned sat
[2026-05-26 09:50:13] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2026-05-26 09:50:14] [INFO ] [Real]Added 248 Read/Feed constraints in 152 ms returned sat
[2026-05-26 09:50:14] [INFO ] Computed and/alt/rep : 864/2496/864 causal constraints (skipped 144 transitions) in 47 ms.
[2026-05-26 09:50:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 09:50:14] [INFO ] [Nat]Absence check using 272 positive place invariants in 72 ms returned sat
[2026-05-26 09:50:14] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 4 ms returned sat
[2026-05-26 09:50:14] [INFO ] [Nat]Absence check using state equation in 350 ms returned sat
[2026-05-26 09:50:15] [INFO ] [Nat]Added 248 Read/Feed constraints in 140 ms returned sat
[2026-05-26 09:50:15] [INFO ] Computed and/alt/rep : 864/2496/864 causal constraints (skipped 144 transitions) in 45 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2026-05-26 09:50:19] [INFO ] [Real]Absence check using 272 positive place invariants in 66 ms returned sat
[2026-05-26 09:50:19] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 4 ms returned sat
[2026-05-26 09:50:20] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2026-05-26 09:50:20] [INFO ] [Real]Added 248 Read/Feed constraints in 408 ms returned sat
[2026-05-26 09:50:20] [INFO ] Computed and/alt/rep : 864/2496/864 causal constraints (skipped 144 transitions) in 50 ms.
[2026-05-26 09:50:20] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 09:50:21] [INFO ] [Nat]Absence check using 272 positive place invariants in 63 ms returned sat
[2026-05-26 09:50:21] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 3 ms returned sat
[2026-05-26 09:50:21] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2026-05-26 09:50:21] [INFO ] [Nat]Added 248 Read/Feed constraints in 363 ms returned sat
[2026-05-26 09:50:21] [INFO ] Computed and/alt/rep : 864/2496/864 causal constraints (skipped 144 transitions) in 37 ms.
[2026-05-26 09:50:25] [INFO ] Added : 255 causal constraints over 51 iterations in 4042 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 1185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1185/1185 places, 1009/1009 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1185 transition count 978
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1154 transition count 978
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 62 place count 1154 transition count 947
Deduced a syphon composed of 31 places in 2 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 124 place count 1123 transition count 947
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 132 place count 1115 transition count 939
Iterating global reduction 2 with 8 rules applied. Total rules applied 140 place count 1115 transition count 939
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 220 place count 1075 transition count 899
Free-agglomeration rule applied 192 times.
Iterating global reduction 2 with 192 rules applied. Total rules applied 412 place count 1075 transition count 707
Reduce places removed 192 places and 0 transitions.
Graph (complete) has 1842 edges and 883 vertex of which 348 are kept as prefixes of interest. Removing 535 places using SCC suffix rule.2 ms
Discarding 535 places :
Also discarding 410 output transitions
Drop transitions (Output transitions of discarded places.) removed 410 transitions
Iterating post reduction 2 with 193 rules applied. Total rules applied 605 place count 348 transition count 297
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 635 place count 348 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 636 place count 347 transition count 266
Reduce places removed 87 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 4 with 229 rules applied. Total rules applied 865 place count 260 transition count 124
Reduce places removed 142 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 5 with 176 rules applied. Total rules applied 1041 place count 118 transition count 90
Reduce places removed 22 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 6 with 24 rules applied. Total rules applied 1065 place count 96 transition count 88
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1067 place count 94 transition count 88
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 27 Pre rules applied. Total rules applied 1067 place count 94 transition count 61
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 8 with 54 rules applied. Total rules applied 1121 place count 67 transition count 61
Applied a total of 1121 rules in 416 ms. Remains 67 /1185 variables (removed 1118) and now considering 61/1009 (removed 948) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 423 ms. Remains : 67/1185 places, 61/1009 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14155941824566261249.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15571922303970891191.kers'
[2026-05-26 09:50:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14155941824566261249.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15571922303970891191.kers]
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 0 ms.
// Phase 1: matrix 61 rows 41 cols 130 entries
Finished phase 1 with 34 SingleSign rule and 0 generalized
[2026-05-26 09:50:27] [INFO ] Computed 33 invariants in 0 ms
Computed 33 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15571922303970891191.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1908 ms. (523 steps per ms)
FORMULA Parking-PT-864-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-864-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-864-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-864-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-864-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 598 ms. (1669 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 37004 ms.

BK_STOP 1779789030307

--------------------
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
++ 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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="Parking-PT-864"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is Parking-PT-864, 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 r194-tall-177969914200549"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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