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-177946841800254.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-PT-V50P50N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946841800254
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 23K Mar 5 08:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 135K Mar 5 08:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 134K Mar 5 08:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 539K Mar 5 08:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 15K Mar 15 07:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 15 07:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 63K Mar 15 07:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 201K Mar 15 07:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 57K Mar 5 08:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 336K Mar 5 08:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 322K Mar 5 08:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.3M Mar 5 08:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 15 07:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K Mar 15 07:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.1M 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 booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779553521128

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P50N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-23 16:25:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 16:25:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 16:25:22] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2026-05-23 16:25:22] [INFO ] Transformed 128 places.
[2026-05-23 16:25:22] [INFO ] Transformed 1328 transitions.
[2026-05-23 16:25:22] [INFO ] Parsed PT model containing 128 places and 1328 transitions and 10010 arcs in 233 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 16:25:23] [INFO ] Flatten gal took : 335 ms
RANDOM walk for 40001 steps (88 resets) in 3223 ms. (12 steps per ms) remains 12/14 properties
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-23 16:25:23] [INFO ] Flatten gal took : 162 ms
[2026-05-23 16:25:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17159195523475716659.gal : 126 ms
BEST_FIRST walk for 40003 steps (36 resets) in 672 ms. (59 steps per ms) remains 12/12 properties
[2026-05-23 16:25:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9508603917361545266.prop : 8 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/ReachabilityCardinality17159195523475716659.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9508603917361545266.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 ...329
BEST_FIRST walk for 40002 steps (35 resets) in 373 ms. (106 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (32 resets) in 257 ms. (155 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (40 resets) in 450 ms. (88 steps per ms) remains 12/12 properties
Loading property file /tmp/ReachabilityCardinality9508603917361545266.prop.
BEST_FIRST walk for 40003 steps (34 resets) in 296 ms. (134 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 2
BEST_FIRST walk for 40002 steps (32 resets) in 409 ms. (97 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :6 after 19
BEST_FIRST walk for 40002 steps (32 resets) in 341 ms. (116 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (26 resets) in 283 ms. (140 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :19 after 42
BEST_FIRST walk for 40004 steps (28 resets) in 236 ms. (168 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (32 resets) in 187 ms. (212 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (26 resets) in 175 ms. (227 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (28 resets) in 199 ms. (200 steps per ms) remains 12/12 properties
[2026-05-23 16:25:24] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2562331270738668992.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-835556652502486484.kers'
[2026-05-23 16:25:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2562331270738668992.kers, --Pflows, --basisKERS=/tmp/petrispot-output-835556652502486484.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 250 rows 128 cols 1290 entries
Finished phase 1 with 21 SingleSign rule and 100 generalized
[2026-05-23 16:25:24] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-835556652502486484.kers
Total runtime 2 ms.
[2026-05-23 16:25:24] [INFO ] State equation strengthened by 22 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Problem BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-00 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-01 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-02 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-05 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-07 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 7 unsolved
Problem BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-08 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-09 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-11 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-12 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-14 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-15 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 22/128 variables, 2/7 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/7 constraints. Problems are: Problem set: 11 solved, 1 unsolved
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :42 after 132
At refinement iteration 4 (OVERLAPS) 250/378 variables, 128/135 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 22/157 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/157 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/378 variables, 0/157 constraints. Problems are: Problem set: 11 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 157 constraints, problems are : Problem set: 11 solved, 1 unsolved in 427 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 8/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 2/2 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/9 variables, 1/3 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/213 variables, 9/12 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/12 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 152/365 variables, 106/118 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 2/120 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 22/142 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 1/143 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/365 variables, 0/143 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/367 variables, 1/144 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/367 variables, 2/146 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/367 variables, 0/146 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/378 variables, 11/157 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/378 variables, 1/158 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/378 variables, 0/158 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/378 variables, 0/158 constraints. Problems are: Problem set: 11 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 158 constraints, problems are : Problem set: 11 solved, 1 unsolved in 752 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1317ms problems are : Problem set: 11 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 1222 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 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 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 125 transition count 1327
Applied a total of 3 rules in 218 ms. Remains 125 /128 variables (removed 3) and now considering 1327/1328 (removed 1) transitions.
Running 1324 sub problems to find dead transitions.
[2026-05-23 16:25:26] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9872604569114974466.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4709428485608048417.kers'
[2026-05-23 16:25:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9872604569114974466.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4709428485608048417.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 249 rows 124 cols 1135 entries
Finished phase 1 with 120 SingleSign rule and 0 generalized
[2026-05-23 16:25:26] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-4709428485608048417.kers
Total runtime 4 ms.
[2026-05-23 16:25:26] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :132 after 2025
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :2025 after 2027
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :2027 after 2030
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :2030 after 2053
Problem TDEAD177 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD716 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 2/7 constraints. Problems are: Problem set: 100 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/374 variables, and 7 constraints, problems are : Problem set: 100 solved, 1224 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1324/1123 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 100 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 2/7 constraints. Problems are: Problem set: 100 solved, 1224 unsolved
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :2053 after 4558
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 100 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 3 (OVERLAPS) 249/374 variables, 125/132 constraints. Problems are: Problem set: 102 solved, 1222 unsolved
SDD proceeding with computation,12 properties remain. new max is 4096
SDD size :4558 after 6536
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 22/154 constraints. Problems are: Problem set: 102 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/374 variables, and 1275 constraints, problems are : Problem set: 102 solved, 1222 unsolved in 21283 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1222/1123 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43657ms problems are : Problem set: 102 solved, 1222 unsolved
Search for dead transitions found 102 dead transitions in 43668ms
Found 102 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 102 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 125/128 places, 1225/1328 transitions.
Applied a total of 0 rules in 69 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43999 ms. Remains : 125/128 places, 1225/1328 transitions.
RANDOM walk for 40000 steps (104 resets) in 397 ms. (100 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (40 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 438348 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :0 out of 1
Probabilistic random walk after 438348 steps, saw 123885 distinct states, run finished after 3009 ms. (steps per millisecond=145 ) properties seen :0
[2026-05-23 16:26:13] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10378432163398633767.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14840357740151713010.kers'
[2026-05-23 16:26:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10378432163398633767.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14840357740151713010.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 245 rows 124 cols 1123 entries
Finished phase 1 with 117 SingleSign rule and 1 generalized
[2026-05-23 16:26:13] [INFO ] Computed 7 invariants in 4 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14840357740151713010.kers
Total runtime 4 ms.
[2026-05-23 16:26:13] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 126/179 variables, 54/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/183 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 84/267 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/267 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/267 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 102/369 variables, 52/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/369 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/369 variables, 10/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/369 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/370 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/370 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/370 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 153 constraints, problems are : Problem set: 0 solved, 1 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 126/179 variables, 54/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/183 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 84/267 variables, 16/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/267 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/267 variables, 10/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/267 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 102/369 variables, 52/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/369 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/369 variables, 10/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/369 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/370 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/370 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/370 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 958 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1287ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1225/1225 transitions.
Applied a total of 0 rules in 56 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 125/125 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1225/1225 transitions.
Applied a total of 0 rules in 54 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2026-05-23 16:26:14] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 16:26:14] [INFO ] Invariant cache hit.
[2026-05-23 16:26:15] [INFO ] Implicit Places using invariants in 304 ms returned [52, 107]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 316 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 123/125 places, 1225/1225 transitions.
Applied a total of 0 rules in 54 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 426 ms. Remains : 123/125 places, 1225/1225 transitions.
RANDOM walk for 40000 steps (104 resets) in 417 ms. (95 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (40 resets) in 162 ms. (245 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 485453 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :0 out of 1
Probabilistic random walk after 485453 steps, saw 136647 distinct states, run finished after 3001 ms. (steps per millisecond=161 ) properties seen :0
[2026-05-23 16:26:18] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13732859086249270824.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5247754271589582888.kers'
[2026-05-23 16:26:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13732859086249270824.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5247754271589582888.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 245 rows 122 cols 923 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-23 16:26:18] [INFO ] Computed 5 invariants in 6 ms
Computed 5 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-5247754271589582888.kers
Total runtime 7 ms.
[2026-05-23 16:26:18] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/182 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 84/266 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 101/367 variables, 51/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/367 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 10/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/368 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/368 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/368 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/182 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 84/266 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 10/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 101/367 variables, 51/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 10/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/368 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/368 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/368 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 149 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1007 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1170ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 49 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 51 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 45 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2026-05-23 16:26:19] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 16:26:19] [INFO ] Invariant cache hit.
[2026-05-23 16:26:19] [INFO ] Implicit Places using invariants in 197 ms returned []
[2026-05-23 16:26:19] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 16:26:19] [INFO ] Invariant cache hit.
[2026-05-23 16:26:19] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:26:20] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 761 ms to find 0 implicit places.
[2026-05-23 16:26:20] [INFO ] Redundant transitions in 91 ms returned []
Running 1222 sub problems to find dead transitions.
[2026-05-23 16:26:20] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 16:26:20] [INFO ] Invariant cache hit.
[2026-05-23 16:26:20] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SDD proceeding with computation,12 properties remain. new max is 8192
SDD size :6536 after 8795
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 31660ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 31663ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32569 ms. Remains : 123/123 places, 1225/1225 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 980 transitions
Reduce isomorphic transitions removed 980 transitions.
Iterating post reduction 0 with 980 rules applied. Total rules applied 980 place count 123 transition count 245
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 984 place count 121 transition count 243
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 986 place count 121 transition count 241
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 988 place count 119 transition count 241
Applied a total of 988 rules in 26 ms. Remains 119 /123 variables (removed 4) and now considering 241/1225 (removed 984) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1089973873138590030.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10951418073728661741.kers'
[2026-05-23 16:26:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1089973873138590030.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10951418073728661741.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 241 rows 118 cols 911 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-23 16:26:52] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-10951418073728661741.kers
Total runtime 5 ms.
[2026-05-23 16:26:52] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-23 16:26:52] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-23 16:26:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 16:26:52] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-23 16:26:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 16:26:52] [INFO ] After 23ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-23 16:26:52] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-23 16:26:52] [INFO ] After 205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-23 16:26:52] [INFO ] Flatten gal took : 24 ms
[2026-05-23 16:26:52] [INFO ] Flatten gal took : 17 ms
[2026-05-23 16:26:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5680237911145890695.gal : 3 ms
[2026-05-23 16:26:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality948446238613923511.prop : 0 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/ReachabilityCardinality5680237911145890695.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality948446238613923511.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 ...327
Loading property file /tmp/ReachabilityCardinality948446238613923511.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 138
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :138 after 488
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :488 after 969
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :969 after 14279
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :14279 after 25475
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.80321e+07 after 1.86932e+07
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,1.16745e+09,0.52047,22480,2,5564,16,104967,7,0,720,42929,0
Total reachable state count : 1167450000

Verifying 1 reachability properties.
Reachability property BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-13 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
BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-13,50854,0.521436,22480,2,1447,16,104967,7,0,722,42929,0
Over-approximation ignoring read arcs solved 0 properties in 991 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-23 16:26:53] [INFO ] Flatten gal took : 42 ms
[2026-05-23 16:26:53] [INFO ] Applying decomposition
[2026-05-23 16:26:53] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5132129522815078449.txt' '-o' '/tmp/graph5132129522815078449.bin' '-w' '/tmp/graph5132129522815078449.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5132129522815078449.bin' '-l' '-1' '-v' '-w' '/tmp/graph5132129522815078449.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:26:53] [INFO ] Decomposing Gal with order
[2026-05-23 16:26:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:26:54] [INFO ] Removed a total of 3014 redundant transitions.
[2026-05-23 16:26:54] [INFO ] Flatten gal took : 483 ms
[2026-05-23 16:26:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 398 labels/synchronizations in 25 ms.
[2026-05-23 16:26:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10904726927164504361.gal : 4 ms
[2026-05-23 16:26:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12544387891578438680.prop : 1 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/ReachabilityCardinality10904726927164504361.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12544387891578438680.prop' '--nowitness'

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 ...309
Loading property file /tmp/ReachabilityCardinality12544387891578438680.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :12 after 13
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :13 after 16
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :16 after 20
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :20 after 29
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :29 after 357
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1616 after 1616
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4636 after 4734
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :10561 after 11869
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :23329 after 26887
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :91826 after 102437
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :278769 after 302095
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.29042e+06 after 1.31858e+06
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :2.75532e+06 after 2.75532e+06
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :5.26025e+06 after 5.46438e+06
SDD proceeding with computation,1 properties remain. new max is 1048576
SDD size :1.53078e+07 after 1.54058e+07
Detected timeout of ITS tools.
[2026-05-23 16:56:54] [INFO ] Flatten gal took : 29 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5991519744212914293
[2026-05-23 16:56:54] [INFO ] Computing symmetric may disable matrix : 1225 transitions.
[2026-05-23 16:56:54] [INFO ] Applying decomposition
[2026-05-23 16:56:54] [INFO ] Flatten gal took : 32 ms
[2026-05-23 16:56:55] [INFO ] Computation of Complete disable matrix. took 51 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11872430323798730749.txt' '-o' '/tmp/graph11872430323798730749.bin' '-w' '/tmp/graph11872430323798730749.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11872430323798730749.bin' '-l' '-1' '-v' '-w' '/tmp/graph11872430323798730749.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:56:55] [INFO ] Decomposing Gal with order
[2026-05-23 16:56:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:56:55] [INFO ] Computing symmetric may enable matrix : 1225 transitions.
[2026-05-23 16:56:55] [INFO ] Computation of Complete enable matrix. took 53 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 16:56:55] [INFO ] Removed a total of 2649 redundant transitions.
[2026-05-23 16:56:55] [INFO ] Flatten gal took : 172 ms
[2026-05-23 16:56:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 333 labels/synchronizations in 19 ms.
[2026-05-23 16:56:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10962809322447184809.gal : 2 ms
[2026-05-23 16:56:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9537112767517304841.prop : 0 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/ReachabilityCardinality10962809322447184809.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9537112767517304841.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality9537112767517304841.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :16 after 21
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :21 after 30
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :30 after 47
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :47 after 704
[2026-05-23 16:56:55] [INFO ] Computing Do-Not-Accords matrix : 1225 transitions.
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :704 after 2971
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2971 after 5200
[2026-05-23 16:56:55] [INFO ] Computation of Completed DNA matrix. took 86 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 16:56:55] [INFO ] Built C files in 691ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5991519744212914293
Running compilation step : cd /tmp/ltsmin5991519744212914293;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5200 after 10352
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :10352 after 15550
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :15550 after 30646
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :670473 after 1.00897e+06
Compilation finished in 5889 ms.
Running link step : cd /tmp/ltsmin5991519744212914293;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 95 ms.
Running LTSmin : cd /tmp/ltsmin5991519744212914293;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'BridgeAndVehiclesPTV50P50N10ReachabilityCardinality202413==true'
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :9.33149e+06 after 1.12902e+07
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5.15606e+07 after 5.53287e+07
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.80967e+08 after 1.83024e+08
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.02111e+08 after 2.02505e+08
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\_mod\_flat,2.04953e+08,264.537,2574760,982,12809,333167,2.47188e+06,205,1.32555e+06,454,4.27576e+07,0
Total reachable state count : 204953172

Verifying 1 reachability properties.
Reachability property BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-13 does not hold.
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-13

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-13,0,264.539,2574760,1,0,333167,2.47188e+06,205,1.32555e+06,455,4.27576e+07,0
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2158008 ms.

BK_STOP 1779555680331

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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-PT-V50P50N10"
export BK_EXAMINATION="ReachabilityCardinality"
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-PT-V50P50N10, examination is ReachabilityCardinality"
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-177946841800254"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V50P50N10.tgz
mv BridgeAndVehicles-PT-V50P50N10 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;