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-177961074400767.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074400767
=====================================================================

--------------------
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-ReachabilityFireability-2024-00
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-2024-01
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-2024-02
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-2024-03
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-2024-04
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-2024-05
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-2024-06
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-2024-07
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-2024-08
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-2024-09
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-2024-10
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-2024-11
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-2024-12
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-2024-13
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-2024-14
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779754524038

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
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
ReachabilityFireability PT
Running Version 202604301425
[2026-05-26 00:15:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 00:15:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 00:15:25] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2026-05-26 00:15:25] [INFO ] Transformed 600 places.
[2026-05-26 00:15:25] [INFO ] Transformed 545 transitions.
[2026-05-26 00:15:25] [INFO ] Parsed PT model containing 600 places and 545 transitions and 1664 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (72 resets) in 1457 ms. (27 steps per ms) remains 3/16 properties
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-26 00:15:25] [INFO ] Flatten gal took : 187 ms
[2026-05-26 00:15:26] [INFO ] Flatten gal took : 62 ms
BEST_FIRST walk for 40004 steps (8 resets) in 540 ms. (73 steps per ms) remains 3/3 properties
[2026-05-26 00:15:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4076097588072616618.gal : 55 ms
[2026-05-26 00:15:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9275620867015368112.prop : 6 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/ReachabilityCardinality4076097588072616618.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9275620867015368112.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 3/3 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality9275620867015368112.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 464 ms. (86 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2490701869759467855.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2087949914056309105.kers'
[2026-05-26 00:15:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2490701869759467855.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2087949914056309105.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 545 rows 600 cols 1664 entries
Finished phase 1 with 517 SingleSign rule and 28 generalized
[2026-05-26 00:15:26] [INFO ] Computed 55 invariants in 2 ms
Computed 55 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2087949914056309105.kers
Total runtime 4 ms.
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :6 after 17
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :17 after 112
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :112 after 426
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :426 after 525
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :525 after 1152
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1152 after 3.15693e+09
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 283/340 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :3.15693e+09 after 6.97172e+12
At refinement iteration 4 (OVERLAPS) 45/385 variables, 15/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :6.97172e+12 after 2.44547e+13
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 191/576 variables, 28/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 545/1121 variables, 576/631 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1121 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 24/1145 variables, 24/655 constraints. Problems are: Problem set: 0 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: 0 solved, 3 unsolved in 5038 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 283/340 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 45/385 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 191/576 variables, 28/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem HirschbergSinclair-PT-25-ReachabilityFireability-2024-09 is UNSAT
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (INCLUDED_ONLY) 0/576 variables, 4/83 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/576 variables, 0/83 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 545/1121 variables, 576/659 constraints. Problems are: Problem set: 1 solved, 2 unsolved
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :2.44547e+13 after 2.44283e+25
At refinement iteration 12 (INCLUDED_ONLY) 0/1121 variables, 1/660 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1121/1145 variables, and 660 constraints, problems are : Problem set: 1 solved, 2 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 576/600 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10199ms problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 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 575 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Discarding 25 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 138 place count 575 transition count 408
Reduce places removed 137 places and 0 transitions.
Graph (complete) has 775 edges and 438 vertex of which 406 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 138 rules applied. Total rules applied 276 place count 406 transition count 408
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 308 place count 406 transition count 376
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 324 place count 390 transition count 360
Iterating global reduction 3 with 16 rules applied. Total rules applied 340 place count 390 transition count 360
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 353 place count 377 transition count 347
Iterating global reduction 3 with 13 rules applied. Total rules applied 366 place count 377 transition count 347
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 390 place count 377 transition count 323
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 414 place count 353 transition count 323
Reduce places removed 13 places and 13 transitions.
Iterating global reduction 4 with 13 rules applied. Total rules applied 427 place count 340 transition count 310
Applied a total of 427 rules in 187 ms. Remains 340 /600 variables (removed 260) and now considering 310/545 (removed 235) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 340/600 places, 310/545 transitions.
RANDOM walk for 40000 steps (116 resets) in 595 ms. (67 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (16 resets) in 135 ms. (294 steps per ms) remains 1/2 properties
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (20 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8802487137030667728.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4037503020788749489.kers'
[2026-05-26 00:15:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8802487137030667728.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4037503020788749489.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 310 rows 336 cols 824 entries
Finished phase 1 with 305 SingleSign rule and 5 generalized
[2026-05-26 00:15:36] [INFO ] Computed 30 invariants in 1 ms
Computed 30 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4037503020788749489.kers
Total runtime 2 ms.
[2026-05-26 00:15:36] [INFO ] State equation strengthened by 19 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 230/241 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/310 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/314 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 301/615 variables, 314/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/615 variables, 17/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/615 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 34/649 variables, 25/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/649 variables, 2/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/649 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/650 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/650 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/650 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/650 variables, and 389 constraints, problems are : Problem set: 0 solved, 1 unsolved in 505 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 340/340 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 230/241 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/310 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/314 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 301/615 variables, 314/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/615 variables, 17/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/615 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 34/649 variables, 25/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/649 variables, 2/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/649 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/649 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/650 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/650 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/650 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 650/650 variables, and 390 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2596 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 340/340 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3119ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 77 ms.
Support contains 11 out of 340 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 340/340 places, 310/310 transitions.
Graph (complete) has 631 edges and 340 vertex of which 338 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 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 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 338 transition count 262
Reduce places removed 48 places and 0 transitions.
Graph (complete) has 503 edges and 290 vertex of which 280 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 280 transition count 261
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 107 place count 280 transition count 252
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 107 place count 280 transition count 234
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 143 place count 262 transition count 234
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 147 place count 258 transition count 230
Iterating global reduction 3 with 4 rules applied. Total rules applied 151 place count 258 transition count 230
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 153 place count 258 transition count 228
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 462 edges and 256 vertex of which 252 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 3 rules applied. Total rules applied 156 place count 252 transition count 228
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 160 place count 252 transition count 224
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 162 place count 250 transition count 222
Iterating global reduction 6 with 2 rules applied. Total rules applied 164 place count 250 transition count 222
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 168 place count 248 transition count 220
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 173 place count 248 transition count 215
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 178 place count 243 transition count 215
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 7 with 7 rules applied. Total rules applied 185 place count 236 transition count 208
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 5 rules applied. Total rules applied 190 place count 234 transition count 205
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 193 place count 231 transition count 205
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 14 Pre rules applied. Total rules applied 193 place count 231 transition count 191
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 9 with 28 rules applied. Total rules applied 221 place count 217 transition count 191
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 223 place count 216 transition count 190
Applied a total of 223 rules in 98 ms. Remains 216 /340 variables (removed 124) and now considering 190/310 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 216/340 places, 190/310 transitions.
RANDOM walk for 40000 steps (196 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (60 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 103900 steps, run visited all 1 properties in 317 ms. (steps per millisecond=327 )
Probabilistic random walk after 103900 steps, saw 26958 distinct states, run finished after 321 ms. (steps per millisecond=323 ) properties seen :1
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-2024-06 FALSE 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 15561 ms.

BK_STOP 1779754540746

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="ReachabilityFireability"
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 ReachabilityFireability"
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-177961074400767"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;