About the Execution of ITS-Tools for BridgeAndVehicles-COL-V04P05N02
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 534.203 | 10279.00 | 20132.00 | 103.40 | 1 1 4 4 1 2 4 5 5 4 4 4 1 4 1 1 | normal |
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.r034-tall-177946841700005.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 BridgeAndVehicles-COL-V04P05N02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946841700005
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.4K Mar 5 08:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Mar 5 08:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 5 08:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 5 08:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Mar 15 07:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 15 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 5 08:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Mar 5 08:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Mar 5 08:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Mar 5 08:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 15 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 37K 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 BridgeAndVehicles-COL-V04P05N02-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779481078702
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V04P05N02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202604301425
[2026-05-22 20:18: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]
[2026-05-22 20:18:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 20:18:00] [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.
[2026-05-22 20:18:00] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-22 20:18:00] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 671 ms
[2026-05-22 20:18:00] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 28 PT places and 346.0 transition bindings in 31 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduction of identical properties reduced properties to check from 16 to 10
[2026-05-22 20:18:00] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 5 ms.
[2026-05-22 20:18:00] [INFO ] Skeletonized 10 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-506500258800050912.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3474980646506920198.kers'
[2026-05-22 20:18:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-506500258800050912.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3474980646506920198.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 10 rows 12 cols 28 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-22 20:18:00] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3474980646506920198.kers
Total runtime 3 ms.
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[1, 4, 4, 0, 0, 0, 5, 0, 1, 1] Max Struct:[1, 4, 4, 1, 4, 4, 5, 4, 1, 1]
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-08 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-07 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2026-05-22 20:18:00] [INFO ] Invariant cache hit.
[2026-05-22 20:18:01] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2026-05-22 20:18:01] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2026-05-22 20:18:01] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-22 20:18:01] [INFO ] Added : 2 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 13 ms.
[2026-05-22 20:18:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 20:18:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-22 20:18:01] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2026-05-22 20:18:01] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-22 20:18:01] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2026-05-22 20:18:01] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-22 20:18:01] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-22 20:18:01] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-22 20:18:01] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2026-05-22 20:18:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 20:18:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-22 20:18:01] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2026-05-22 20:18:01] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-22 20:18:01] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 7 ms.
[2026-05-22 20:18:01] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-22 20:18:01] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-22 20:18:01] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-22 20:18:01] [INFO ] Added : 4 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 3 ms.
[2026-05-22 20:18:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 20:18:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2026-05-22 20:18:01] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-22 20:18:01] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-22 20:18:01] [INFO ] Added : 4 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 6 ms.
[2026-05-22 20:18:01] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-22 20:18:01] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2026-05-22 20:18:01] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-22 20:18:01] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 4, 4, 4]
Arc [1:1*[(MOD (ADD $cA 1) 5)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 5) 5) 5)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 3)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2026-05-22 20:18:01] [INFO ] Unfolded HLPN to a Petri net with 28 places and 52 transitions 326 arcs in 18 ms.
[2026-05-22 20:18:01] [INFO ] Unfolded 4 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 4, 4, 4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 4, 4, 4]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5002696741024971572.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4409211903570199296.kers'
[2026-05-22 20:18:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5002696741024971572.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4409211903570199296.kers]
Normalized transition count is 34 out of 52 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 34 rows 28 cols 150 entries
Finished phase 1 with 13 SingleSign rule and 8 generalized
[2026-05-22 20:18:01] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4409211903570199296.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 4, 4, 4]
RANDOM walk for 10001 steps (229 resets) in 32 ms. (303 steps per ms)
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10000 steps (104 resets) in 28 ms. (344 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[4]
[2026-05-22 20:18:01] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16955130159253439296.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5557220452072079630.kers'
[2026-05-22 20:18:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16955130159253439296.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5557220452072079630.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 34 rows 28 cols 150 entries
Finished phase 1 with 13 SingleSign rule and 8 generalized
[2026-05-22 20:18:01] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5557220452072079630.kers
Total runtime 0 ms.
[2026-05-22 20:18:01] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-22 20:18:01] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2026-05-22 20:18:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-22 20:18:01] [INFO ] [Real]Added 6 Read/Feed constraints in 2 ms returned sat
[2026-05-22 20:18:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 20:18:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-22 20:18:01] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2026-05-22 20:18:01] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2026-05-22 20:18:01] [INFO ] Computed and/alt/rep : 25/123/25 causal constraints (skipped 6 transitions) in 3 ms.
[2026-05-22 20:18:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2026-05-22 20:18:01] [INFO ] Added : 14 causal constraints over 4 iterations in 77 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[4]
Support contains 1 out of 28 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 52/52 transitions.
Graph (complete) has 146 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 25 transition count 51
Applied a total of 3 rules in 18 ms. Remains 25 /28 variables (removed 3) and now considering 51/52 (removed 1) transitions.
Running 48 sub problems to find dead transitions.
[2026-05-22 20:18:01] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11844513106296583344.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9663609142512150647.kers'
[2026-05-22 20:18:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11844513106296583344.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9663609142512150647.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 33 rows 24 cols 133 entries
Finished phase 1 with 20 SingleSign rule and 0 generalized
[2026-05-22 20:18:01] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9663609142512150647.kers
Total runtime 0 ms.
[2026-05-22 20:18:01] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 2/7 constraints. Problems are: Problem set: 8 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 8 solved, 40 unsolved
Problem TDEAD4 is UNSAT
Problem TDEAD16 is UNSAT
At refinement iteration 3 (OVERLAPS) 33/58 variables, 25/32 constraints. Problems are: Problem set: 10 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 6/38 constraints. Problems are: Problem set: 10 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/38 constraints. Problems are: Problem set: 10 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 0/58 variables, 0/38 constraints. Problems are: Problem set: 10 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 58/58 variables, and 38 constraints, problems are : Problem set: 10 solved, 38 unsolved in 657 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 10 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 2/7 constraints. Problems are: Problem set: 10 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 10 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 33/58 variables, 25/32 constraints. Problems are: Problem set: 10 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 6/38 constraints. Problems are: Problem set: 10 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 38/76 constraints. Problems are: Problem set: 10 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/76 constraints. Problems are: Problem set: 10 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/58 variables, 0/76 constraints. Problems are: Problem set: 10 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 58/58 variables, and 76 constraints, problems are : Problem set: 10 solved, 38 unsolved in 999 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 38/48 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1711ms problems are : Problem set: 10 solved, 38 unsolved
Search for dead transitions found 10 dead transitions in 1721ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 10 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 25/28 places, 41/52 transitions.
Applied a total of 0 rules in 12 ms. Remains 25 /25 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1776 ms. Remains : 25/28 places, 41/52 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11106112167326415401.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1801557363268316470.kers'
[2026-05-22 20:18:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11106112167326415401.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1801557363268316470.kers]
Normalized transition count is 29 out of 41 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 29 rows 24 cols 121 entries
Finished phase 1 with 17 SingleSign rule and 1 generalized
[2026-05-22 20:18:03] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1801557363268316470.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[4]
RANDOM walk for 1000000 steps (25586 resets) in 912 ms. (1095 steps per ms)
BEST_FIRST walk for 1000000 steps (11474 resets) in 451 ms. (2212 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[4]
[2026-05-22 20:18:04] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13366402049238959026.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3162352887513746560.kers'
[2026-05-22 20:18:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13366402049238959026.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3162352887513746560.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 29 rows 24 cols 121 entries
Finished phase 1 with 17 SingleSign rule and 1 generalized
[2026-05-22 20:18:04] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3162352887513746560.kers
Total runtime 1 ms.
[2026-05-22 20:18:04] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-22 20:18:05] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2026-05-22 20:18:05] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-22 20:18:05] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-22 20:18:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 20:18:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-22 20:18:05] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2026-05-22 20:18:05] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-22 20:18:05] [INFO ] Computed and/alt/rep : 22/107/22 causal constraints (skipped 4 transitions) in 6 ms.
[2026-05-22 20:18:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2026-05-22 20:18:05] [INFO ] Added : 16 causal constraints over 4 iterations in 82 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[4]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 41/41 transitions.
Applied a total of 0 rules in 5 ms. Remains 25 /25 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 25/25 places, 41/41 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 41/41 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2026-05-22 20:18:05] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2026-05-22 20:18:05] [INFO ] Invariant cache hit.
[2026-05-22 20:18:05] [INFO ] Implicit Places using invariants in 51 ms returned [7, 14]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 53 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 23/25 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 58 ms. Remains : 23/25 places, 41/41 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4601951793919650931.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13970840730064064216.kers'
[2026-05-22 20:18:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4601951793919650931.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13970840730064064216.kers]
Normalized transition count is 29 out of 41 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 29 rows 22 cols 105 entries
Finished phase 1 with 18 SingleSign rule and 0 generalized
[2026-05-22 20:18:05] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13970840730064064216.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[4]
RANDOM walk for 1000000 steps (25585 resets) in 621 ms. (1607 steps per ms)
BEST_FIRST walk for 1000001 steps (11484 resets) in 338 ms. (2949 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[4]
[2026-05-22 20:18:06] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14755732973521248555.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5048656530027523139.kers'
[2026-05-22 20:18:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14755732973521248555.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5048656530027523139.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 29 rows 22 cols 105 entries
Finished phase 1 with 18 SingleSign rule and 0 generalized
[2026-05-22 20:18:06] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5048656530027523139.kers
Total runtime 1 ms.
[2026-05-22 20:18:06] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-22 20:18:06] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2026-05-22 20:18:06] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-22 20:18:06] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-22 20:18:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 20:18:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-22 20:18:06] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2026-05-22 20:18:06] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-22 20:18:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2026-05-22 20:18:06] [INFO ] Computed and/alt/rep : 22/75/22 causal constraints (skipped 4 transitions) in 2 ms.
[2026-05-22 20:18:06] [INFO ] Added : 16 causal constraints over 4 iterations in 21 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[4]
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 23/23 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 23/23 places, 41/41 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 23/23 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2026-05-22 20:18:06] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2026-05-22 20:18:06] [INFO ] Invariant cache hit.
[2026-05-22 20:18:06] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-22 20:18:06] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2026-05-22 20:18:06] [INFO ] Invariant cache hit.
[2026-05-22 20:18:06] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-22 20:18:06] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2026-05-22 20:18:06] [INFO ] Redundant transitions in 0 ms returned []
Running 38 sub problems to find dead transitions.
[2026-05-22 20:18:06] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2026-05-22 20:18:06] [INFO ] Invariant cache hit.
[2026-05-22 20:18:06] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 29/52 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 33 constraints, problems are : Problem set: 0 solved, 38 unsolved in 467 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 23/23 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 29/52 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 38/71 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 71 constraints, problems are : Problem set: 0 solved, 38 unsolved in 917 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 23/23 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1396ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1397ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1498 ms. Remains : 23/23 places, 41/41 transitions.
[2026-05-22 20:18:07] [INFO ] Flatten gal took : 37 ms
[2026-05-22 20:18:08] [INFO ] Flatten gal took : 14 ms
[2026-05-22 20:18:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7243995611695574608.gal : 9 ms
RANDOM walk for 40000 steps (1021 resets) in 609 ms. (65 steps per ms) remains 2/2 properties
[2026-05-22 20:18:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9739325464912399078.prop : 2 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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7243995611695574608.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9739325464912399078.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality9739325464912399078.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 25
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :88 after 89
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :89 after 160
BEST_FIRST walk for 40004 steps (459 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :486 after 487
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1139 after 1219
BEST_FIRST walk for 40001 steps (456 resets) in 223 ms. (178 steps per ms) remains 2/2 properties
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2246,0.067826,6232,2,1247,16,7388,8,0,138,7613,0
Total reachable state count : 2246
Verifying 2 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,0.068216,6332,1,0,16,7388,8,0,139,7613,0
Invariant property MIN0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.068515,6496,1,0,16,7388,8,0,139,7613,0
Probably explored full state space saw : 2246 states, properties seen :0
Probabilistic random walk after 7616 steps, saw 2246 distinct states, run finished after 45 ms. (steps per millisecond=169 ) properties seen :0
Explored full state space saw : 2246 states, properties seen :0
Exhaustive walk after 7616 steps, saw 2246 distinct states, run finished after 24 ms. (steps per millisecond=317 ) properties seen :0
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-05 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6342012317654494813.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10424556240143370334.kers'
[2026-05-22 20:18:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6342012317654494813.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10424556240143370334.kers]
Normalized transition count is 29 out of 41 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 29 rows 22 cols 105 entries
Finished phase 1 with 18 SingleSign rule and 0 generalized
[2026-05-22 20:18:08] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10424556240143370334.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (25581 resets) in 630 ms. (1584 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 8936 ms.
BK_STOP 1779481088981
--------------------
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="BridgeAndVehicles-COL-V04P05N02"
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 BridgeAndVehicles-COL-V04P05N02, 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 r034-tall-177946841700005"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V04P05N02.tgz
mv BridgeAndVehicles-COL-V04P05N02 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 '
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 ;
