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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.6K May 27 07:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 27 07:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 27 07:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 27 07:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 27 10:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 27 10:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 27 10:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 12K May 27 07:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K May 27 07:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 27 07:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 27 07:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 27 10:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 27 10:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 6 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 820K May 26 18:17 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 SupplyChain-PT-00200-ReachabilityCardinality-2024-00
FORMULA_NAME SupplyChain-PT-00200-ReachabilityCardinality-2024-01
FORMULA_NAME SupplyChain-PT-00200-ReachabilityCardinality-2024-02
FORMULA_NAME SupplyChain-PT-00200-ReachabilityCardinality-2024-03
FORMULA_NAME SupplyChain-PT-00200-ReachabilityCardinality-2024-04
FORMULA_NAME SupplyChain-PT-00200-ReachabilityCardinality-2024-05
FORMULA_NAME SupplyChain-PT-00200-ReachabilityCardinality-2024-06
FORMULA_NAME SupplyChain-PT-00200-ReachabilityCardinality-2024-07
FORMULA_NAME SupplyChain-PT-00200-ReachabilityCardinality-2024-08
FORMULA_NAME SupplyChain-PT-00200-ReachabilityCardinality-2024-09
FORMULA_NAME SupplyChain-PT-00200-ReachabilityCardinality-2024-10
FORMULA_NAME SupplyChain-PT-00200-ReachabilityCardinality-2024-11
FORMULA_NAME SupplyChain-PT-00200-ReachabilityCardinality-2024-12
FORMULA_NAME SupplyChain-PT-00200-ReachabilityCardinality-2024-13
FORMULA_NAME SupplyChain-PT-00200-ReachabilityCardinality-2024-14
FORMULA_NAME SupplyChain-PT-00200-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1780257598660

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SupplyChain-PT-00200
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-31 19:59:59] [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-31 19:59:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 20:00:00] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2026-05-31 20:00:00] [INFO ] Transformed 2604 places.
[2026-05-31 20:00:00] [INFO ] Transformed 1603 transitions.
[2026-05-31 20:00:00] [INFO ] Parsed PT model containing 2604 places and 1603 transitions and 7206 arcs in 329 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 48 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (48 resets) in 3399 ms. (11 steps per ms) remains 4/16 properties
FORMULA SupplyChain-PT-00200-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-00200-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-00200-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-00200-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-00200-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-00200-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-00200-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-00200-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-00200-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-00200-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-00200-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-00200-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 644 ms. (62 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 481 ms. (82 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 550 ms. (72 steps per ms) remains 4/4 properties
[2026-05-31 20:00:02] [INFO ] Flatten gal took : 665 ms
BEST_FIRST walk for 40004 steps (8 resets) in 549 ms. (72 steps per ms) remains 4/4 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16247337397936950684.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3129152266847078835.kers'
[2026-05-31 20:00:02] [INFO ] Flatten gal took : 126 ms
[2026-05-31 20:00:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16247337397936950684.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3129152266847078835.kers]
Normalized transition count is 1602 out of 1603 initially.
Culling duplicate invariants (modulo rational): removing 690 columns.
Culled 690 columns in 2 ms.
// Phase 1: matrix 1602 rows 1914 cols 5204 entries
Finished phase 1 with 1112 SingleSign rule and 200 generalized
[2026-05-31 20:00:02] [INFO ] Computed 1292 invariants in 12 ms
Computed 1292 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-3129152266847078835.kers
Total runtime 15 ms.
[2026-05-31 20:00:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10480060802675707864.gal : 77 ms
[2026-05-31 20:00:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9757522649164041082.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/ReachabilityCardinality10480060802675707864.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9757522649164041082.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
[2026-05-31 20:00:02] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Loading property file /tmp/ReachabilityCardinality9757522649164041082.prop.
At refinement iteration 1 (OVERLAPS) 476/571 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 16/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1181/1752 variables, 323/418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1752 variables, 24/442 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1752 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2604/4207 variables, and 1292 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5696 ms.
Refiners :[Positive P Invariants (semi-flows): 402/402 constraints, Generalized P Invariants (flows): 890/890 constraints, State Equation: 0/2604 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 476/571 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 16/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem SupplyChain-PT-00200-ReachabilityCardinality-2024-07 is UNSAT
FORMULA SupplyChain-PT-00200-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 1/96 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1181/1752 variables, 323/419 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1752 variables, 24/443 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1752 variables, 0/443 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 852/2604 variables, 850/1293 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2604 variables, 0/1293 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :9 after 27
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :27 after 171
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :171 after 513
At refinement iteration 10 (OVERLAPS) 1602/4206 variables, 2604/3897 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4206 variables, 2/3899 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4206 variables, 0/3899 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/4207 variables, 1/3900 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4207 variables, 0/3900 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/4207 variables, 0/3900 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4207/4207 variables, and 3900 constraints, problems are : Problem set: 1 solved, 3 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 402/402 constraints, Generalized P Invariants (flows): 890/890 constraints, State Equation: 2604/2604 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10928ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
FORMULA SupplyChain-PT-00200-ReachabilityCardinality-2024-12 FALSE TECHNIQUES PARIKH_WALK
FORMULA SupplyChain-PT-00200-ReachabilityCardinality-2024-05 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 1006 ms.
Support contains 14 out of 2604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2604/2604 places, 1603/1603 transitions.
Graph (complete) has 7162 edges and 2604 vertex of which 2602 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 690 places
Iterating post reduction 0 with 690 rules applied. Total rules applied 691 place count 1912 transition count 1601
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 199 Pre rules applied. Total rules applied 691 place count 1912 transition count 1402
Deduced a syphon composed of 199 places in 2 ms
Ensure Unique test removed 199 places
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 1 with 597 rules applied. Total rules applied 1288 place count 1514 transition count 1402
Free-agglomeration rule applied 307 times.
Iterating global reduction 1 with 307 rules applied. Total rules applied 1595 place count 1514 transition count 1095
Ensure Unique test removed 199 places
Reduce places removed 506 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 195 transitions
Trivial Post-agglo rules discarded 195 transitions
Performed 195 trivial Post agglomeration. Transition count delta: 195
Iterating post reduction 1 with 900 rules applied. Total rules applied 2495 place count 1008 transition count 701
Reduce places removed 195 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 198 rules applied. Total rules applied 2693 place count 813 transition count 698
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2696 place count 810 transition count 698
Performed 195 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 195 Pre rules applied. Total rules applied 2696 place count 810 transition count 503
Deduced a syphon composed of 195 places in 1 ms
Reduce places removed 195 places and 0 transitions.
Iterating global reduction 4 with 390 rules applied. Total rules applied 3086 place count 615 transition count 503
Free-agglomeration rule (complex) applied 88 times.
Iterating global reduction 4 with 88 rules applied. Total rules applied 3174 place count 615 transition count 415
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 4 with 88 rules applied. Total rules applied 3262 place count 527 transition count 415
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3263 place count 526 transition count 414
Applied a total of 3263 rules in 4014 ms. Remains 526 /2604 variables (removed 2078) and now considering 414/1603 (removed 1189) transitions.
Running 212 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6421808462780343149.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16772447611967344798.kers'
[2026-05-31 20:00:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6421808462780343149.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16772447611967344798.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 414 rows 526 cols 1432 entries
Finished phase 1 with 322 SingleSign rule and 1 generalized
[2026-05-31 20:00:18] [INFO ] Computed 203 invariants in 4 ms
Computed 203 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-16772447611967344798.kers
Total runtime 6 ms.
[2026-05-31 20:00:18] [INFO ] State equation strengthened by 88 read => feed constraints.
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 1/1 constraints. Problems are: Problem set: 110 solved, 102 unsolved
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD309 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 1/2 constraints. Problems are: Problem set: 200 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 0/2 constraints. Problems are: Problem set: 200 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 8/526 variables, 202/204 constraints. Problems are: Problem set: 200 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 0/204 constraints. Problems are: Problem set: 200 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 414/940 variables, 526/730 constraints. Problems are: Problem set: 200 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/940 variables, 88/818 constraints. Problems are: Problem set: 200 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/940 variables, 0/818 constraints. Problems are: Problem set: 200 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/940 variables, 0/818 constraints. Problems are: Problem set: 200 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 940/940 variables, and 818 constraints, problems are : Problem set: 200 solved, 12 unsolved in 3087 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 202/202 constraints, State Equation: 526/526 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 212/211 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 200 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 200 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 112/324 variables, 1/1 constraints. Problems are: Problem set: 200 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 1/2 constraints. Problems are: Problem set: 200 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 0/2 constraints. Problems are: Problem set: 200 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 202/526 variables, 202/204 constraints. Problems are: Problem set: 200 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 0/204 constraints. Problems are: Problem set: 200 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 414/940 variables, 526/730 constraints. Problems are: Problem set: 200 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/940 variables, 88/818 constraints. Problems are: Problem set: 200 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/940 variables, 11/829 constraints. Problems are: Problem set: 200 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/940 variables, 0/829 constraints. Problems are: Problem set: 200 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/940 variables, 0/829 constraints. Problems are: Problem set: 200 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 940/940 variables, and 829 constraints, problems are : Problem set: 200 solved, 12 unsolved in 3099 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 202/202 constraints, State Equation: 526/526 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 12/211 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6512ms problems are : Problem set: 200 solved, 12 unsolved
Search for dead transitions found 200 dead transitions in 6514ms
Found 200 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 200 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 526/2604 places, 214/1603 transitions.
Graph (complete) has 419 edges and 526 vertex of which 415 are kept as prefixes of interest. Removing 111 places using SCC suffix rule.1 ms
Discarding 111 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 415 transition count 214
Applied a total of 2 rules in 59 ms. Remains 415 /526 variables (removed 111) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 10617 ms. Remains : 415/2604 places, 214/1603 transitions.
RANDOM walk for 486 steps (6 resets) in 22 ms. (21 steps per ms) remains 0/1 properties
FORMULA SupplyChain-PT-00200-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 24892 ms.

BK_STOP 1780257624929

--------------------
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="SupplyChain-PT-00200"
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 SupplyChain-PT-00200, 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 r354-tall-178024402800214"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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