Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r002-oct2-177944366200317.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 ASLink-PT-03a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366200317
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 872K
-rw-r--r-- 1 mcc users 8.4K Mar 5 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Mar 5 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 5 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 15 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Mar 5 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:07 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 357K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779471939178

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-03a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-22 17:45:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 17:45:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 17:45:40] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2026-05-22 17:45:40] [INFO ] Transformed 821 places.
[2026-05-22 17:45:40] [INFO ] Transformed 1281 transitions.
[2026-05-22 17:45:40] [INFO ] Found NUPN structural information;
[2026-05-22 17:45:40] [INFO ] Parsed PT model containing 821 places and 1281 transitions and 4839 arcs in 237 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 13 transitions
Reduce redundant transitions removed 13 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8394597436942116332.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8067786277441449600.kers'
[2026-05-22 17:45:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8394597436942116332.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8067786277441449600.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 1268 rows 809 cols 4789 entries
Finished phase 1 with 297 SingleSign rule and 368 generalized
[2026-05-22 17:45:40] [INFO ] Computed 156 invariants in 8 ms
Computed 156 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-8067786277441449600.kers
Total runtime 10 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (90 resets) in 61 ms. (161 steps per ms)
FORMULA ASLink-PT-03a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (55 resets) in 56 ms. (526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-22 17:45:40] [INFO ] Invariant cache hit.
[2026-05-22 17:45:41] [INFO ] [Real]Absence check using 33 positive place invariants in 25 ms returned sat
[2026-05-22 17:45:41] [INFO ] [Real]Absence check using 33 positive and 123 generalized place invariants in 90 ms returned sat
[2026-05-22 17:45:41] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2026-05-22 17:45:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 17:45:41] [INFO ] [Nat]Absence check using 33 positive place invariants in 18 ms returned sat
[2026-05-22 17:45:41] [INFO ] [Nat]Absence check using 33 positive and 123 generalized place invariants in 32 ms returned sat
[2026-05-22 17:45:42] [INFO ] [Nat]Absence check using state equation in 690 ms returned sat
[2026-05-22 17:45:42] [INFO ] Computed and/alt/rep : 486/1798/486 causal constraints (skipped 781 transitions) in 73 ms.
[2026-05-22 17:45:46] [INFO ] Added : 270 causal constraints over 54 iterations in 4061 ms. Result :unknown
[2026-05-22 17:45:46] [INFO ] [Real]Absence check using 33 positive place invariants in 16 ms returned sat
[2026-05-22 17:45:46] [INFO ] [Real]Absence check using 33 positive and 123 generalized place invariants in 31 ms returned sat
[2026-05-22 17:45:47] [INFO ] [Real]Absence check using state equation in 312 ms returned sat
[2026-05-22 17:45:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 17:45:47] [INFO ] [Nat]Absence check using 33 positive place invariants in 35 ms returned sat
[2026-05-22 17:45:47] [INFO ] [Nat]Absence check using 33 positive and 123 generalized place invariants in 32 ms returned sat
[2026-05-22 17:45:47] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2026-05-22 17:45:48] [INFO ] Computed and/alt/rep : 486/1798/486 causal constraints (skipped 781 transitions) in 68 ms.
[2026-05-22 17:45:50] [INFO ] Added : 115 causal constraints over 23 iterations in 2363 ms. Result :sat
Minimization took 608 ms.
[2026-05-22 17:45:51] [INFO ] [Real]Absence check using 33 positive place invariants in 16 ms returned sat
[2026-05-22 17:45:51] [INFO ] [Real]Absence check using 33 positive and 123 generalized place invariants in 35 ms returned sat
[2026-05-22 17:45:51] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2026-05-22 17:45:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 17:45:51] [INFO ] [Nat]Absence check using 33 positive place invariants in 22 ms returned sat
[2026-05-22 17:45:51] [INFO ] [Nat]Absence check using 33 positive and 123 generalized place invariants in 30 ms returned sat
[2026-05-22 17:45:52] [INFO ] [Nat]Absence check using state equation in 471 ms returned sat
[2026-05-22 17:45:52] [INFO ] Computed and/alt/rep : 486/1798/486 causal constraints (skipped 781 transitions) in 79 ms.
[2026-05-22 17:45:55] [INFO ] Added : 210 causal constraints over 42 iterations in 3277 ms. Result :sat
Minimization took 740 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 0] Max Struct:[1, 1, 1]
FORMULA ASLink-PT-03a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_GUIDED_WALK
FORMULA ASLink-PT-03a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_GUIDED_WALK
Support contains 1 out of 821 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p23) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 821/821 places, 1267/1267 transitions.
Ensure Unique test removed 12 places
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 803 transition count 1197
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 158 place count 733 transition count 1197
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 158 place count 733 transition count 1128
Deduced a syphon composed of 69 places in 3 ms
Ensure Unique test removed 27 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 165 rules applied. Total rules applied 323 place count 637 transition count 1128
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 2 with 1 rules applied. Total rules applied 324 place count 637 transition count 1127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 325 place count 636 transition count 1127
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 330 place count 631 transition count 1099
Iterating global reduction 4 with 5 rules applied. Total rules applied 335 place count 631 transition count 1099
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 4 with 4 rules applied. Total rules applied 339 place count 630 transition count 1096
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 341 place count 628 transition count 1096
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 342 place count 627 transition count 1088
Iterating global reduction 6 with 1 rules applied. Total rules applied 343 place count 627 transition count 1088
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 344 place count 626 transition count 1080
Iterating global reduction 6 with 1 rules applied. Total rules applied 345 place count 626 transition count 1080
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 346 place count 625 transition count 1072
Iterating global reduction 6 with 1 rules applied. Total rules applied 347 place count 625 transition count 1072
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 348 place count 624 transition count 1064
Iterating global reduction 6 with 1 rules applied. Total rules applied 349 place count 624 transition count 1064
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 350 place count 623 transition count 1056
Iterating global reduction 6 with 1 rules applied. Total rules applied 351 place count 623 transition count 1056
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 352 place count 622 transition count 1048
Iterating global reduction 6 with 1 rules applied. Total rules applied 353 place count 622 transition count 1048
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 354 place count 621 transition count 1040
Iterating global reduction 6 with 1 rules applied. Total rules applied 355 place count 621 transition count 1040
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 356 place count 620 transition count 1032
Iterating global reduction 6 with 1 rules applied. Total rules applied 357 place count 620 transition count 1032
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 358 place count 619 transition count 1024
Iterating global reduction 6 with 1 rules applied. Total rules applied 359 place count 619 transition count 1024
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 360 place count 618 transition count 1016
Iterating global reduction 6 with 1 rules applied. Total rules applied 361 place count 618 transition count 1016
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 362 place count 617 transition count 1008
Iterating global reduction 6 with 1 rules applied. Total rules applied 363 place count 617 transition count 1008
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 364 place count 616 transition count 1000
Iterating global reduction 6 with 1 rules applied. Total rules applied 365 place count 616 transition count 1000
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 366 place count 615 transition count 992
Iterating global reduction 6 with 1 rules applied. Total rules applied 367 place count 615 transition count 992
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 368 place count 614 transition count 984
Iterating global reduction 6 with 1 rules applied. Total rules applied 369 place count 614 transition count 984
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 370 place count 613 transition count 976
Iterating global reduction 6 with 1 rules applied. Total rules applied 371 place count 613 transition count 976
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 372 place count 612 transition count 968
Iterating global reduction 6 with 1 rules applied. Total rules applied 373 place count 612 transition count 968
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 415 place count 591 transition count 947
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 417 place count 591 transition count 945
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 419 place count 589 transition count 945
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 423 place count 589 transition count 945
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 424 place count 588 transition count 944
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 430 place count 582 transition count 944
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 12 Pre rules applied. Total rules applied 430 place count 582 transition count 932
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 25 rules applied. Total rules applied 455 place count 569 transition count 932
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 8 with 4 rules applied. Total rules applied 459 place count 565 transition count 932
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 459 place count 565 transition count 931
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 461 place count 564 transition count 931
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 469 place count 560 transition count 927
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 472 place count 557 transition count 924
Iterating global reduction 9 with 3 rules applied. Total rules applied 475 place count 557 transition count 924
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 478 place count 557 transition count 921
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 481 place count 554 transition count 921
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 484 place count 554 transition count 921
Applied a total of 484 rules in 742 ms. Remains 554 /821 variables (removed 267) and now considering 921/1267 (removed 346) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 750 ms. Remains : 554/821 places, 921/1267 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7665475440596001252.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9139989624005285237.kers'
[2026-05-22 17:45:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7665475440596001252.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9139989624005285237.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 921 rows 546 cols 3607 entries
Finished phase 1 with 165 SingleSign rule and 290 generalized
[2026-05-22 17:45:57] [INFO ] Computed 99 invariants in 5 ms
Computed 99 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-9139989624005285237.kers
Total runtime 7 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (14092 resets) in 2160 ms. (462 steps per ms)
BEST_FIRST walk for 1000000 steps (3878 resets) in 1037 ms. (963 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-22 17:46:01] [INFO ] Invariant cache hit.
[2026-05-22 17:46:01] [INFO ] [Real]Absence check using 29 positive place invariants in 10 ms returned sat
[2026-05-22 17:46:01] [INFO ] [Real]Absence check using 29 positive and 70 generalized place invariants in 15 ms returned sat
[2026-05-22 17:46:01] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2026-05-22 17:46:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 17:46:01] [INFO ] [Nat]Absence check using 29 positive place invariants in 8 ms returned sat
[2026-05-22 17:46:01] [INFO ] [Nat]Absence check using 29 positive and 70 generalized place invariants in 15 ms returned sat
[2026-05-22 17:46:01] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2026-05-22 17:46:01] [INFO ] Computed and/alt/rep : 353/1379/353 causal constraints (skipped 547 transitions) in 58 ms.
[2026-05-22 17:46:04] [INFO ] Added : 224 causal constraints over 45 iterations in 2872 ms. Result :sat
Minimization took 698 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 554 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 554/554 places, 921/921 transitions.
Applied a total of 0 rules in 18 ms. Remains 554 /554 variables (removed 0) and now considering 921/921 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 554/554 places, 921/921 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 554/554 places, 921/921 transitions.
Applied a total of 0 rules in 15 ms. Remains 554 /554 variables (removed 0) and now considering 921/921 (removed 0) transitions.
[2026-05-22 17:46:05] [INFO ] Invariant cache hit.
[2026-05-22 17:46:06] [INFO ] Implicit Places using invariants in 473 ms returned [0, 18, 19, 20, 33, 51, 69, 138, 142, 151, 152, 153, 171, 189, 258, 262, 263, 274, 275, 276, 294, 312, 381, 385, 386, 389, 400, 401, 402, 420, 422, 425, 443, 444, 445, 446, 458, 464, 470, 476, 482, 488, 494, 500, 506, 512, 518]
[2026-05-22 17:46:06] [INFO ] Actually due to overlaps returned [420, 402, 33, 51, 153, 171, 276, 294, 425, 152, 275, 401, 444, 151, 274, 400, 422, 443, 0, 20, 262, 263, 385, 386, 19, 69, 189, 312, 446, 488, 506, 518, 18, 389, 445, 458, 464, 470, 476, 482, 494, 500, 512]
Discarding 43 places :
Implicit Place search using SMT only with invariants took 477 ms to find 43 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 511/554 places, 921/921 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 508 transition count 844
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 157 place count 431 transition count 844
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 157 place count 431 transition count 825
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 196 place count 411 transition count 825
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 208 place count 407 transition count 817
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 216 place count 399 transition count 817
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 231 place count 384 transition count 802
Iterating global reduction 4 with 15 rules applied. Total rules applied 246 place count 384 transition count 802
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 249 place count 384 transition count 799
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 249 place count 384 transition count 798
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 251 place count 383 transition count 798
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 254 place count 380 transition count 795
Iterating global reduction 5 with 3 rules applied. Total rules applied 257 place count 380 transition count 795
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 258 place count 379 transition count 794
Iterating global reduction 5 with 1 rules applied. Total rules applied 259 place count 379 transition count 794
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 260 place count 378 transition count 793
Iterating global reduction 5 with 1 rules applied. Total rules applied 261 place count 378 transition count 793
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 325 place count 346 transition count 761
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 328 place count 346 transition count 758
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 331 place count 343 transition count 755
Iterating global reduction 6 with 3 rules applied. Total rules applied 334 place count 343 transition count 755
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 337 place count 343 transition count 752
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 344 place count 343 transition count 745
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 352 place count 335 transition count 745
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 362 place count 335 transition count 745
Applied a total of 362 rules in 109 ms. Remains 335 /511 variables (removed 176) and now considering 745/921 (removed 176) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17941133044327212743.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1617365726474840985.kers'
[2026-05-22 17:46:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17941133044327212743.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1617365726474840985.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 745 rows 334 cols 3031 entries
Finished phase 1 with 138 SingleSign rule and 150 generalized
[2026-05-22 17:46:06] [INFO ] Computed 47 invariants in 4 ms
Computed 47 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1617365726474840985.kers
Total runtime 5 ms.
[2026-05-22 17:46:06] [INFO ] Implicit Places using invariants in 319 ms returned [73, 90, 96, 99, 101, 102, 105, 106, 158, 175, 181, 184, 186, 191, 192, 244, 261, 267, 270, 272]
[2026-05-22 17:46:06] [INFO ] Actually due to overlaps returned [105, 191, 106, 192, 90, 96, 101, 102, 175, 181, 186, 261, 267, 272, 73, 158, 244]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 321 ms to find 17 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 318/554 places, 745/921 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 306 transition count 733
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 306 transition count 733
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 303 transition count 730
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 303 transition count 730
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 42 place count 297 transition count 724
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 51 place count 297 transition count 715
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 60 place count 288 transition count 715
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 288 transition count 712
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 66 place count 285 transition count 712
Applied a total of 66 rules in 65 ms. Remains 285 /318 variables (removed 33) and now considering 712/745 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1906917558231288734.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-401624472524052022.kers'
[2026-05-22 17:46:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1906917558231288734.kers, --Pflows, --basisKERS=/tmp/petrispot-output-401624472524052022.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 712 rows 285 cols 2908 entries
Finished phase 1 with 102 SingleSign rule and 153 generalized
[2026-05-22 17:46:06] [INFO ] Computed 30 invariants in 3 ms
Computed 30 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-401624472524052022.kers
Total runtime 4 ms.
[2026-05-22 17:46:06] [INFO ] Implicit Places using invariants in 196 ms returned []
[2026-05-22 17:46:06] [INFO ] Invariant cache hit.
[2026-05-22 17:46:07] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 285/554 places, 712/921 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1730 ms. Remains : 285/554 places, 712/921 transitions.
[2026-05-22 17:46:07] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (21089 resets) in 1567 ms. (637 steps per ms)
BEST_FIRST walk for 1000000 steps (7259 resets) in 700 ms. (1426 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-22 17:46:09] [INFO ] Invariant cache hit.
[2026-05-22 17:46:09] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2026-05-22 17:46:09] [INFO ] [Real]Absence check using 14 positive and 16 generalized place invariants in 4 ms returned sat
[2026-05-22 17:46:09] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2026-05-22 17:46:09] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 17:46:10] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2026-05-22 17:46:10] [INFO ] [Nat]Absence check using 14 positive and 16 generalized place invariants in 6 ms returned sat
[2026-05-22 17:46:10] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2026-05-22 17:46:10] [INFO ] Computed and/alt/rep : 134/690/134 causal constraints (skipped 560 transitions) in 32 ms.
[2026-05-22 17:46:11] [INFO ] Added : 53 causal constraints over 11 iterations in 771 ms. Result :sat
Minimization took 451 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 712/712 transitions.
Applied a total of 0 rules in 9 ms. Remains 285 /285 variables (removed 0) and now considering 712/712 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 285/285 places, 712/712 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 712/712 transitions.
Applied a total of 0 rules in 8 ms. Remains 285 /285 variables (removed 0) and now considering 712/712 (removed 0) transitions.
[2026-05-22 17:46:11] [INFO ] Invariant cache hit.
[2026-05-22 17:46:11] [INFO ] Implicit Places using invariants in 238 ms returned []
[2026-05-22 17:46:11] [INFO ] Invariant cache hit.
[2026-05-22 17:46:12] [INFO ] Implicit Places using invariants and state equation in 656 ms returned []
Implicit Place search using SMT with State Equation took 909 ms to find 0 implicit places.
[2026-05-22 17:46:12] [INFO ] Redundant transitions in 60 ms returned []
Running 694 sub problems to find dead transitions.
[2026-05-22 17:46:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 3 (OVERLAPS) 2/285 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 694 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 285/997 variables, and 32 constraints, problems are : Problem set: 0 solved, 694 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/285 constraints, PredecessorRefiner: 694/694 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 694 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 3 (OVERLAPS) 2/285 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 694 unsolved
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
At refinement iteration 7 (OVERLAPS) 712/997 variables, 285/317 constraints. Problems are: Problem set: 156 solved, 538 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 997/997 variables, and 855 constraints, problems are : Problem set: 156 solved, 538 unsolved in 30112 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 538/694 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60401ms problems are : Problem set: 156 solved, 538 unsolved
Search for dead transitions found 156 dead transitions in 60418ms
Found 156 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 156 transitions
Dead transitions reduction (with SMT) removed 156 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 285/285 places, 556/712 transitions.
Applied a total of 0 rules in 7 ms. Remains 285 /285 variables (removed 0) and now considering 556/556 (removed 0) transitions.
[2026-05-22 17:47:13] [INFO ] Redundant transitions in 28 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61508 ms. Remains : 285/285 places, 556/712 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1962416288554523780.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6623871001959207693.kers'
[2026-05-22 17:47:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1962416288554523780.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6623871001959207693.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 556 rows 285 cols 2284 entries
Finished phase 1 with 78 SingleSign rule and 177 generalized
[2026-05-22 17:47:13] [INFO ] Computed 30 invariants in 9 ms
Computed 30 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-6623871001959207693.kers
Total runtime 11 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (21120 resets) in 1536 ms. (650 steps per ms)
BEST_FIRST walk for 1000001 steps (7296 resets) in 777 ms. (1285 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-22 17:47:15] [INFO ] Invariant cache hit.
[2026-05-22 17:47:15] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2026-05-22 17:47:15] [INFO ] [Real]Absence check using 12 positive and 18 generalized place invariants in 5 ms returned sat
[2026-05-22 17:47:15] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2026-05-22 17:47:15] [INFO ] Computed and/alt/rep : 166/757/166 causal constraints (skipped 372 transitions) in 39 ms.
[2026-05-22 17:47:15] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 17:47:15] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2026-05-22 17:47:15] [INFO ] [Nat]Absence check using 12 positive and 18 generalized place invariants in 16 ms returned sat
[2026-05-22 17:47:16] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2026-05-22 17:47:16] [INFO ] Computed and/alt/rep : 166/757/166 causal constraints (skipped 372 transitions) in 33 ms.
[2026-05-22 17:47:16] [INFO ] Added : 59 causal constraints over 12 iterations in 815 ms. Result :sat
Minimization took 429 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
FORMULA ASLink-PT-03a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_GUIDED_WALK
All properties solved without resorting to model-checking.
Total runtime 97216 ms.

BK_STOP 1779472037627

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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 UpperBounds -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="ASLink-PT-03a"
export BK_EXAMINATION="UpperBounds"
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 ASLink-PT-03a, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-oct2-177944366200317"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-03a.tgz
mv ASLink-PT-03a execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;