Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r114-tall-174876422100110.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is HirschbergSinclair-PT-35, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876422100110
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1000K
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 544K May 29 14:32 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 HirschbergSinclair-PT-35-ReachabilityCardinality-2025-00
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2025-01
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2025-02
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2025-03
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2025-04
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2025-05
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2025-06
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2025-07
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2025-08
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2025-09
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2025-10
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2025-11
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2025-12
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2025-13
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2025-14
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748783482287

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-35
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-01 13:11:23] [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]
[2025-06-01 13:11:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 13:11:23] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2025-06-01 13:11:23] [INFO ] Transformed 998 places.
[2025-06-01 13:11:23] [INFO ] Transformed 922 transitions.
[2025-06-01 13:11:23] [INFO ] Parsed PT model containing 998 places and 922 transitions and 2806 arcs in 225 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (40 resets) in 2030 ms. (19 steps per ms) remains 8/16 properties
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-01 13:11:24] [INFO ] Flatten gal took : 242 ms
BEST_FIRST walk for 40004 steps (8 resets) in 300 ms. (132 steps per ms) remains 8/8 properties
[2025-06-01 13:11:24] [INFO ] Flatten gal took : 114 ms
BEST_FIRST walk for 40004 steps (8 resets) in 469 ms. (85 steps per ms) remains 8/8 properties
[2025-06-01 13:11:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5384653824460963457.gal : 68 ms
BEST_FIRST walk for 40004 steps (8 resets) in 323 ms. (123 steps per ms) remains 8/8 properties
[2025-06-01 13:11:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16727474189475742416.prop : 11 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5384653824460963457.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16727474189475742416.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 8/8 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality16727474189475742416.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 398 ms. (100 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 8/8 properties
// Phase 1: matrix 922 rows 998 cols
[2025-06-01 13:11:25] [INFO ] Computed 76 invariants in 36 ms
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :6 after 17
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :17 after 58
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :58 after 707
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :707 after 1558
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :1558 after 2692
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem HirschbergSinclair-PT-35-ReachabilityCardinality-2025-00 is UNSAT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2025-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-35-ReachabilityCardinality-2025-11 is UNSAT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2025-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-35-ReachabilityCardinality-2025-14 is UNSAT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2025-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-35-ReachabilityCardinality-2025-15 is UNSAT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2025-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 706/879 variables, 59/59 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/879 variables, 1/60 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/879 variables, 0/60 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 33/912 variables, 11/71 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/912 variables, 0/71 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 56/968 variables, 5/76 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/968 variables, 0/76 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 922/1890 variables, 968/1044 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1890 variables, 0/1044 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 30/1920 variables, 30/1074 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1920 variables, 0/1074 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/1920 variables, 0/1074 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1920/1920 variables, and 1074 constraints, problems are : Problem set: 4 solved, 4 unsolved in 3283 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 998/998 constraints, PredecessorRefiner: 8/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Problem HirschbergSinclair-PT-35-ReachabilityCardinality-2025-03 is UNSAT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2025-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-35-ReachabilityCardinality-2025-12 is UNSAT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2025-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 722/850 variables, 52/52 constraints. Problems are: Problem set: 6 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 13:11:29] [INFO ] Deduced a trap composed of 23 places in 232 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 13:11:29] [INFO ] Deduced a trap composed of 64 places in 194 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 13:11:29] [INFO ] Deduced a trap composed of 104 places in 188 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 13:11:30] [INFO ] Deduced a trap composed of 182 places in 239 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/850 variables, 4/56 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/850 variables, 0/56 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 56/906 variables, 18/74 constraints. Problems are: Problem set: 6 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 13:11:30] [INFO ] Deduced a trap composed of 69 places in 173 ms of which 15 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/906 variables, 1/75 constraints. Problems are: Problem set: 6 solved, 2 unsolved
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :2692 after 4.03409e+10
At refinement iteration 6 (INCLUDED_ONLY) 0/906 variables, 0/75 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 59/965 variables, 6/81 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/965 variables, 0/81 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 922/1887 variables, 965/1046 constraints. Problems are: Problem set: 6 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 13:11:31] [INFO ] Deduced a trap composed of 15 places in 258 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 13:11:32] [INFO ] Deduced a trap composed of 38 places in 287 ms of which 34 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1887 variables, 2/1048 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1887 variables, 0/1048 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 33/1920 variables, 33/1081 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1920 variables, 1/1082 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1920 variables, 0/1082 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1920 variables, 0/1082 constraints. Problems are: Problem set: 6 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1920/1920 variables, and 1082 constraints, problems are : Problem set: 6 solved, 2 unsolved in 4471 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 998/998 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8009ms problems are : Problem set: 6 solved, 2 unsolved
Parikh walk visited 0 properties in 995 ms.
Support contains 44 out of 998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 998/998 places, 922/922 transitions.
Graph (complete) has 1924 edges and 998 vertex of which 958 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.3 ms
Discarding 40 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 323 transitions
Trivial Post-agglo rules discarded 323 transitions
Performed 323 trivial Post agglomeration. Transition count delta: 323
Iterating post reduction 0 with 329 rules applied. Total rules applied 330 place count 958 transition count 593
Reduce places removed 323 places and 0 transitions.
Graph (complete) has 1108 edges and 635 vertex of which 559 are kept as prefixes of interest. Removing 76 places using SCC suffix rule.2 ms
Discarding 76 places :
Also discarding 0 output transitions
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 337 rules applied. Total rules applied 667 place count 559 transition count 580
Reduce places removed 13 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 2 with 89 rules applied. Total rules applied 756 place count 546 transition count 504
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 762 place count 540 transition count 498
Iterating global reduction 3 with 6 rules applied. Total rules applied 768 place count 540 transition count 498
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 773 place count 535 transition count 493
Iterating global reduction 3 with 5 rules applied. Total rules applied 778 place count 535 transition count 493
Free-agglomeration rule (complex) applied 33 times.
Iterating global reduction 3 with 33 rules applied. Total rules applied 811 place count 535 transition count 460
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 844 place count 502 transition count 460
Reduce places removed 29 places and 29 transitions.
Iterating global reduction 4 with 29 rules applied. Total rules applied 873 place count 473 transition count 431
Reduce places removed 3 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 4 with 13 rules applied. Total rules applied 886 place count 470 transition count 421
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 11 rules applied. Total rules applied 897 place count 460 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 898 place count 459 transition count 420
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 19 Pre rules applied. Total rules applied 898 place count 459 transition count 401
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 936 place count 440 transition count 401
Applied a total of 936 rules in 234 ms. Remains 440 /998 variables (removed 558) and now considering 401/922 (removed 521) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 240 ms. Remains : 440/998 places, 401/922 transitions.
RANDOM walk for 40000 steps (96 resets) in 1112 ms. (35 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (24 resets) in 373 ms. (106 steps per ms) remains 1/2 properties
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (32 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
// Phase 1: matrix 401 rows 440 cols
[2025-06-01 13:11:35] [INFO ] Computed 39 invariants in 3 ms
[2025-06-01 13:11:35] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 323/331 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/335 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 87/422 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/423 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 394/817 variables, 423/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/817 variables, 18/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/817 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 19/836 variables, 14/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/836 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/837 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/837 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/837 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 837/841 variables, and 495 constraints, problems are : Problem set: 0 solved, 1 unsolved in 566 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 438/440 constraints, ReadFeed: 18/18 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
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 323/331 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/335 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 87/422 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/423 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 394/817 variables, 423/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/817 variables, 18/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/817 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 19/836 variables, 14/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/836 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/836 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/837 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/837 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/837 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 837/841 variables, and 496 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1349 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 438/440 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1936ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 5 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 401/401 transitions.
Graph (complete) has 799 edges and 440 vertex of which 435 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 435 transition count 344
Reduce places removed 69 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 544 edges and 366 vertex of which 353 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 169 rules applied. Total rules applied 227 place count 353 transition count 243
Reduce places removed 96 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 104 rules applied. Total rules applied 331 place count 257 transition count 235
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 331 place count 257 transition count 195
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 411 place count 217 transition count 195
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 413 place count 216 transition count 194
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 418 place count 216 transition count 189
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 424 place count 210 transition count 189
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 424 place count 210 transition count 181
Deduced a syphon composed of 8 places in 7 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 440 place count 202 transition count 181
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 445 place count 197 transition count 176
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 4 with 13 rules applied. Total rules applied 458 place count 195 transition count 165
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 469 place count 184 transition count 165
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 7 Pre rules applied. Total rules applied 469 place count 184 transition count 158
Renaming transitions due to excessive name length > 1024 char.
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 483 place count 177 transition count 158
Applied a total of 483 rules in 94 ms. Remains 177 /440 variables (removed 263) and now considering 158/401 (removed 243) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 177/440 places, 158/401 transitions.
RANDOM walk for 40000 steps (252 resets) in 246 ms. (161 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (132 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 203 steps, run visited all 1 properties in 12 ms. (steps per millisecond=16 )
Probabilistic random walk after 203 steps, saw 153 distinct states, run finished after 17 ms. (steps per millisecond=11 ) properties seen :1
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_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 13812 ms.

BK_STOP 1748783497559

--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="HirschbergSinclair-PT-35"
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-5832"
echo " Executing tool itstools"
echo " Input is HirschbergSinclair-PT-35, 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 r114-tall-174876422100110"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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