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.r098-tall-177955695700679.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 DLCround-PT-13b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695700679
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 7.3K Mar 6 17:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 6 17:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 6 17:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 6 17:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 09:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 09:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Mar 6 17:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Mar 6 17:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Mar 6 17:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Mar 6 17:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 2.1M Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779650464115

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-13b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-24 19:21:05] [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-24 19:21:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 19:21:05] [INFO ] Load time of PNML (sax parser for PT used): 281 ms
[2026-05-24 19:21:05] [INFO ] Transformed 5343 places.
[2026-05-24 19:21:05] [INFO ] Transformed 8727 transitions.
[2026-05-24 19:21:05] [INFO ] Found NUPN structural information;
[2026-05-24 19:21:05] [INFO ] Parsed PT model containing 5343 places and 8727 transitions and 24849 arcs in 529 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2526 ms. (15 steps per ms) remains 13/16 properties
FORMULA DLCround-PT-13b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 582 ms. (68 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 191 ms. (208 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 662 ms. (60 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 162 ms. (245 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 13/13 properties
[2026-05-24 19:21:07] [INFO ] Flatten gal took : 775 ms
BEST_FIRST walk for 40003 steps (8 resets) in 233 ms. (170 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 13/13 properties
[2026-05-24 19:21:07] [INFO ] Flatten gal took : 300 ms
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 13/13 properties
[2026-05-24 19:21:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2892936055922153166.gal : 134 ms
[2026-05-24 19:21:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14119872138189818157.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/ReachabilityCardinality2892936055922153166.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14119872138189818157.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17599079066177308736.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16460525065653138658.kers'
[2026-05-24 19:21:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17599079066177308736.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16460525065653138658.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 8727 rows 5343 cols 24849 entries
Finished phase 1 with 5031 SingleSign rule and 0 generalized
[2026-05-24 19:21:08] [INFO ] Computed 312 invariants in 86 ms
Computed 312 P flows in 90 ms.
Exported basis to /tmp/petrispot-output-16460525065653138658.kers
Total runtime 97 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 301/301 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Loading property file /tmp/ReachabilityCardinality14119872138189818157.prop.
At refinement iteration 2 (OVERLAPS) 4192/4493 variables, 227/528 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4493 variables, 4192/4720 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4493/14070 variables, and 4720 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5080 ms.
Refiners :[Domain max(s): 4493/5343 constraints, Positive P Invariants (semi-flows): 227/312 constraints, State Equation: 0/5343 constraints, PredecessorRefiner: 13/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 301/301 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 4192/4493 variables, 227/528 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4493 variables, 4192/4720 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4493/14070 variables, and 4720 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5016 ms.
Refiners :[Domain max(s): 4493/5343 constraints, Positive P Invariants (semi-flows): 227/312 constraints, State Equation: 0/5343 constraints, PredecessorRefiner: 8/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10542ms problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 301 out of 5343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5343/5343 places, 8727/8727 transitions.
Graph (trivial) has 4341 edges and 5343 vertex of which 494 / 5343 are part of one of the 54 SCC in 22 ms
Free SCC test removed 440 places
Drop transitions (Empty/Sink Transition effects.) removed 504 transitions
Reduce isomorphic transitions removed 504 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1831 transitions
Trivial Post-agglo rules discarded 1831 transitions
Performed 1831 trivial Post agglomeration. Transition count delta: 1831
Iterating post reduction 0 with 1831 rules applied. Total rules applied 1832 place count 4903 transition count 6392
Reduce places removed 1831 places and 0 transitions.
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 1895 rules applied. Total rules applied 3727 place count 3072 transition count 6328
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
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 2 with 35 rules applied. Total rules applied 3762 place count 3041 transition count 6324
Reduce places removed 2 places and 0 transitions.
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Iterating post reduction 3 with 80 rules applied. Total rules applied 3842 place count 3039 transition count 6246
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 4 with 78 rules applied. Total rules applied 3920 place count 2961 transition count 6246
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 97 Pre rules applied. Total rules applied 3920 place count 2961 transition count 6149
Deduced a syphon composed of 97 places in 38 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 5 with 194 rules applied. Total rules applied 4114 place count 2864 transition count 6149
Discarding 682 places :
Symmetric choice reduction at 5 with 682 rule applications. Total rules 4796 place count 2182 transition count 5467
Iterating global reduction 5 with 682 rules applied. Total rules applied 5478 place count 2182 transition count 5467
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 5493 place count 2182 transition count 5452
Performed 267 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 267 Pre rules applied. Total rules applied 5493 place count 2182 transition count 5185
Deduced a syphon composed of 267 places in 35 ms
Reduce places removed 267 places and 0 transitions.
Iterating global reduction 6 with 534 rules applied. Total rules applied 6027 place count 1915 transition count 5185
Discarding 29 places :
Symmetric choice reduction at 6 with 29 rule applications. Total rules 6056 place count 1886 transition count 4746
Iterating global reduction 6 with 29 rules applied. Total rules applied 6085 place count 1886 transition count 4746
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 6089 place count 1886 transition count 4742
Performed 468 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 468 places in 3 ms
Reduce places removed 468 places and 0 transitions.
Iterating global reduction 7 with 936 rules applied. Total rules applied 7025 place count 1418 transition count 4270
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 7029 place count 1418 transition count 4266
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 7037 place count 1410 transition count 4130
Iterating global reduction 8 with 8 rules applied. Total rules applied 7045 place count 1410 transition count 4130
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: -665
Deduced a syphon composed of 73 places in 3 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 8 with 146 rules applied. Total rules applied 7191 place count 1337 transition count 4795
Drop transitions (Empty/Sink Transition effects.) removed 43 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 8 with 47 rules applied. Total rules applied 7238 place count 1337 transition count 4748
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 7240 place count 1335 transition count 4684
Iterating global reduction 9 with 2 rules applied. Total rules applied 7242 place count 1335 transition count 4684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 7243 place count 1335 transition count 4683
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 7247 place count 1333 transition count 4709
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 7248 place count 1333 transition count 4708
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 11 with 56 rules applied. Total rules applied 7304 place count 1333 transition count 4652
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 11 with 10 rules applied. Total rules applied 7314 place count 1328 transition count 4647
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 7317 place count 1325 transition count 4585
Iterating global reduction 11 with 3 rules applied. Total rules applied 7320 place count 1325 transition count 4585
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 7322 place count 1325 transition count 4583
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 7326 place count 1323 transition count 4609
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 7327 place count 1323 transition count 4608
Free-agglomeration rule applied 428 times with reduction of 64 identical transitions.
Iterating global reduction 12 with 428 rules applied. Total rules applied 7755 place count 1323 transition count 4116
Reduce places removed 428 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 407 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 422 transitions.
Iterating post reduction 12 with 850 rules applied. Total rules applied 8605 place count 895 transition count 3694
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 8607 place count 893 transition count 3675
Iterating global reduction 13 with 2 rules applied. Total rules applied 8609 place count 893 transition count 3675
Drop transitions (Redundant composition of simpler transitions.) removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 13 with 99 rules applied. Total rules applied 8708 place count 893 transition count 3576
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 13 with 2 rules applied. Total rules applied 8710 place count 893 transition count 3636
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 13 with 28 rules applied. Total rules applied 8738 place count 891 transition count 3610
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 14 with 15 rules applied. Total rules applied 8753 place count 891 transition count 3595
Partial Free-agglomeration rule applied 29 times.
Drop transitions (Partial Free agglomeration) removed 29 transitions
Iterating global reduction 14 with 29 rules applied. Total rules applied 8782 place count 891 transition count 3595
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 14 with 9 rules applied. Total rules applied 8791 place count 891 transition count 3586
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 8794 place count 888 transition count 3583
Iterating global reduction 14 with 3 rules applied. Total rules applied 8797 place count 888 transition count 3583
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 8799 place count 886 transition count 3543
Iterating global reduction 14 with 2 rules applied. Total rules applied 8801 place count 886 transition count 3543
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 8802 place count 886 transition count 3542
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 8803 place count 886 transition count 3542
Applied a total of 8803 rules in 2466 ms. Remains 886 /5343 variables (removed 4457) and now considering 3542/8727 (removed 5185) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2478 ms. Remains : 886/5343 places, 3542/8727 transitions.
RANDOM walk for 40000 steps (8 resets) in 2025 ms. (19 steps per ms) remains 7/13 properties
FORMULA DLCround-PT-13b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 353 ms. (113 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 166 ms. (239 steps per ms) remains 6/7 properties
FORMULA DLCround-PT-13b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 6/6 properties
[2026-05-24 19:21:22] [INFO ] Flow matrix only has 1977 transitions (discarded 1565 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-359410900630223083.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18289837986576941647.kers'
[2026-05-24 19:21:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-359410900630223083.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18289837986576941647.kers]
Culling duplicate invariants (modulo rational): removing 121 columns.
Culled 121 columns in 1 ms.
// Phase 1: matrix 1977 rows 765 cols 8669 entries
Finished phase 1 with 574 SingleSign rule and 0 generalized
[2026-05-24 19:21:22] [INFO ] Computed 312 invariants in 12 ms
Computed 312 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-18289837986576941647.kers
Total runtime 14 ms.
[2026-05-24 19:21:22] [INFO ] State equation strengthened by 281 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 488/639 variables, 135/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/639 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 133/772 variables, 63/198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/772 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 114/886 variables, 114/312 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/886 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1977/2863 variables, 886/1198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2863 variables, 281/1479 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2863 variables, 0/1479 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/2863 variables, 0/1479 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2863/2863 variables, and 1479 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1751 ms.
Refiners :[Positive P Invariants (semi-flows): 198/198 constraints, Generalized P Invariants (flows): 114/114 constraints, State Equation: 886/886 constraints, ReadFeed: 281/281 constraints, PredecessorRefiner: 6/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 488/639 variables, 135/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem DLCround-PT-13b-ReachabilityFireability-2024-05 is UNSAT
FORMULA DLCround-PT-13b-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/639 variables, 2/137 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/639 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 133/772 variables, 63/200 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/772 variables, 0/200 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 114/886 variables, 114/314 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/886 variables, 0/314 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1977/2863 variables, 886/1200 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2863 variables, 281/1481 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2863 variables, 2/1483 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2863 variables, 0/1483 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/2863 variables, 1/1484 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2863 variables, 0/1484 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/2863 variables, 0/1484 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2863/2863 variables, and 1484 constraints, problems are : Problem set: 1 solved, 5 unsolved in 4845 ms.
Refiners :[Positive P Invariants (semi-flows): 198/198 constraints, Generalized P Invariants (flows): 114/114 constraints, State Equation: 886/886 constraints, ReadFeed: 281/281 constraints, PredecessorRefiner: 6/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6676ms problems are : Problem set: 1 solved, 5 unsolved
FORMULA DLCround-PT-13b-ReachabilityFireability-2024-08 FALSE TECHNIQUES PARIKH_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-2024-13 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 1445 ms.
Support contains 53 out of 886 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 886/886 places, 3542/3542 transitions.
Graph (trivial) has 468 edges and 886 vertex of which 54 / 886 are part of one of the 17 SCC in 1 ms
Free SCC test removed 37 places
Drop transitions (Empty/Sink Transition effects.) removed 55 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 849 transition count 3441
Reduce places removed 29 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 32 rules applied. Total rules applied 62 place count 820 transition count 3438
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 65 place count 817 transition count 3438
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 65 place count 817 transition count 3412
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 117 place count 791 transition count 3412
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 143 place count 765 transition count 3140
Iterating global reduction 3 with 26 rules applied. Total rules applied 169 place count 765 transition count 3140
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 175 place count 765 transition count 3134
Performed 53 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 281 place count 712 transition count 3079
Drop transitions (Empty/Sink Transition effects.) removed 156 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 177 transitions.
Iterating post reduction 4 with 177 rules applied. Total rules applied 458 place count 712 transition count 2902
Renaming transitions due to excessive name length > 1024 char.
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 470 place count 700 transition count 2679
Iterating global reduction 5 with 12 rules applied. Total rules applied 482 place count 700 transition count 2679
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 489 place count 700 transition count 2672
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 490 place count 699 transition count 2655
Iterating global reduction 6 with 1 rules applied. Total rules applied 491 place count 699 transition count 2655
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 492 place count 699 transition count 2654
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 494 place count 698 transition count 2653
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 495 place count 698 transition count 2652
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -55
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 8 with 28 rules applied. Total rules applied 523 place count 684 transition count 2707
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 534 place count 684 transition count 2696
Drop transitions (Redundant composition of simpler transitions.) removed 117 transitions
Redundant transition composition rules discarded 117 transitions
Iterating global reduction 9 with 117 rules applied. Total rules applied 651 place count 684 transition count 2579
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 654 place count 681 transition count 2558
Iterating global reduction 9 with 3 rules applied. Total rules applied 657 place count 681 transition count 2558
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 658 place count 681 transition count 2557
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 659 place count 680 transition count 2535
Iterating global reduction 10 with 1 rules applied. Total rules applied 660 place count 680 transition count 2535
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 661 place count 680 transition count 2534
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 11 with 16 rules applied. Total rules applied 677 place count 672 transition count 2526
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 681 place count 668 transition count 2446
Iterating global reduction 11 with 4 rules applied. Total rules applied 685 place count 668 transition count 2446
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 688 place count 668 transition count 2443
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 690 place count 667 transition count 2455
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 12 with 13 rules applied. Total rules applied 703 place count 667 transition count 2442
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 704 place count 666 transition count 2425
Iterating global reduction 12 with 1 rules applied. Total rules applied 705 place count 666 transition count 2425
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 706 place count 666 transition count 2424
Free-agglomeration rule applied 152 times with reduction of 55 identical transitions.
Iterating global reduction 13 with 152 rules applied. Total rules applied 858 place count 666 transition count 2217
Reduce places removed 152 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 639 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 654 transitions.
Graph (complete) has 1842 edges and 514 vertex of which 488 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.1 ms
Discarding 26 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Iterating post reduction 13 with 807 rules applied. Total rules applied 1665 place count 488 transition count 1561
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 14 with 50 rules applied. Total rules applied 1715 place count 488 transition count 1511
Discarding 93 places :
Symmetric choice reduction at 15 with 93 rule applications. Total rules 1808 place count 395 transition count 1270
Iterating global reduction 15 with 93 rules applied. Total rules applied 1901 place count 395 transition count 1270
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 15 with 11 rules applied. Total rules applied 1912 place count 395 transition count 1259
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 1914 place count 394 transition count 1258
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1473 edges and 394 vertex of which 393 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 16 with 9 rules applied. Total rules applied 1923 place count 393 transition count 1250
Discarding 6 places :
Symmetric choice reduction at 17 with 6 rule applications. Total rules 1929 place count 387 transition count 1239
Iterating global reduction 17 with 6 rules applied. Total rules applied 1935 place count 387 transition count 1239
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 1939 place count 385 transition count 1257
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 17 with 10 rules applied. Total rules applied 1949 place count 385 transition count 1247
Drop transitions (Redundant composition of simpler transitions.) removed 84 transitions
Redundant transition composition rules discarded 84 transitions
Iterating global reduction 18 with 84 rules applied. Total rules applied 2033 place count 385 transition count 1163
Reduce places removed 3 places and 0 transitions.
Graph (complete) has 1402 edges and 382 vertex of which 376 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Iterating post reduction 18 with 4 rules applied. Total rules applied 2037 place count 376 transition count 1163
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 19 with 26 rules applied. Total rules applied 2063 place count 376 transition count 1137
Discarding 33 places :
Symmetric choice reduction at 20 with 33 rule applications. Total rules 2096 place count 343 transition count 1052
Iterating global reduction 20 with 33 rules applied. Total rules applied 2129 place count 343 transition count 1052
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 20 with 4 rules applied. Total rules applied 2133 place count 341 transition count 1050
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 1266 edges and 341 vertex of which 337 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Iterating post reduction 20 with 15 rules applied. Total rules applied 2148 place count 337 transition count 1034
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 2150 place count 337 transition count 1032
Discarding 10 places :
Symmetric choice reduction at 22 with 10 rule applications. Total rules 2160 place count 327 transition count 1005
Iterating global reduction 22 with 10 rules applied. Total rules applied 2170 place count 327 transition count 1005
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 2172 place count 326 transition count 1011
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 22 with 4 rules applied. Total rules applied 2176 place count 326 transition count 1007
Free-agglomeration rule applied 2 times.
Iterating global reduction 22 with 2 rules applied. Total rules applied 2178 place count 326 transition count 1005
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 22 with 11 rules applied. Total rules applied 2189 place count 324 transition count 996
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 23 with 2 rules applied. Total rules applied 2191 place count 324 transition count 994
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 23 with 3 rules applied. Total rules applied 2194 place count 324 transition count 1023
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 23 with 19 rules applied. Total rules applied 2213 place count 321 transition count 1007
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 24 with 7 rules applied. Total rules applied 2220 place count 321 transition count 1000
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 24 with 5 rules applied. Total rules applied 2225 place count 321 transition count 1000
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 24 with 5 rules applied. Total rules applied 2230 place count 321 transition count 995
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 24 with 10 rules applied. Total rules applied 2240 place count 316 transition count 990
Applied a total of 2240 rules in 651 ms. Remains 316 /886 variables (removed 570) and now considering 990/3542 (removed 2552) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 651 ms. Remains : 316/886 places, 990/3542 transitions.
RANDOM walk for 40000 steps (8 resets) in 831 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 365883 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :0 out of 2
Probabilistic random walk after 365883 steps, saw 307183 distinct states, run finished after 3006 ms. (steps per millisecond=121 ) properties seen :0
[2026-05-24 19:21:34] [INFO ] Flow matrix only has 574 transitions (discarded 416 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13496710515743715743.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8469735770843748276.kers'
[2026-05-24 19:21:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13496710515743715743.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8469735770843748276.kers]
Culling duplicate invariants (modulo rational): removing 37 columns.
Culled 37 columns in 0 ms.
// Phase 1: matrix 574 rows 279 cols 3205 entries
Finished phase 1 with 173 SingleSign rule and 0 generalized
[2026-05-24 19:21:34] [INFO ] Computed 143 invariants in 3 ms
Computed 143 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8469735770843748276.kers
Total runtime 4 ms.
[2026-05-24 19:21:34] [INFO ] State equation strengthened by 163 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 169/222 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 60/282 variables, 33/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 34/316 variables, 34/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 574/890 variables, 316/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/890 variables, 163/622 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/890 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/890 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 890/890 variables, and 622 constraints, problems are : Problem set: 0 solved, 2 unsolved in 391 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 316/316 constraints, ReadFeed: 163/163 constraints, PredecessorRefiner: 2/0 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/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 169/222 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 60/282 variables, 33/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 34/316 variables, 34/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 574/890 variables, 316/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/890 variables, 163/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/890 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/890 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 890/890 variables, and 623 constraints, problems are : Problem set: 0 solved, 2 unsolved in 611 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 316/316 constraints, ReadFeed: 163/163 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1025ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA DLCround-PT-13b-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 116 ms.
Support contains 28 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 990/990 transitions.
Graph (trivial) has 71 edges and 316 vertex of which 13 / 316 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 34 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 306 transition count 955
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 305 transition count 955
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 3 place count 305 transition count 948
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 17 place count 298 transition count 948
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 23 place count 298 transition count 942
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 29 place count 292 transition count 917
Iterating global reduction 3 with 6 rules applied. Total rules applied 35 place count 292 transition count 917
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 36 place count 292 transition count 916
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 50 place count 285 transition count 909
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 53 place count 285 transition count 906
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 55 place count 283 transition count 882
Iterating global reduction 5 with 2 rules applied. Total rules applied 57 place count 283 transition count 882
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 59 place count 283 transition count 880
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 61 place count 282 transition count 886
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 6 with 20 rules applied. Total rules applied 81 place count 282 transition count 866
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 82 place count 281 transition count 854
Iterating global reduction 6 with 1 rules applied. Total rules applied 83 place count 281 transition count 854
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 84 place count 281 transition count 853
Free-agglomeration rule applied 9 times.
Iterating global reduction 7 with 9 rules applied. Total rules applied 93 place count 281 transition count 844
Reduce places removed 9 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 7 with 57 rules applied. Total rules applied 150 place count 272 transition count 796
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 156 place count 272 transition count 790
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 157 place count 272 transition count 790
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 158 place count 272 transition count 789
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 160 place count 271 transition count 788
Applied a total of 160 rules in 108 ms. Remains 271 /316 variables (removed 45) and now considering 788/990 (removed 202) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 271/316 places, 788/990 transitions.
RANDOM walk for 40000 steps (8 resets) in 404 ms. (98 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 690251 steps, run timeout after 3001 ms. (steps per millisecond=230 ) properties seen :0 out of 1
Probabilistic random walk after 690251 steps, saw 548505 distinct states, run finished after 3001 ms. (steps per millisecond=230 ) properties seen :0
[2026-05-24 19:21:38] [INFO ] Flow matrix only has 446 transitions (discarded 342 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4713883057845824190.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8233671195945232565.kers'
[2026-05-24 19:21:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4713883057845824190.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8233671195945232565.kers]
Culling duplicate invariants (modulo rational): removing 40 columns.
Culled 40 columns in 1 ms.
// Phase 1: matrix 446 rows 231 cols 2434 entries
Finished phase 1 with 133 SingleSign rule and 0 generalized
[2026-05-24 19:21:38] [INFO ] Computed 138 invariants in 8 ms
Computed 138 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-8233671195945232565.kers
Total runtime 9 ms.
[2026-05-24 19:21:38] [INFO ] State equation strengthened by 143 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 137/165 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/234 variables, 38/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/271 variables, 37/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 446/717 variables, 271/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/717 variables, 143/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/717 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/717 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 717/717 variables, and 552 constraints, problems are : Problem set: 0 solved, 1 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 271/271 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 1/0 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/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 137/165 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/234 variables, 38/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/271 variables, 37/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 446/717 variables, 271/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/717 variables, 143/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/717 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/717 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 717/717 variables, and 552 constraints, problems are : Problem set: 0 solved, 1 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 271/271 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 621ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 28 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 788/788 transitions.
Applied a total of 0 rules in 10 ms. Remains 271 /271 variables (removed 0) and now considering 788/788 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 271/271 places, 788/788 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 788/788 transitions.
Applied a total of 0 rules in 34 ms. Remains 271 /271 variables (removed 0) and now considering 788/788 (removed 0) transitions.
[2026-05-24 19:21:39] [INFO ] Flow matrix only has 446 transitions (discarded 342 similar events)
[2026-05-24 19:21:39] [INFO ] Invariant cache hit.
[2026-05-24 19:21:39] [INFO ] Implicit Places using invariants in 180 ms returned [14, 36, 178, 270]
Discarding 4 places :
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Implicit Place search using SMT only with invariants took 190 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 267/271 places, 783/788 transitions.
Graph (trivial) has 33 edges and 267 vertex of which 2 / 267 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 262 transition count 771
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 33 place count 262 transition count 747
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 37 place count 258 transition count 737
Iterating global reduction 1 with 4 rules applied. Total rules applied 41 place count 258 transition count 737
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 256 transition count 751
Drop transitions (Redundant composition of simpler transitions.) removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 1 with 47 rules applied. Total rules applied 92 place count 256 transition count 704
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 93 place count 255 transition count 704
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 105 place count 243 transition count 679
Iterating global reduction 2 with 12 rules applied. Total rules applied 117 place count 243 transition count 679
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 243 transition count 678
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 119 place count 242 transition count 678
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 242 transition count 678
Applied a total of 121 rules in 56 ms. Remains 242 /267 variables (removed 25) and now considering 678/783 (removed 105) transitions.
[2026-05-24 19:21:39] [INFO ] Flow matrix only has 423 transitions (discarded 255 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15688639308171168183.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10744794890755998575.kers'
[2026-05-24 19:21:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15688639308171168183.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10744794890755998575.kers]
Culling duplicate invariants (modulo rational): removing 28 columns.
Culled 28 columns in 0 ms.
// Phase 1: matrix 423 rows 214 cols 2370 entries
Finished phase 1 with 125 SingleSign rule and 0 generalized
[2026-05-24 19:21:39] [INFO ] Computed 117 invariants in 2 ms
Computed 117 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-10744794890755998575.kers
Total runtime 5 ms.
[2026-05-24 19:21:39] [INFO ] Implicit Places using invariants in 129 ms returned []
[2026-05-24 19:21:39] [INFO ] Flow matrix only has 423 transitions (discarded 255 similar events)
[2026-05-24 19:21:39] [INFO ] Invariant cache hit.
[2026-05-24 19:21:39] [INFO ] State equation strengthened by 129 read => feed constraints.
[2026-05-24 19:21:40] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 242/271 places, 678/788 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 951 ms. Remains : 242/271 places, 678/788 transitions.
RANDOM walk for 40000 steps (8 resets) in 356 ms. (112 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 755573 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :0 out of 1
Probabilistic random walk after 755573 steps, saw 624940 distinct states, run finished after 3001 ms. (steps per millisecond=251 ) properties seen :0
[2026-05-24 19:21:43] [INFO ] Flow matrix only has 423 transitions (discarded 255 similar events)
[2026-05-24 19:21:43] [INFO ] Invariant cache hit.
[2026-05-24 19:21:43] [INFO ] State equation strengthened by 129 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 130/158 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 56/214 variables, 28/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/242 variables, 28/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 423/665 variables, 242/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/665 variables, 129/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/665 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/665 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 665/665 variables, and 488 constraints, problems are : Problem set: 0 solved, 1 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 242/242 constraints, ReadFeed: 129/129 constraints, PredecessorRefiner: 1/0 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/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 130/158 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 56/214 variables, 28/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/242 variables, 28/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 423/665 variables, 242/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/665 variables, 129/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/665 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/665 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 665/665 variables, and 488 constraints, problems are : Problem set: 0 solved, 1 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 242/242 constraints, ReadFeed: 129/129 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 555ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 115 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=57 )
FORMULA DLCround-PT-13b-ReachabilityFireability-2024-02 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 9 ms.
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 38704 ms.

BK_STOP 1779650504085

--------------------
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="DLCround-PT-13b"
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 DLCround-PT-13b, 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 r098-tall-177955695700679"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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