About the Execution of ITS-Tools for FunctionPointer-PT-b064
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r146-tall-177961074000101.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 FunctionPointer-PT-b064, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074000101
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 788K
-rw-r--r-- 1 mcc users 5.9K Mar 7 07:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Mar 7 07:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 7 07:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Mar 7 07:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 10:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 10:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 10:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Mar 7 07:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Mar 7 07:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Mar 7 07:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 7 07:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 391K 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 FunctionPointer-PT-b064-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-b064-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-b064-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-b064-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-b064-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-b064-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-b064-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-b064-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-b064-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-b064-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-b064-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-b064-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-b064-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-b064-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-b064-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-b064-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779679336834
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b064
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 03:22:17] [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-25 03:22:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 03:22:18] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2026-05-25 03:22:18] [INFO ] Transformed 306 places.
[2026-05-25 03:22:18] [INFO ] Transformed 840 transitions.
[2026-05-25 03:22:18] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b064-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5900519941412896605.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15869772433221030663.kers'
[2026-05-25 03:22:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5900519941412896605.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15869772433221030663.kers]
Normalized transition count is 414 out of 648 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 414 rows 221 cols 1114 entries
Finished phase 1 with 218 SingleSign rule and 0 generalized
[2026-05-25 03:22:18] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15869772433221030663.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, 64, 64, +inf, +inf, +inf, +inf]
RANDOM walk for 10012 steps (5 resets) in 52 ms. (188 steps per ms)
BEST_FIRST walk for 110009 steps (70 resets) in 132 ms. (827 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 36, 5, 3, 5, 2, 2, 30, 4, 4, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 64, 64, +inf, +inf, +inf, +inf]
[2026-05-25 03:22:18] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-805821294865878981.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15121043992381515269.kers'
[2026-05-25 03:22:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-805821294865878981.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15121043992381515269.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 414 rows 221 cols 1114 entries
Finished phase 1 with 218 SingleSign rule and 0 generalized
[2026-05-25 03:22:18] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15121043992381515269.kers
Total runtime 2 ms.
[2026-05-25 03:22:18] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2026-05-25 03:22:18] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 03:22:18] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2026-05-25 03:22:18] [INFO ] State equation strengthened by 65 read => feed constraints.
[2026-05-25 03:22:18] [INFO ] [Real]Added 65 Read/Feed constraints in 17 ms returned sat
[2026-05-25 03:22:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:22:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 03:22:18] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 03:22:19] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2026-05-25 03:22:19] [INFO ] [Nat]Added 65 Read/Feed constraints in 15 ms returned sat
[2026-05-25 03:22:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2026-05-25 03:22:19] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 60 ms.
[2026-05-25 03:22:19] [INFO ] Added : 2 causal constraints over 1 iterations in 132 ms. Result :sat
Minimization took 79 ms.
[2026-05-25 03:22:19] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 03:22:19] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 03:22:19] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2026-05-25 03:22:19] [INFO ] [Real]Added 65 Read/Feed constraints in 11 ms returned sat
[2026-05-25 03:22:19] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:22:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 03:22:19] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 03:22:19] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2026-05-25 03:22:19] [INFO ] [Nat]Added 65 Read/Feed constraints in 8 ms returned sat
[2026-05-25 03:22:19] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 43 ms.
[2026-05-25 03:22:19] [INFO ] Added : 2 causal constraints over 1 iterations in 101 ms. Result :sat
Minimization took 95 ms.
[2026-05-25 03:22:20] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 03:22:20] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 03:22:20] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2026-05-25 03:22:20] [INFO ] [Real]Added 65 Read/Feed constraints in 9 ms returned sat
[2026-05-25 03:22:20] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:22:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 03:22:20] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 03:22:20] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2026-05-25 03:22:20] [INFO ] [Nat]Added 65 Read/Feed constraints in 12 ms returned sat
[2026-05-25 03:22:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2026-05-25 03:22:20] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 41 ms.
[2026-05-25 03:22:20] [INFO ] Added : 2 causal constraints over 1 iterations in 95 ms. Result :sat
Minimization took 93 ms.
[2026-05-25 03:22:20] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 03:22:20] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 03:22:20] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2026-05-25 03:22:20] [INFO ] [Real]Added 65 Read/Feed constraints in 8 ms returned sat
[2026-05-25 03:22:20] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:22:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 03:22:20] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 03:22:20] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2026-05-25 03:22:20] [INFO ] [Nat]Added 65 Read/Feed constraints in 9 ms returned sat
[2026-05-25 03:22:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 242 ms
[2026-05-25 03:22:21] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 37 ms.
[2026-05-25 03:22:21] [INFO ] Added : 2 causal constraints over 1 iterations in 97 ms. Result :sat
Minimization took 88 ms.
[2026-05-25 03:22:21] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 03:22:21] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 03:22:21] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2026-05-25 03:22:21] [INFO ] [Real]Added 65 Read/Feed constraints in 9 ms returned sat
[2026-05-25 03:22:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:22:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 03:22:21] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 03:22:21] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2026-05-25 03:22:21] [INFO ] [Nat]Added 65 Read/Feed constraints in 10 ms returned sat
[2026-05-25 03:22:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2026-05-25 03:22:21] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 34 ms.
[2026-05-25 03:22:21] [INFO ] Added : 2 causal constraints over 1 iterations in 84 ms. Result :sat
Minimization took 73 ms.
[2026-05-25 03:22:21] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 03:22:21] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 03:22:22] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2026-05-25 03:22:22] [INFO ] [Real]Added 65 Read/Feed constraints in 10 ms returned sat
[2026-05-25 03:22:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:22:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 03:22:22] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 03:22:22] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2026-05-25 03:22:22] [INFO ] [Nat]Added 65 Read/Feed constraints in 8 ms returned sat
[2026-05-25 03:22:22] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 25 ms.
[2026-05-25 03:22:22] [INFO ] Added : 2 causal constraints over 1 iterations in 84 ms. Result :sat
Minimization took 84 ms.
[2026-05-25 03:22:22] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 03:22:22] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 03:22:22] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2026-05-25 03:22:22] [INFO ] [Real]Added 65 Read/Feed constraints in 11 ms returned sat
[2026-05-25 03:22:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:22:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 03:22:22] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 03:22:22] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2026-05-25 03:22:22] [INFO ] [Nat]Added 65 Read/Feed constraints in 9 ms returned sat
[2026-05-25 03:22:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 236 ms
[2026-05-25 03:22:22] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 25 ms.
[2026-05-25 03:22:22] [INFO ] Added : 2 causal constraints over 1 iterations in 73 ms. Result :sat
Minimization took 82 ms.
[2026-05-25 03:22:23] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 03:22:23] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 03:22:23] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2026-05-25 03:22:23] [INFO ] [Real]Added 65 Read/Feed constraints in 10 ms returned sat
[2026-05-25 03:22:23] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:22:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 03:22:23] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 03:22:23] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2026-05-25 03:22:23] [INFO ] [Nat]Added 65 Read/Feed constraints in 9 ms returned sat
[2026-05-25 03:22:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2026-05-25 03:22:23] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 22 ms.
[2026-05-25 03:22:23] [INFO ] Added : 2 causal constraints over 1 iterations in 70 ms. Result :sat
Minimization took 90 ms.
[2026-05-25 03:22:23] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 03:22:23] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 03:22:23] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2026-05-25 03:22:23] [INFO ] [Real]Added 65 Read/Feed constraints in 8 ms returned sat
[2026-05-25 03:22:23] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:22:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 03:22:23] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 03:22:23] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2026-05-25 03:22:23] [INFO ] [Nat]Added 65 Read/Feed constraints in 6 ms returned sat
[2026-05-25 03:22:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2026-05-25 03:22:23] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 22 ms.
[2026-05-25 03:22:24] [INFO ] Added : 2 causal constraints over 1 iterations in 71 ms. Result :sat
Minimization took 76 ms.
[2026-05-25 03:22:24] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 03:22:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 03:22:24] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2026-05-25 03:22:24] [INFO ] [Real]Added 65 Read/Feed constraints in 14 ms returned sat
[2026-05-25 03:22:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:22:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 03:22:24] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 03:22:24] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2026-05-25 03:22:24] [INFO ] [Nat]Added 65 Read/Feed constraints in 14 ms returned sat
[2026-05-25 03:22:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2026-05-25 03:22:24] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 22 ms.
[2026-05-25 03:22:24] [INFO ] Added : 2 causal constraints over 1 iterations in 65 ms. Result :sat
Minimization took 73 ms.
[2026-05-25 03:22:24] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 03:22:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 03:22:24] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2026-05-25 03:22:24] [INFO ] [Real]Added 65 Read/Feed constraints in 8 ms returned sat
[2026-05-25 03:22:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:22:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 03:22:24] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 03:22:24] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2026-05-25 03:22:24] [INFO ] [Nat]Added 65 Read/Feed constraints in 9 ms returned sat
[2026-05-25 03:22:25] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 29 ms.
[2026-05-25 03:22:25] [INFO ] Added : 2 causal constraints over 1 iterations in 71 ms. Result :sat
Minimization took 76 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 36, 5, 3, 5, 2, 2, 30, 4, 4, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 64, 64, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 63, 6, 3, 5, 2, 63, 30, 4, 4, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 64, 64, +inf, +inf, +inf, +inf]
Support contains 11 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 648/648 transitions.
Graph (complete) has 932 edges and 222 vertex of which 200 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.5 ms
Discarding 22 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 200 transition count 621
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 56 place count 172 transition count 461
Iterating global reduction 1 with 28 rules applied. Total rules applied 84 place count 172 transition count 461
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 114 place count 172 transition count 431
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 128 place count 158 transition count 403
Iterating global reduction 2 with 14 rules applied. Total rules applied 142 place count 158 transition count 403
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 146 place count 158 transition count 399
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 152 place count 152 transition count 387
Iterating global reduction 3 with 6 rules applied. Total rules applied 158 place count 152 transition count 387
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 164 place count 146 transition count 363
Iterating global reduction 3 with 6 rules applied. Total rules applied 170 place count 146 transition count 363
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 176 place count 140 transition count 351
Iterating global reduction 3 with 6 rules applied. Total rules applied 182 place count 140 transition count 351
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 186 place count 136 transition count 335
Iterating global reduction 3 with 4 rules applied. Total rules applied 190 place count 136 transition count 335
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 194 place count 132 transition count 319
Iterating global reduction 3 with 4 rules applied. Total rules applied 198 place count 132 transition count 319
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 202 place count 128 transition count 311
Iterating global reduction 3 with 4 rules applied. Total rules applied 206 place count 128 transition count 311
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 210 place count 124 transition count 303
Iterating global reduction 3 with 4 rules applied. Total rules applied 214 place count 124 transition count 303
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 218 place count 120 transition count 295
Iterating global reduction 3 with 4 rules applied. Total rules applied 222 place count 120 transition count 295
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 226 place count 116 transition count 287
Iterating global reduction 3 with 4 rules applied. Total rules applied 230 place count 116 transition count 287
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 234 place count 112 transition count 279
Iterating global reduction 3 with 4 rules applied. Total rules applied 238 place count 112 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 246 place count 112 transition count 271
Applied a total of 246 rules in 134 ms. Remains 112 /222 variables (removed 110) and now considering 271/648 (removed 377) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 112/222 places, 271/648 transitions.
[2026-05-25 03:22:25] [INFO ] Flow matrix only has 179 transitions (discarded 92 similar events)
findPositiveTsemiflow completed in 33 ms - Found solution {33=1, 84=1, 138=1, 175=1} and attempted to minimize in 0 ms success -> {33=1, 84=1, 122=1, 165=1}
FORMULA FunctionPointer-PT-b064-UpperBounds-13 +inf TECHNIQUES TOPOLOGICAL COVER_WALK
FORMULA FunctionPointer-PT-b064-UpperBounds-11 +inf TECHNIQUES TOPOLOGICAL COVER_WALK
FORMULA FunctionPointer-PT-b064-UpperBounds-08 +inf TECHNIQUES TOPOLOGICAL COVER_WALK
FORMULA FunctionPointer-PT-b064-UpperBounds-06 +inf TECHNIQUES TOPOLOGICAL COVER_WALK
FORMULA FunctionPointer-PT-b064-UpperBounds-07 +inf TECHNIQUES TOPOLOGICAL COVER_WALK
FORMULA FunctionPointer-PT-b064-UpperBounds-02 +inf TECHNIQUES TOPOLOGICAL COVER_WALK
FORMULA FunctionPointer-PT-b064-UpperBounds-15 +inf TECHNIQUES TOPOLOGICAL COVER_WALK
Current structural bounds on expressions (after cover walk) : Max Seen:[6, 13, 63, 6] Max Struct:[+inf, 64, 64, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18047803239220891405.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3307509535765575552.kers'
[2026-05-25 03:22:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18047803239220891405.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3307509535765575552.kers]
Normalized transition count is 179 out of 271 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 179 rows 112 cols 510 entries
Finished phase 1 with 109 SingleSign rule and 1 generalized
[2026-05-25 03:22:36] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3307509535765575552.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[6, 13, 63, 6] Max Struct:[+inf, 64, 64, +inf]
RANDOM walk for 1000003 steps (2 resets) in 1041 ms. (959 steps per ms)
FORMULA FunctionPointer-PT-b064-UpperBounds-10 64 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000003 steps (189 resets) in 2495 ms. (1201 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[14, 14, 13] Max Struct:[+inf, 64, +inf]
[2026-05-25 03:22:39] [INFO ] Flow matrix only has 179 transitions (discarded 92 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18191734401616572134.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14862311607570457449.kers'
[2026-05-25 03:22:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18191734401616572134.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14862311607570457449.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 179 rows 112 cols 510 entries
Finished phase 1 with 109 SingleSign rule and 1 generalized
[2026-05-25 03:22:39] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14862311607570457449.kers
Total runtime 3 ms.
[2026-05-25 03:22:39] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2026-05-25 03:22:39] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-25 03:22:39] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2026-05-25 03:22:39] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-25 03:22:39] [INFO ] [Real]Added 36 Read/Feed constraints in 3 ms returned sat
[2026-05-25 03:22:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:22:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2026-05-25 03:22:39] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 03:22:39] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2026-05-25 03:22:39] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2026-05-25 03:22:39] [INFO ] Computed and/alt/rep : 44/117/37 causal constraints (skipped 140 transitions) in 13 ms.
[2026-05-25 03:22:39] [INFO ] Added : 14 causal constraints over 4 iterations in 66 ms. Result :sat
Minimization took 30 ms.
[2026-05-25 03:22:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 03:22:39] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 03:22:39] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2026-05-25 03:22:39] [INFO ] [Real]Added 36 Read/Feed constraints in 6 ms returned sat
[2026-05-25 03:22:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:22:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2026-05-25 03:22:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 03:22:40] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2026-05-25 03:22:40] [INFO ] [Nat]Added 36 Read/Feed constraints in 6 ms returned sat
[2026-05-25 03:22:40] [INFO ] Computed and/alt/rep : 44/117/37 causal constraints (skipped 140 transitions) in 10 ms.
[2026-05-25 03:22:40] [INFO ] Added : 4 causal constraints over 2 iterations in 56 ms. Result :sat
Minimization took 57 ms.
[2026-05-25 03:22:40] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2026-05-25 03:22:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 03:22:40] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2026-05-25 03:22:40] [INFO ] [Real]Added 36 Read/Feed constraints in 5 ms returned sat
[2026-05-25 03:22:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:22:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 03:22:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 03:22:40] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2026-05-25 03:22:40] [INFO ] [Nat]Added 36 Read/Feed constraints in 6 ms returned sat
[2026-05-25 03:22:40] [INFO ] Computed and/alt/rep : 44/117/37 causal constraints (skipped 140 transitions) in 9 ms.
[2026-05-25 03:22:40] [INFO ] Added : 14 causal constraints over 4 iterations in 66 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[14, 14, 13] Max Struct:[+inf, 64, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[14, 62, 13] Max Struct:[+inf, 64, +inf]
Support contains 3 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 271/271 transitions.
Graph (complete) has 462 edges and 112 vertex of which 100 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 100 transition count 250
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 97 transition count 244
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 97 transition count 244
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 97 transition count 242
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 95 transition count 234
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 95 transition count 234
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 93 transition count 230
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 93 transition count 230
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 91 transition count 226
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 91 transition count 226
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 89 transition count 222
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 89 transition count 222
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 87 transition count 218
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 87 transition count 218
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 85 transition count 214
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 85 transition count 214
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 83 transition count 210
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 83 transition count 210
Applied a total of 58 rules in 29 ms. Remains 83 /112 variables (removed 29) and now considering 210/271 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 83/112 places, 210/271 transitions.
[2026-05-25 03:22:40] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
findPositiveTsemiflow completed in 25 ms - Found solution {29=1, 64=1, 96=1, 126=1} and attempted to minimize in 0 ms success -> {29=1, 64=1, 112=1, 128=1}
FORMULA FunctionPointer-PT-b064-UpperBounds-12 +inf TECHNIQUES TOPOLOGICAL COVER_WALK
FORMULA FunctionPointer-PT-b064-UpperBounds-01 +inf TECHNIQUES TOPOLOGICAL COVER_WALK
Current structural bounds on expressions (after cover walk) : Max Seen:[62] Max Struct:[64]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12018545565114318161.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4349859028543611027.kers'
[2026-05-25 03:22:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12018545565114318161.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4349859028543611027.kers]
Normalized transition count is 130 out of 210 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 130 rows 83 cols 384 entries
Finished phase 1 with 80 SingleSign rule and 0 generalized
[2026-05-25 03:22:50] [INFO ] Computed 3 invariants in 2 ms
Computed 3 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4349859028543611027.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[62] Max Struct:[64]
RANDOM walk for 1000000 steps (2 resets) in 1131 ms. (883 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 701 ms. (1424 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[62] Max Struct:[64]
[2026-05-25 03:22:52] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16156396697003946013.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16336916023228982788.kers'
[2026-05-25 03:22:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16156396697003946013.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16336916023228982788.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 130 rows 83 cols 384 entries
Finished phase 1 with 80 SingleSign rule and 0 generalized
[2026-05-25 03:22:52] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16336916023228982788.kers
Total runtime 2 ms.
[2026-05-25 03:22:52] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 03:22:52] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2026-05-25 03:22:52] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 03:22:52] [INFO ] [Real]Added 18 Read/Feed constraints in 4 ms returned sat
[2026-05-25 03:22:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:22:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 03:22:52] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2026-05-25 03:22:52] [INFO ] [Nat]Added 18 Read/Feed constraints in 5 ms returned sat
[2026-05-25 03:22:52] [INFO ] Computed and/alt/rep : 61/202/55 causal constraints (skipped 73 transitions) in 7 ms.
[2026-05-25 03:22:52] [INFO ] Added : 3 causal constraints over 1 iterations in 32 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[62] Max Struct:[64]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[63] Max Struct:[64]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 210/210 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 82 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 82 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 81 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 81 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 80 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 80 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 79 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 79 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 78 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 78 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 77 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 77 transition count 194
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 76 transition count 192
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 76 transition count 192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 75 transition count 190
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 75 transition count 190
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 74 transition count 188
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 74 transition count 188
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 73 transition count 186
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 73 transition count 186
Applied a total of 20 rules in 25 ms. Remains 73 /83 variables (removed 10) and now considering 186/210 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 73/83 places, 186/210 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10286484560421725909.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15567436340966049407.kers'
[2026-05-25 03:22:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10286484560421725909.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15567436340966049407.kers]
Normalized transition count is 112 out of 186 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 112 rows 73 cols 330 entries
Finished phase 1 with 70 SingleSign rule and 0 generalized
[2026-05-25 03:22:52] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15567436340966049407.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[63] Max Struct:[64]
RANDOM walk for 1000002 steps (2 resets) in 1018 ms. (981 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 526 ms. (1897 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[63] Max Struct:[64]
[2026-05-25 03:22:54] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12780258527939309866.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18310397203812323965.kers'
[2026-05-25 03:22:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12780258527939309866.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18310397203812323965.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 112 rows 73 cols 330 entries
Finished phase 1 with 70 SingleSign rule and 0 generalized
[2026-05-25 03:22:54] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18310397203812323965.kers
Total runtime 2 ms.
[2026-05-25 03:22:54] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 03:22:54] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2026-05-25 03:22:54] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-25 03:22:54] [INFO ] [Real]Added 15 Read/Feed constraints in 4 ms returned sat
[2026-05-25 03:22:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:22:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 03:22:54] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2026-05-25 03:22:54] [INFO ] [Nat]Added 15 Read/Feed constraints in 4 ms returned sat
[2026-05-25 03:22:54] [INFO ] Computed and/alt/rep : 60/163/51 causal constraints (skipped 59 transitions) in 9 ms.
[2026-05-25 03:22:54] [INFO ] Added : 3 causal constraints over 1 iterations in 23 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[63] Max Struct:[64]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[63] Max Struct:[64]
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 186/186 transitions.
Applied a total of 0 rules in 15 ms. Remains 73 /73 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 73/73 places, 186/186 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 186/186 transitions.
Applied a total of 0 rules in 11 ms. Remains 73 /73 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2026-05-25 03:22:54] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2026-05-25 03:22:54] [INFO ] Invariant cache hit.
[2026-05-25 03:22:54] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-25 03:22:54] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2026-05-25 03:22:54] [INFO ] Invariant cache hit.
[2026-05-25 03:22:54] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-25 03:22:54] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2026-05-25 03:22:54] [INFO ] Redundant transitions in 7 ms returned []
Running 184 sub problems to find dead transitions.
[2026-05-25 03:22:54] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2026-05-25 03:22:54] [INFO ] Invariant cache hit.
[2026-05-25 03:22:54] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 112/185 variables, 73/76 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 91 constraints, problems are : Problem set: 0 solved, 184 unsolved in 2554 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 112/185 variables, 73/76 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 184/275 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 0/185 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 277 constraints, problems are : Problem set: 0 solved, 184 unsolved in 12595 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 15270ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 15277ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15548 ms. Remains : 73/73 places, 186/186 transitions.
RANDOM walk for 40000 steps (8 resets) in 475 ms. (84 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
[2026-05-25 03:23:10] [INFO ] Flatten gal took : 78 ms
[2026-05-25 03:23:10] [INFO ] Flatten gal took : 37 ms
[2026-05-25 03:23:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6844244870882064697.gal : 10 ms
[2026-05-25 03:23:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3901852212599232415.prop : 1 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/ReachabilityCardinality6844244870882064697.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3901852212599232415.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 ...328
Loading property file /tmp/ReachabilityCardinality3901852212599232415.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :31 after 923
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :923 after 103738
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :103738 after 7.00547e+07
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :7.00547e+07 after 4.05225e+11
Interrupted probabilistic random walk after 648159 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :0 out of 2
Probabilistic random walk after 648159 steps, saw 403465 distinct states, run finished after 3005 ms. (steps per millisecond=215 ) properties seen :0
[2026-05-25 03:23:13] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2026-05-25 03:23:13] [INFO ] Invariant cache hit.
[2026-05-25 03:23:13] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/129 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/148 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/154 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 17/171 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 7/178 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/178 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 4/182 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/182 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 3/185 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 91 constraints, problems are : Problem set: 0 solved, 2 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/129 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/148 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/154 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 17/171 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/171 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 7/178 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/178 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/182 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/182 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 3/185 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/185 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/185 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 93 constraints, problems are : Problem set: 0 solved, 2 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 353ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 505 ms.
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 186/186 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 73/73 places, 186/186 transitions.
RANDOM walk for 40000 steps (8 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 694946 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :0 out of 2
Probabilistic random walk after 694946 steps, saw 432587 distinct states, run finished after 3001 ms. (steps per millisecond=231 ) properties seen :0
[2026-05-25 03:23:17] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2026-05-25 03:23:17] [INFO ] Invariant cache hit.
[2026-05-25 03:23:17] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/129 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/148 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/154 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 17/171 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 7/178 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/178 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 4/182 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/182 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 3/185 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 91 constraints, problems are : Problem set: 0 solved, 2 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/129 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/148 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/154 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 17/171 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/171 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 7/178 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/178 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/182 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/182 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 3/185 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/185 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/185 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 93 constraints, problems are : Problem set: 0 solved, 2 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 328ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 496 ms.
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 186/186 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 73/73 places, 186/186 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 186/186 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2026-05-25 03:23:18] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2026-05-25 03:23:18] [INFO ] Invariant cache hit.
[2026-05-25 03:23:18] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-25 03:23:18] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2026-05-25 03:23:18] [INFO ] Invariant cache hit.
[2026-05-25 03:23:18] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-25 03:23:18] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2026-05-25 03:23:18] [INFO ] Redundant transitions in 7 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 73/73 places, 186/186 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 73 transition count 105
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 88 place count 66 transition count 105
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 88 place count 66 transition count 93
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 112 place count 54 transition count 93
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 140 place count 40 transition count 79
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 146 place count 34 transition count 67
Iterating global reduction 2 with 6 rules applied. Total rules applied 152 place count 34 transition count 67
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 158 place count 28 transition count 55
Iterating global reduction 2 with 6 rules applied. Total rules applied 164 place count 28 transition count 55
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 170 place count 22 transition count 43
Iterating global reduction 2 with 6 rules applied. Total rules applied 176 place count 22 transition count 43
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 182 place count 22 transition count 37
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 186 place count 20 transition count 38
Applied a total of 186 rules in 13 ms. Remains 20 /73 variables (removed 53) and now considering 38/186 (removed 148) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9454271223342407643.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7783613962759388010.kers'
[2026-05-25 03:23:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9454271223342407643.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7783613962759388010.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 38 rows 20 cols 126 entries
Finished phase 1 with 17 SingleSign rule and 0 generalized
[2026-05-25 03:23:18] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7783613962759388010.kers
Total runtime 0 ms.
[2026-05-25 03:23:18] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 03:23:18] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-25 03:23:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 03:23:18] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-25 03:23:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 03:23:18] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 03:23:18] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 03:23:18] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-25 03:23:18] [INFO ] Flatten gal took : 6 ms
[2026-05-25 03:23:18] [INFO ] Flatten gal took : 3 ms
[2026-05-25 03:23:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality732419031219473615.gal : 1 ms
[2026-05-25 03:23:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5315089964583607851.prop : 0 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/ReachabilityCardinality732419031219473615.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5315089964583607851.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 ...327
Loading property file /tmp/ReachabilityCardinality5315089964583607851.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :315 after 11915
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :11915 after 5.28021e+06
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :4.05225e+11 after 2.075e+16
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :5.28021e+06 after 5.2795e+09
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :5.2795e+09 after 2.66698e+10
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2.66698e+10 after 6.94087e+10
Detected timeout of ITS tools.
[2026-05-25 03:23:33] [INFO ] Flatten gal took : 6 ms
[2026-05-25 03:23:33] [INFO ] Applying decomposition
[2026-05-25 03:23:33] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12293033909545915070.txt' '-o' '/tmp/graph12293033909545915070.bin' '-w' '/tmp/graph12293033909545915070.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12293033909545915070.bin' '-l' '-1' '-v' '-w' '/tmp/graph12293033909545915070.weights' '-q' '0' '-e' '0.001'
[2026-05-25 03:23:33] [INFO ] Decomposing Gal with order
[2026-05-25 03:23:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 03:23:33] [INFO ] Removed a total of 33 redundant transitions.
[2026-05-25 03:23:33] [INFO ] Flatten gal took : 53 ms
[2026-05-25 03:23:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2026-05-25 03:23:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7296884010243590428.gal : 2 ms
[2026-05-25 03:23:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12222245070084488690.prop : 0 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/ReachabilityCardinality7296884010243590428.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12222245070084488690.prop' '--nowitness'
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 ...308
Loading property file /tmp/ReachabilityCardinality12222245070084488690.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :315 after 11915
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :11915 after 1.09223e+07
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.09223e+07 after 8.98309e+08
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :8.98309e+08 after 1.52562e+09
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.52562e+09 after 2.00309e+09
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.00309e+09 after 2.3401e+09
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.3401e+09 after 2.55674e+09
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.55674e+09 after 2.64434e+09
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :2.64434e+09 after 2.66898e+09
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2.075e+16 after 5.82585e+20
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30331 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 03:23:48] [INFO ] Flatten gal took : 15 ms
[2026-05-25 03:23:48] [INFO ] Applying decomposition
[2026-05-25 03:23:48] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10696315418588865555.txt' '-o' '/tmp/graph10696315418588865555.bin' '-w' '/tmp/graph10696315418588865555.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10696315418588865555.bin' '-l' '-1' '-v' '-w' '/tmp/graph10696315418588865555.weights' '-q' '0' '-e' '0.001'
[2026-05-25 03:23:48] [INFO ] Decomposing Gal with order
[2026-05-25 03:23:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 03:23:48] [INFO ] Removed a total of 314 redundant transitions.
[2026-05-25 03:23:48] [INFO ] Flatten gal took : 20 ms
[2026-05-25 03:23:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 9 ms.
[2026-05-25 03:23:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15009686635015266511.gal : 3 ms
[2026-05-25 03:23:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4736520314879961883.prop : 0 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/ReachabilityCardinality15009686635015266511.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4736520314879961883.prop' '--nowitness'
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 ...308
Loading property file /tmp/ReachabilityCardinality4736520314879961883.prop.
Detected timeout of ITS tools.
Starting property specific reduction for FunctionPointer-PT-b064-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[64]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[64]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9375178935319725037.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10813289839554778847.kers'
[2026-05-25 03:24:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9375178935319725037.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10813289839554778847.kers]
Normalized transition count is 112 out of 186 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 112 rows 73 cols 330 entries
Finished phase 1 with 70 SingleSign rule and 0 generalized
[2026-05-25 03:24:39] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10813289839554778847.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[64]
RANDOM walk for 10002 steps (2 resets) in 17 ms. (555 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[64]
[2026-05-25 03:24:39] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12226423674118293902.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10709378758785453411.kers'
[2026-05-25 03:24:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12226423674118293902.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10709378758785453411.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 112 rows 73 cols 330 entries
Finished phase 1 with 70 SingleSign rule and 0 generalized
[2026-05-25 03:24:39] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10709378758785453411.kers
Total runtime 8 ms.
[2026-05-25 03:24:39] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 03:24:39] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2026-05-25 03:24:39] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-25 03:24:39] [INFO ] [Real]Added 15 Read/Feed constraints in 3 ms returned sat
[2026-05-25 03:24:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:24:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 03:24:39] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2026-05-25 03:24:39] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2026-05-25 03:24:39] [INFO ] Computed and/alt/rep : 60/163/51 causal constraints (skipped 59 transitions) in 6 ms.
[2026-05-25 03:24:39] [INFO ] Added : 3 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[64]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[63] Max Struct:[64]
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 186/186 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 73/73 places, 186/186 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11768657769670470635.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16312756512091486505.kers'
[2026-05-25 03:24:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11768657769670470635.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16312756512091486505.kers]
Normalized transition count is 112 out of 186 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 112 rows 73 cols 330 entries
Finished phase 1 with 70 SingleSign rule and 0 generalized
[2026-05-25 03:24:39] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16312756512091486505.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[63] Max Struct:[64]
RANDOM walk for 1000001 steps (2 resets) in 1011 ms. (988 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 537 ms. (1858 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[63] Max Struct:[64]
[2026-05-25 03:24:40] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9333903916520628060.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5948398088667725860.kers'
[2026-05-25 03:24:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9333903916520628060.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5948398088667725860.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 112 rows 73 cols 330 entries
Finished phase 1 with 70 SingleSign rule and 0 generalized
[2026-05-25 03:24:40] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5948398088667725860.kers
Total runtime 2 ms.
[2026-05-25 03:24:40] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 03:24:40] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2026-05-25 03:24:40] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-25 03:24:40] [INFO ] [Real]Added 15 Read/Feed constraints in 5 ms returned sat
[2026-05-25 03:24:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:24:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 03:24:41] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2026-05-25 03:24:41] [INFO ] [Nat]Added 15 Read/Feed constraints in 4 ms returned sat
[2026-05-25 03:24:41] [INFO ] Computed and/alt/rep : 60/163/51 causal constraints (skipped 59 transitions) in 8 ms.
[2026-05-25 03:24:41] [INFO ] Added : 3 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[63] Max Struct:[64]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[63] Max Struct:[64]
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 186/186 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 73/73 places, 186/186 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 186/186 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2026-05-25 03:24:41] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2026-05-25 03:24:41] [INFO ] Invariant cache hit.
[2026-05-25 03:24:41] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-25 03:24:41] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2026-05-25 03:24:41] [INFO ] Invariant cache hit.
[2026-05-25 03:24:41] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-25 03:24:41] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2026-05-25 03:24:41] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 73/73 places, 186/186 transitions.
[2026-05-25 03:24:41] [INFO ] Flatten gal took : 13 ms
[2026-05-25 03:24:41] [INFO ] Flatten gal took : 16 ms
RANDOM walk for 40003 steps (8 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
[2026-05-25 03:24:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality672697388014133859.gal : 2 ms
[2026-05-25 03:24:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15474785354421236185.prop : 0 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/ReachabilityCardinality672697388014133859.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15474785354421236185.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 ...328
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality15474785354421236185.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :31 after 923
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :923 after 103738
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :103738 after 7.00547e+07
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :7.00547e+07 after 4.05225e+11
Interrupted probabilistic random walk after 707535 steps, run timeout after 3001 ms. (steps per millisecond=235 ) properties seen :0 out of 2
Probabilistic random walk after 707535 steps, saw 440424 distinct states, run finished after 3001 ms. (steps per millisecond=235 ) properties seen :0
[2026-05-25 03:24:44] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2026-05-25 03:24:44] [INFO ] Invariant cache hit.
[2026-05-25 03:24:44] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/129 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/148 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/154 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 17/171 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 7/178 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/178 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 4/182 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/182 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 3/185 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 91 constraints, problems are : Problem set: 0 solved, 2 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/129 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/148 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/154 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 17/171 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/171 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 7/178 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/178 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/182 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/182 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 3/185 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/185 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/185 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 93 constraints, problems are : Problem set: 0 solved, 2 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 322ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 395 ms.
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 186/186 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 73/73 places, 186/186 transitions.
RANDOM walk for 40002 steps (8 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 701022 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :0 out of 2
Probabilistic random walk after 701022 steps, saw 436369 distinct states, run finished after 3001 ms. (steps per millisecond=233 ) properties seen :0
[2026-05-25 03:24:48] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2026-05-25 03:24:48] [INFO ] Invariant cache hit.
[2026-05-25 03:24:48] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/129 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/148 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/154 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 17/171 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 7/178 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/178 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 4/182 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/182 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 3/185 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 91 constraints, problems are : Problem set: 0 solved, 2 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/129 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/148 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/154 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 17/171 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/171 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 7/178 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/178 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/182 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/182 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 3/185 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/185 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/185 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 93 constraints, problems are : Problem set: 0 solved, 2 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 321ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 489 ms.
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 186/186 transitions.
Applied a total of 0 rules in 8 ms. Remains 73 /73 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 73/73 places, 186/186 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 186/186 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2026-05-25 03:24:49] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2026-05-25 03:24:49] [INFO ] Invariant cache hit.
[2026-05-25 03:24:49] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-25 03:24:49] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2026-05-25 03:24:49] [INFO ] Invariant cache hit.
[2026-05-25 03:24:49] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-25 03:24:49] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2026-05-25 03:24:49] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 230 ms. Remains : 73/73 places, 186/186 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 73 transition count 105
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 88 place count 66 transition count 105
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 88 place count 66 transition count 93
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 112 place count 54 transition count 93
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 140 place count 40 transition count 79
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 146 place count 34 transition count 67
Iterating global reduction 2 with 6 rules applied. Total rules applied 152 place count 34 transition count 67
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 158 place count 28 transition count 55
Iterating global reduction 2 with 6 rules applied. Total rules applied 164 place count 28 transition count 55
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 170 place count 22 transition count 43
Iterating global reduction 2 with 6 rules applied. Total rules applied 176 place count 22 transition count 43
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 182 place count 22 transition count 37
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 186 place count 20 transition count 38
Applied a total of 186 rules in 15 ms. Remains 20 /73 variables (removed 53) and now considering 38/186 (removed 148) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16793641294505154039.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4039958848770257629.kers'
[2026-05-25 03:24:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16793641294505154039.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4039958848770257629.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 38 rows 20 cols 126 entries
Finished phase 1 with 17 SingleSign rule and 0 generalized
[2026-05-25 03:24:49] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4039958848770257629.kers
Total runtime 1 ms.
[2026-05-25 03:24:49] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2026-05-25 03:24:49] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-25 03:24:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 03:24:49] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-25 03:24:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 03:24:49] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 03:24:49] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 03:24:49] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-25 03:24:49] [INFO ] Flatten gal took : 2 ms
[2026-05-25 03:24:49] [INFO ] Flatten gal took : 3 ms
[2026-05-25 03:24:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5744196564243366847.gal : 1 ms
[2026-05-25 03:24:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9111440601706965679.prop : 0 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/ReachabilityCardinality5744196564243366847.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9111440601706965679.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 ...328
Loading property file /tmp/ReachabilityCardinality9111440601706965679.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :315 after 11915
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :11915 after 5.28021e+06
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :4.05225e+11 after 2.075e+16
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :5.28021e+06 after 5.2795e+09
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :5.2795e+09 after 2.66698e+10
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2.66698e+10 after 6.94087e+10
Detected timeout of ITS tools.
[2026-05-25 03:25:04] [INFO ] Flatten gal took : 3 ms
[2026-05-25 03:25:04] [INFO ] Applying decomposition
[2026-05-25 03:25:04] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13842196869851645300.txt' '-o' '/tmp/graph13842196869851645300.bin' '-w' '/tmp/graph13842196869851645300.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13842196869851645300.bin' '-l' '-1' '-v' '-w' '/tmp/graph13842196869851645300.weights' '-q' '0' '-e' '0.001'
[2026-05-25 03:25:04] [INFO ] Decomposing Gal with order
[2026-05-25 03:25:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 03:25:04] [INFO ] Removed a total of 33 redundant transitions.
[2026-05-25 03:25:04] [INFO ] Flatten gal took : 4 ms
[2026-05-25 03:25:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 0 ms.
[2026-05-25 03:25:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8150647818507458892.gal : 0 ms
[2026-05-25 03:25:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3411896825275503790.prop : 0 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/ReachabilityCardinality8150647818507458892.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3411896825275503790.prop' '--nowitness'
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 ...307
Loading property file /tmp/ReachabilityCardinality3411896825275503790.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :315 after 11915
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :11915 after 1.39883e+07
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.39883e+07 after 9.1911e+08
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :9.1911e+08 after 1.54642e+09
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.54642e+09 after 2.02389e+09
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.02389e+09 after 2.3609e+09
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.3609e+09 after 2.57754e+09
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.57754e+09 after 2.66514e+09
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :2.66514e+09 after 2.68978e+09
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2.075e+16 after 5.82585e+20
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30184 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 03:25:19] [INFO ] Flatten gal took : 11 ms
[2026-05-25 03:25:19] [INFO ] Applying decomposition
[2026-05-25 03:25:19] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12823578446201366968.txt' '-o' '/tmp/graph12823578446201366968.bin' '-w' '/tmp/graph12823578446201366968.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12823578446201366968.bin' '-l' '-1' '-v' '-w' '/tmp/graph12823578446201366968.weights' '-q' '0' '-e' '0.001'
[2026-05-25 03:25:19] [INFO ] Decomposing Gal with order
[2026-05-25 03:25:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 03:25:19] [INFO ] Removed a total of 314 redundant transitions.
[2026-05-25 03:25:19] [INFO ] Flatten gal took : 15 ms
[2026-05-25 03:25:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 97 labels/synchronizations in 5 ms.
[2026-05-25 03:25:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14596744706542472307.gal : 2 ms
[2026-05-25 03:25:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2369429053647208220.prop : 0 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/ReachabilityCardinality14596744706542472307.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2369429053647208220.prop' '--nowitness'
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 ...308
Loading property file /tmp/ReachabilityCardinality2369429053647208220.prop.
Detected timeout of ITS tools.
Ending property specific reduction for FunctionPointer-PT-b064-UpperBounds-09 in 90570 ms.
[2026-05-25 03:26:09] [INFO ] Flatten gal took : 7 ms
[2026-05-25 03:26:09] [INFO ] Applying decomposition
[2026-05-25 03:26:09] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6645610179748283775.txt' '-o' '/tmp/graph6645610179748283775.bin' '-w' '/tmp/graph6645610179748283775.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6645610179748283775.bin' '-l' '-1' '-v' '-w' '/tmp/graph6645610179748283775.weights' '-q' '0' '-e' '0.001'
[2026-05-25 03:26:09] [INFO ] Decomposing Gal with order
[2026-05-25 03:26:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 03:26:09] [INFO ] Removed a total of 315 redundant transitions.
[2026-05-25 03:26:09] [INFO ] Flatten gal took : 14 ms
[2026-05-25 03:26:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 90 labels/synchronizations in 5 ms.
[2026-05-25 03:26:09] [INFO ] Time to serialize gal into /tmp/UpperBounds1508451542922020443.gal : 2 ms
[2026-05-25 03:26:09] [INFO ] Time to serialize properties into /tmp/UpperBounds2964007220907378909.prop : 0 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/UpperBounds1508451542922020443.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2964007220907378909.prop' '--nowitness'
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 ...283
Loading property file /tmp/UpperBounds2964007220907378909.prop.
Detected timeout of ITS tools.
[2026-05-25 03:47:27] [INFO ] Flatten gal took : 10 ms
[2026-05-25 03:47:27] [INFO ] Time to serialize gal into /tmp/UpperBounds18010345800467194170.gal : 2 ms
[2026-05-25 03:47:27] [INFO ] Time to serialize properties into /tmp/UpperBounds12816913833127214607.prop : 0 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/UpperBounds18010345800467194170.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12816913833127214607.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 ...306
Loading property file /tmp/UpperBounds12816913833127214607.prop.
Detected timeout of ITS tools.
[2026-05-25 04:08:44] [INFO ] Flatten gal took : 13 ms
[2026-05-25 04:08:44] [INFO ] Input system was already deterministic with 186 transitions.
[2026-05-25 04:08:44] [INFO ] Transformed 73 places.
[2026-05-25 04:08:44] [INFO ] Transformed 186 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-25 04:08:44] [INFO ] Time to serialize gal into /tmp/UpperBounds18159574624809301803.gal : 2 ms
[2026-05-25 04:08:44] [INFO ] Time to serialize properties into /tmp/UpperBounds9671683267304707489.prop : 0 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/UpperBounds18159574624809301803.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9671683267304707489.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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 ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds9671683267304707489.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
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="FunctionPointer-PT-b064"
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 FunctionPointer-PT-b064, 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 r146-tall-177961074000101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b064.tgz
mv FunctionPointer-PT-b064 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 '
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 ;