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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 11K Mar 7 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 7 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Mar 7 17:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 7 17:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K Mar 15 10:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 10:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Mar 7 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Mar 7 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 7 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 7 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 10:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 15 10:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 321K 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 HirschbergSinclair-PT-25-ReachabilityCardinality-2024-00
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-2024-01
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-2024-02
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-2024-03
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-2024-04
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-2024-05
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-2024-06
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-2024-07
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-2024-08
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-2024-09
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-2024-10
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-2024-11
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-2024-12
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-2024-13
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-2024-14
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779754489948

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-25
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-26 00:14:51] [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-26 00:14:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 00:14:51] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2026-05-26 00:14:51] [INFO ] Transformed 600 places.
[2026-05-26 00:14:51] [INFO ] Transformed 545 transitions.
[2026-05-26 00:14:51] [INFO ] Parsed PT model containing 600 places and 545 transitions and 1664 arcs in 188 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (72 resets) in 1655 ms. (24 steps per ms) remains 6/15 properties
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 370 ms. (107 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 6/6 properties
[2026-05-26 00:14:52] [INFO ] Flatten gal took : 257 ms
BEST_FIRST walk for 40004 steps (8 resets) in 597 ms. (66 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 111 ms. (357 steps per ms) remains 6/6 properties
[2026-05-26 00:14:52] [INFO ] Flatten gal took : 133 ms
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 6/6 properties
[2026-05-26 00:14:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7317009583666963204.gal : 30 ms
[2026-05-26 00:14:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7479150082890399786.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/ReachabilityCardinality7317009583666963204.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7479150082890399786.prop' '--nowitness' '--gen-order' 'FOLLOW'
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5287893206455770480.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17867625491448424463.kers'
[2026-05-26 00:14:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5287893206455770480.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17867625491448424463.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 545 rows 600 cols 1664 entries

its-reach command run as :

Finished phase 1 with 517 SingleSign rule and 28 generalized
[2026-05-26 00:14:52] [INFO ] Computed 55 invariants in 3 ms
Computed 55 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-17867625491448424463.kers
Total runtime 6 ms.
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality7479150082890399786.prop.
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :6 after 17
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :17 after 112
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :112 after 426
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :426 after 525
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :525 after 1152
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem HirschbergSinclair-PT-25-ReachabilityCardinality-2024-05 is UNSAT
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 272/393 variables, 22/22 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 6/28 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 12/405 variables, 4/32 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem HirschbergSinclair-PT-25-ReachabilityCardinality-2024-10 is UNSAT
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-25-ReachabilityCardinality-2024-11 is UNSAT
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 172/577 variables, 23/55 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 0/55 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 545/1122 variables, 577/632 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1122 variables, 0/632 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 23/1145 variables, 23/655 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1145 variables, 0/655 constraints. Problems are: Problem set: 3 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1145/1145 variables, and 655 constraints, problems are : Problem set: 3 solved, 3 unsolved in 5103 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 283/374 variables, 19/19 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 6/25 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/374 variables, 17/42 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 0/42 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 21/395 variables, 7/49 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 0/49 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 181/576 variables, 23/72 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 3/75 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/576 variables, 0/75 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 545/1121 variables, 576/651 constraints. Problems are: Problem set: 3 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1121/1145 variables, and 651 constraints, problems are : Problem set: 3 solved, 3 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 576/600 constraints, PredecessorRefiner: 1/5 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10262ms problems are : Problem set: 3 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 91 out of 600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 545/545 transitions.
Graph (complete) has 1148 edges and 600 vertex of which 577 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.2 ms
Discarding 23 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 148 rules applied. Total rules applied 149 place count 577 transition count 397
Reduce places removed 146 places and 0 transitions.
Graph (complete) has 754 edges and 431 vertex of which 397 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.1 ms
Discarding 34 places :
Also discarding 0 output transitions
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 169 rules applied. Total rules applied 318 place count 397 transition count 375
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 374 place count 375 transition count 341
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 376 place count 373 transition count 339
Iterating global reduction 3 with 2 rules applied. Total rules applied 378 place count 373 transition count 339
Free-agglomeration rule (complex) applied 30 times.
Iterating global reduction 3 with 30 rules applied. Total rules applied 408 place count 373 transition count 309
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 438 place count 343 transition count 309
Reduce places removed 16 places and 16 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 454 place count 327 transition count 293
Applied a total of 454 rules in 161 ms. Remains 327 /600 variables (removed 273) and now considering 293/545 (removed 252) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 327/600 places, 293/545 transitions.
RANDOM walk for 40000 steps (136 resets) in 648 ms. (61 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (24 resets) in 177 ms. (224 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (24 resets) in 138 ms. (287 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (20 resets) in 300 ms. (132 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 763620 steps, run timeout after 3001 ms. (steps per millisecond=254 ) properties seen :1 out of 3
Probabilistic random walk after 763620 steps, saw 161382 distinct states, run finished after 3008 ms. (steps per millisecond=253 ) properties seen :1
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2111476850110721682.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-738711926469350584.kers'
[2026-05-26 00:15:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2111476850110721682.kers, --Pflows, --basisKERS=/tmp/petrispot-output-738711926469350584.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 293 rows 327 cols 726 entries
Finished phase 1 with 288 SingleSign rule and 5 generalized
[2026-05-26 00:15:06] [INFO ] Computed 34 invariants in 1 ms
Computed 34 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-738711926469350584.kers
Total runtime 1 ms.
[2026-05-26 00:15:06] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 14/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 235/284 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/286 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 15/301 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 283/584 variables, 301/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 38/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 24/608 variables, 19/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/608 variables, 2/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/608 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/611 variables, 2/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/611 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/611 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/611 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 611/620 variables, and 396 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1328 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 322/327 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 14/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 235/284 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/286 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 15/301 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 283/584 variables, 301/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 38/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 24/608 variables, 19/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/608 variables, 2/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/608 variables, 2/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/608 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 3/611 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/611 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/611 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/611 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 611/620 variables, and 398 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3178 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 322/327 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4523ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 269 ms.
Support contains 35 out of 327 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 327/327 places, 293/293 transitions.
Graph (complete) has 580 edges and 327 vertex of which 315 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 315 transition count 252
Reduce places removed 34 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 458 edges and 281 vertex of which 273 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 43 rules applied. Total rules applied 85 place count 273 transition count 244
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 99 place count 267 transition count 236
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 101 place count 265 transition count 236
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 101 place count 265 transition count 211
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 151 place count 240 transition count 211
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 153 place count 238 transition count 209
Iterating global reduction 4 with 2 rules applied. Total rules applied 155 place count 238 transition count 209
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 161 place count 238 transition count 203
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 168 place count 231 transition count 203
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 168 place count 231 transition count 197
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 180 place count 225 transition count 197
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 183 place count 222 transition count 194
Applied a total of 183 rules in 65 ms. Remains 222 /327 variables (removed 105) and now considering 194/293 (removed 99) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 222/327 places, 194/293 transitions.
RANDOM walk for 40000 steps (204 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (41 resets) in 84 ms. (470 steps per ms) remains 1/2 properties
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 6080 steps (3 resets) in 13 ms. (434 steps per ms) remains 0/1 properties
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_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 20335 ms.

BK_STOP 1779754511516

--------------------
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="HirschbergSinclair-PT-25"
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 HirschbergSinclair-PT-25, 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 r146-tall-177961074400766"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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