About the Execution of ITS-Tools for PolyORBLF-COL-S06J06T04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1935.292 | 239941.00 | 322127.00 | 726.30 | 3 2 1 10 3 4 1 4 1 1 4 4 4 1 3 2 | normal |
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.r210-smll-177969942100389.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 PolyORBLF-COL-S06J06T04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-smll-177969942100389
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 6.5K Mar 8 15:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 8 15:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 8 15:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 8 15:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.5K Mar 16 08:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 16 08:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 16 08:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 16 08:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 8 15:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Mar 8 15:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 8 15:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Mar 8 15:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 16 08:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 16 08:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S06J06T04-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1780154382276
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J06T04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202604301425
[2026-05-30 15:19:44] [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-30 15:19:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-30 15:19:44] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-05-30 15:19:45] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-30 15:19:46] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1453 ms
[2026-05-30 15:19:46] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 506 PT places and 7196.0 transition bindings in 52 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
[2026-05-30 15:19:46] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 11 ms.
[2026-05-30 15:19:46] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10545697924759310121.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16231659806746594908.kers'
[2026-05-30 15:19:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10545697924759310121.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16231659806746594908.kers]
Normalized transition count is 64 out of 65 initially.
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 64 rows 73 cols 204 entries
Finished phase 1 with 43 SingleSign rule and 12 generalized
[2026-05-30 15:19:46] [INFO ] Computed 26 invariants in 1 ms
Computed 26 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16231659806746594908.kers
Total runtime 2 ms.
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 10, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 1, +inf, +inf, +inf, +inf, +inf, 4, +inf]
[2026-05-30 15:19:46] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-497891446842579361.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16781546876628086779.kers'
[2026-05-30 15:19:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-497891446842579361.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16781546876628086779.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 64 rows 73 cols 204 entries
Finished phase 1 with 43 SingleSign rule and 12 generalized
[2026-05-30 15:19:46] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16781546876628086779.kers
Total runtime 1 ms.
[2026-05-30 15:19:47] [INFO ] [Real]Absence check using 8 positive place invariants in 17 ms returned sat
[2026-05-30 15:19:47] [INFO ] [Real]Absence check using 8 positive and 18 generalized place invariants in 26 ms returned sat
[2026-05-30 15:19:47] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2026-05-30 15:19:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-30 15:19:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2026-05-30 15:19:47] [INFO ] [Nat]Absence check using 8 positive and 18 generalized place invariants in 32 ms returned sat
[2026-05-30 15:19:47] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2026-05-30 15:19:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-30 15:19:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2026-05-30 15:19:47] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 16 ms.
[2026-05-30 15:19:48] [INFO ] Added : 54 causal constraints over 11 iterations in 417 ms. Result :sat
Minimization took 265 ms.
[2026-05-30 15:19:48] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2026-05-30 15:19:48] [INFO ] [Real]Absence check using 8 positive and 18 generalized place invariants in 15 ms returned sat
[2026-05-30 15:19:48] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2026-05-30 15:19:48] [INFO ] [Real]Added 8 Read/Feed constraints in 5 ms returned sat
[2026-05-30 15:19:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-30 15:19:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2026-05-30 15:19:48] [INFO ] [Nat]Absence check using 8 positive and 18 generalized place invariants in 15 ms returned sat
[2026-05-30 15:19:48] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2026-05-30 15:19:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 14 ms returned sat
[2026-05-30 15:19:48] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 12 ms.
[2026-05-30 15:19:48] [INFO ] Added : 10 causal constraints over 3 iterations in 79 ms. Result :sat
Minimization took 54 ms.
[2026-05-30 15:19:48] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2026-05-30 15:19:48] [INFO ] [Real]Absence check using 8 positive and 18 generalized place invariants in 18 ms returned sat
[2026-05-30 15:19:49] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2026-05-30 15:19:49] [INFO ] [Real]Added 8 Read/Feed constraints in 5 ms returned sat
[2026-05-30 15:19:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-30 15:19:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2026-05-30 15:19:49] [INFO ] [Nat]Absence check using 8 positive and 18 generalized place invariants in 17 ms returned sat
[2026-05-30 15:19:49] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2026-05-30 15:19:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2026-05-30 15:19:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2026-05-30 15:19:49] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 11 ms.
[2026-05-30 15:19:49] [INFO ] Added : 58 causal constraints over 12 iterations in 225 ms. Result :sat
Minimization took 62 ms.
[2026-05-30 15:19:49] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2026-05-30 15:19:49] [INFO ] [Real]Absence check using 8 positive and 18 generalized place invariants in 8 ms returned unsat
[2026-05-30 15:19:49] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-30 15:19:49] [INFO ] [Real]Absence check using 8 positive and 18 generalized place invariants in 12 ms returned sat
[2026-05-30 15:19:49] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2026-05-30 15:19:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-30 15:19:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-30 15:19:49] [INFO ] [Nat]Absence check using 8 positive and 18 generalized place invariants in 62 ms returned sat
[2026-05-30 15:19:49] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2026-05-30 15:19:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2026-05-30 15:19:49] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-30 15:19:50] [INFO ] Added : 43 causal constraints over 9 iterations in 113 ms. Result :sat
Minimization took 38 ms.
[2026-05-30 15:19:50] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-30 15:19:50] [INFO ] [Real]Absence check using 8 positive and 18 generalized place invariants in 7 ms returned sat
[2026-05-30 15:19:50] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2026-05-30 15:19:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-30 15:19:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-30 15:19:50] [INFO ] [Nat]Absence check using 8 positive and 18 generalized place invariants in 9 ms returned sat
[2026-05-30 15:19:50] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2026-05-30 15:19:50] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2026-05-30 15:19:50] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-30 15:19:50] [INFO ] Added : 58 causal constraints over 12 iterations in 146 ms. Result :sat
Minimization took 48 ms.
[2026-05-30 15:19:50] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-30 15:19:50] [INFO ] [Real]Absence check using 8 positive and 18 generalized place invariants in 8 ms returned sat
[2026-05-30 15:19:50] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2026-05-30 15:19:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-30 15:19:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-30 15:19:50] [INFO ] [Nat]Absence check using 8 positive and 18 generalized place invariants in 13 ms returned sat
[2026-05-30 15:19:50] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2026-05-30 15:19:50] [INFO ] [Nat]Added 8 Read/Feed constraints in 12 ms returned sat
[2026-05-30 15:19:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2026-05-30 15:19:50] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 11 ms.
[2026-05-30 15:19:51] [INFO ] Added : 35 causal constraints over 7 iterations in 129 ms. Result :sat
Minimization took 48 ms.
[2026-05-30 15:19:51] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-30 15:19:51] [INFO ] [Real]Absence check using 8 positive and 18 generalized place invariants in 8 ms returned sat
[2026-05-30 15:19:51] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2026-05-30 15:19:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-30 15:19:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-30 15:19:51] [INFO ] [Nat]Absence check using 8 positive and 18 generalized place invariants in 60 ms returned sat
[2026-05-30 15:19:51] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2026-05-30 15:19:51] [INFO ] [Nat]Added 8 Read/Feed constraints in 46 ms returned sat
[2026-05-30 15:19:51] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-30 15:19:51] [INFO ] Added : 3 causal constraints over 1 iterations in 37 ms. Result :sat
Minimization took 42 ms.
[2026-05-30 15:19:51] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-30 15:19:51] [INFO ] [Real]Absence check using 8 positive and 18 generalized place invariants in 12 ms returned sat
[2026-05-30 15:19:51] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2026-05-30 15:19:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-30 15:19:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-30 15:19:51] [INFO ] [Nat]Absence check using 8 positive and 18 generalized place invariants in 11 ms returned sat
[2026-05-30 15:19:51] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2026-05-30 15:19:51] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2026-05-30 15:19:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2026-05-30 15:19:51] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-30 15:19:52] [INFO ] Added : 61 causal constraints over 13 iterations in 235 ms. Result :sat
Minimization took 39 ms.
[2026-05-30 15:19:52] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-30 15:19:52] [INFO ] [Real]Absence check using 8 positive and 18 generalized place invariants in 12 ms returned sat
[2026-05-30 15:19:52] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2026-05-30 15:19:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-30 15:19:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-30 15:19:52] [INFO ] [Nat]Absence check using 8 positive and 18 generalized place invariants in 12 ms returned sat
[2026-05-30 15:19:52] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2026-05-30 15:19:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2026-05-30 15:19:52] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-30 15:19:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2026-05-30 15:19:52] [INFO ] Added : 58 causal constraints over 12 iterations in 326 ms. Result :sat
Minimization took 59 ms.
[2026-05-30 15:19:52] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-30 15:19:52] [INFO ] [Real]Absence check using 8 positive and 18 generalized place invariants in 13 ms returned sat
[2026-05-30 15:19:52] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2026-05-30 15:19:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-30 15:19:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-30 15:19:52] [INFO ] [Nat]Absence check using 8 positive and 18 generalized place invariants in 25 ms returned sat
[2026-05-30 15:19:53] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2026-05-30 15:19:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2026-05-30 15:19:53] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-30 15:19:53] [INFO ] Added : 27 causal constraints over 6 iterations in 113 ms. Result :sat
Minimization took 95 ms.
[2026-05-30 15:19:53] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-30 15:19:53] [INFO ] [Real]Absence check using 8 positive and 18 generalized place invariants in 12 ms returned sat
[2026-05-30 15:19:53] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2026-05-30 15:19:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-30 15:19:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-30 15:19:53] [INFO ] [Nat]Absence check using 8 positive and 18 generalized place invariants in 9 ms returned sat
[2026-05-30 15:19:53] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2026-05-30 15:19:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 25 ms returned sat
[2026-05-30 15:19:53] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-30 15:19:53] [INFO ] Added : 43 causal constraints over 10 iterations in 150 ms. Result :sat
Minimization took 55 ms.
[2026-05-30 15:19:53] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-30 15:19:53] [INFO ] [Real]Absence check using 8 positive and 18 generalized place invariants in 12 ms returned sat
[2026-05-30 15:19:53] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2026-05-30 15:19:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-30 15:19:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-30 15:19:54] [INFO ] [Nat]Absence check using 8 positive and 18 generalized place invariants in 13 ms returned sat
[2026-05-30 15:19:54] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2026-05-30 15:19:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2026-05-30 15:19:54] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-30 15:19:54] [INFO ] Added : 54 causal constraints over 11 iterations in 198 ms. Result :sat
Minimization took 70 ms.
[2026-05-30 15:19:54] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-30 15:19:54] [INFO ] [Real]Absence check using 8 positive and 18 generalized place invariants in 15 ms returned sat
[2026-05-30 15:19:54] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2026-05-30 15:19:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-30 15:19:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-30 15:19:54] [INFO ] [Nat]Absence check using 8 positive and 18 generalized place invariants in 12 ms returned sat
[2026-05-30 15:19:54] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2026-05-30 15:19:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 17 ms returned sat
[2026-05-30 15:19:54] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-30 15:19:54] [INFO ] Added : 31 causal constraints over 7 iterations in 116 ms. Result :sat
Minimization took 51 ms.
[2026-05-30 15:19:54] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-30 15:19:54] [INFO ] [Real]Absence check using 8 positive and 18 generalized place invariants in 13 ms returned sat
[2026-05-30 15:19:54] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2026-05-30 15:19:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-30 15:19:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-30 15:19:55] [INFO ] [Nat]Absence check using 8 positive and 18 generalized place invariants in 12 ms returned sat
[2026-05-30 15:19:55] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2026-05-30 15:19:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2026-05-30 15:19:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 72 ms
[2026-05-30 15:19:55] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-30 15:19:55] [INFO ] [Real]Absence check using 8 positive and 18 generalized place invariants in 11 ms returned sat
[2026-05-30 15:19:55] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2026-05-30 15:19:55] [INFO ] [Real]Added 8 Read/Feed constraints in 7 ms returned sat
[2026-05-30 15:19:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-30 15:19:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-30 15:19:55] [INFO ] [Nat]Absence check using 8 positive and 18 generalized place invariants in 13 ms returned sat
[2026-05-30 15:19:55] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2026-05-30 15:19:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 14 ms returned sat
[2026-05-30 15:19:55] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-30 15:19:55] [INFO ] Added : 23 causal constraints over 6 iterations in 106 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 10, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0] Max Struct:[+inf, +inf, +inf, 10, +inf, +inf, +inf, +inf, 1, +inf, +inf, +inf, +inf, +inf, 3, +inf]
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-14 3 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-03 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
[2026-05-30 15:19:55] [INFO ] Unfolded HLPN to a Petri net with 506 places and 7154 transitions 59824 arcs in 279 ms.
[2026-05-30 15:19:55] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 1, +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, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 1, +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-17494863405952820149.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14852977629076085623.kers'
[2026-05-30 15:19:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17494863405952820149.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14852977629076085623.kers]
Normalized transition count is 1750 out of 1774 initially.
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 2 ms.
// Phase 1: matrix 1750 rows 495 cols 9950 entries
Finished phase 1 with 290 SingleSign rule and 162 generalized
[2026-05-30 15:19:56] [INFO ] Computed 54 invariants in 18 ms
Computed 54 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-14852977629076085623.kers
Total runtime 23 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[120, 4320, 17280, 30, 520, 4321, 40, 1, 520, 520, 72528, 184, 520, 184]
RANDOM walk for 10000 steps (38 resets) in 208 ms. (47 steps per ms)
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130006 steps (246 resets) in 767 ms. (169 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 2, 1, 3, 4, 1, 4, 1, 4, 4, 4, 1, 2] Max Struct:[120, 4320, 17280, 30, 520, 4321, 40, 520, 520, 72528, 184, 520, 184]
[2026-05-30 15:19:57] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7956721378596249119.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6346229214493369063.kers'
[2026-05-30 15:19:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7956721378596249119.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6346229214493369063.kers]
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 3 ms.
// Phase 1: matrix 1750 rows 495 cols 9950 entries
Finished phase 1 with 290 SingleSign rule and 162 generalized
[2026-05-30 15:19:57] [INFO ] Computed 54 invariants in 28 ms
Computed 54 P flows in 29 ms.
Exported basis to /tmp/petrispot-output-6346229214493369063.kers
Total runtime 31 ms.
[2026-05-30 15:19:57] [INFO ] [Real]Absence check using 26 positive place invariants in 21 ms returned sat
[2026-05-30 15:19:57] [INFO ] [Real]Absence check using 26 positive and 28 generalized place invariants in 15 ms returned unsat
[2026-05-30 15:19:57] [INFO ] [Real]Absence check using 26 positive place invariants in 20 ms returned sat
[2026-05-30 15:19:57] [INFO ] [Real]Absence check using 26 positive and 28 generalized place invariants in 34 ms returned unsat
[2026-05-30 15:19:57] [INFO ] [Real]Absence check using 26 positive place invariants in 23 ms returned sat
[2026-05-30 15:19:57] [INFO ] [Real]Absence check using 26 positive and 28 generalized place invariants in 39 ms returned unsat
[2026-05-30 15:19:57] [INFO ] [Real]Absence check using 26 positive place invariants in 23 ms returned sat
[2026-05-30 15:19:57] [INFO ] [Real]Absence check using 26 positive and 28 generalized place invariants in 17 ms returned unsat
[2026-05-30 15:19:58] [INFO ] [Real]Absence check using 26 positive place invariants in 20 ms returned sat
[2026-05-30 15:19:58] [INFO ] [Real]Absence check using 26 positive and 28 generalized place invariants in 21 ms returned unsat
[2026-05-30 15:19:58] [INFO ] [Real]Absence check using 26 positive place invariants in 17 ms returned sat
[2026-05-30 15:19:58] [INFO ] [Real]Absence check using 26 positive and 28 generalized place invariants in 12 ms returned unsat
[2026-05-30 15:19:58] [INFO ] [Real]Absence check using 26 positive place invariants in 14 ms returned sat
[2026-05-30 15:19:58] [INFO ] [Real]Absence check using 26 positive and 28 generalized place invariants in 10 ms returned unsat
[2026-05-30 15:19:58] [INFO ] [Real]Absence check using 26 positive place invariants in 14 ms returned sat
[2026-05-30 15:19:58] [INFO ] [Real]Absence check using 26 positive and 28 generalized place invariants in 25 ms returned unsat
[2026-05-30 15:19:58] [INFO ] [Real]Absence check using 26 positive place invariants in 15 ms returned sat
[2026-05-30 15:19:58] [INFO ] [Real]Absence check using 26 positive and 28 generalized place invariants in 27 ms returned unsat
[2026-05-30 15:19:58] [INFO ] [Real]Absence check using 26 positive place invariants in 15 ms returned sat
[2026-05-30 15:19:58] [INFO ] [Real]Absence check using 26 positive and 28 generalized place invariants in 11 ms returned unsat
[2026-05-30 15:19:58] [INFO ] [Real]Absence check using 26 positive place invariants in 14 ms returned sat
[2026-05-30 15:19:58] [INFO ] [Real]Absence check using 26 positive and 28 generalized place invariants in 13 ms returned unsat
[2026-05-30 15:19:58] [INFO ] [Real]Absence check using 26 positive place invariants in 20 ms returned sat
[2026-05-30 15:19:58] [INFO ] [Real]Absence check using 26 positive and 28 generalized place invariants in 39 ms returned unsat
[2026-05-30 15:19:59] [INFO ] [Real]Absence check using 26 positive place invariants in 16 ms returned sat
[2026-05-30 15:19:59] [INFO ] [Real]Absence check using 26 positive and 28 generalized place invariants in 25 ms returned sat
[2026-05-30 15:20:00] [INFO ] [Real]Absence check using state equation in 893 ms returned sat
[2026-05-30 15:20:00] [INFO ] Solution in real domain found non-integer solution.
[2026-05-30 15:20:00] [INFO ] [Nat]Absence check using 26 positive place invariants in 16 ms returned sat
[2026-05-30 15:20:00] [INFO ] [Nat]Absence check using 26 positive and 28 generalized place invariants in 27 ms returned sat
[2026-05-30 15:20:01] [INFO ] [Nat]Absence check using state equation in 1275 ms returned sat
[2026-05-30 15:20:01] [INFO ] State equation strengthened by 112 read => feed constraints.
[2026-05-30 15:20:02] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-30 15:20:02] [INFO ] [Nat]Added 112 Read/Feed constraints in 1024 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[3, 2, 1, 3, 4, 1, 4, 1, 4, 4, 4, 1, 2] Max Struct:[3, 2, 1, 3, 4, 1, 4, 1, 4, 4, 4, 1, 184]
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[184]
Support contains 24 out of 506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 506/506 places, 1774/1774 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 500 transition count 1738
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 78 place count 464 transition count 1738
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 78 place count 464 transition count 1682
Deduced a syphon composed of 56 places in 5 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 190 place count 408 transition count 1682
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 5 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 286 place count 360 transition count 1634
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 294 place count 360 transition count 1626
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 302 place count 352 transition count 1626
Applied a total of 302 rules in 623 ms. Remains 352 /506 variables (removed 154) and now considering 1626/1774 (removed 148) transitions.
Running 1620 sub problems to find dead transitions.
[2026-05-30 15:20:03] [INFO ] Flow matrix only has 1602 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2692738833148397979.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8920614433839262476.kers'
[2026-05-30 15:20:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2692738833148397979.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8920614433839262476.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 3 ms.
// Phase 1: matrix 1602 rows 347 cols 10642 entries
Finished phase 1 with 142 SingleSign rule and 162 generalized
[2026-05-30 15:20:03] [INFO ] Computed 48 invariants in 26 ms
Computed 48 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-8920614433839262476.kers
Total runtime 32 ms.
[2026-05-30 15:20:03] [INFO ] State equation strengthened by 112 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 16/37 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 346/1954 variables, and 37 constraints, problems are : Problem set: 0 solved, 1620 unsolved in 20124 ms.
Refiners :[Positive P Invariants (semi-flows): 21/26 constraints, Generalized P Invariants (flows): 16/22 constraints, State Equation: 0/352 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1620/720 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1620 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 16/37 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 346/1954 variables, and 40 constraints, problems are : Problem set: 0 solved, 1620 unsolved in 20064 ms.
Refiners :[Positive P Invariants (semi-flows): 21/26 constraints, Generalized P Invariants (flows): 16/22 constraints, State Equation: 0/352 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 900/720 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43717ms problems are : Problem set: 0 solved, 1620 unsolved
Search for dead transitions found 0 dead transitions in 43786ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44488 ms. Remains : 352/506 places, 1626/1774 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4769419162241693908.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11958748567525667270.kers'
[2026-05-30 15:20:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4769419162241693908.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11958748567525667270.kers]
Normalized transition count is 1602 out of 1626 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 3 ms.
// Phase 1: matrix 1602 rows 347 cols 10642 entries
Finished phase 1 with 142 SingleSign rule and 162 generalized
[2026-05-30 15:20:47] [INFO ] Computed 48 invariants in 27 ms
Computed 48 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-11958748567525667270.kers
Total runtime 32 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[184]
RANDOM walk for 1000000 steps (9784 resets) in 10109 ms. (98 steps per ms)
BEST_FIRST walk for 1000000 steps (337 resets) in 4195 ms. (238 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[184]
[2026-05-30 15:21:01] [INFO ] Flow matrix only has 1602 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14906637814063381590.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15298262812553548482.kers'
[2026-05-30 15:21:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14906637814063381590.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15298262812553548482.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 3 ms.
// Phase 1: matrix 1602 rows 347 cols 10642 entries
Finished phase 1 with 142 SingleSign rule and 162 generalized
[2026-05-30 15:21:01] [INFO ] Computed 48 invariants in 26 ms
Computed 48 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-15298262812553548482.kers
Total runtime 31 ms.
[2026-05-30 15:21:01] [INFO ] [Real]Absence check using 26 positive place invariants in 16 ms returned sat
[2026-05-30 15:21:01] [INFO ] [Real]Absence check using 26 positive and 22 generalized place invariants in 18 ms returned sat
[2026-05-30 15:21:02] [INFO ] [Real]Absence check using state equation in 884 ms returned sat
[2026-05-30 15:21:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-30 15:21:02] [INFO ] [Nat]Absence check using 26 positive place invariants in 14 ms returned sat
[2026-05-30 15:21:02] [INFO ] [Nat]Absence check using 26 positive and 22 generalized place invariants in 22 ms returned sat
[2026-05-30 15:21:04] [INFO ] [Nat]Absence check using state equation in 2135 ms returned sat
[2026-05-30 15:21:04] [INFO ] State equation strengthened by 112 read => feed constraints.
[2026-05-30 15:21:05] [INFO ] [Nat]Added 112 Read/Feed constraints in 853 ms returned sat
[2026-05-30 15:21:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2192 ms
[2026-05-30 15:21:08] [INFO ] Computed and/alt/rep : 1190/4818/1185 causal constraints (skipped 411 transitions) in 362 ms.
[2026-05-30 15:21:13] [INFO ] Added : 112 causal constraints over 23 iterations in 5660 ms. Result :sat
Minimization took 5155 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[184]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[184]
Support contains 24 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 1626/1626 transitions.
Applied a total of 0 rules in 49 ms. Remains 352 /352 variables (removed 0) and now considering 1626/1626 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 352/352 places, 1626/1626 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 1626/1626 transitions.
Applied a total of 0 rules in 49 ms. Remains 352 /352 variables (removed 0) and now considering 1626/1626 (removed 0) transitions.
[2026-05-30 15:21:18] [INFO ] Flow matrix only has 1602 transitions (discarded 24 similar events)
[2026-05-30 15:21:18] [INFO ] Invariant cache hit.
[2026-05-30 15:21:20] [INFO ] Implicit Places using invariants in 1860 ms returned [306, 307, 308, 309]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 1879 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 348/352 places, 1626/1626 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 344 transition count 1622
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 344 transition count 1622
Applied a total of 8 rules in 99 ms. Remains 344 /348 variables (removed 4) and now considering 1622/1626 (removed 4) transitions.
[2026-05-30 15:21:20] [INFO ] Flow matrix only has 1598 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7114314062452786932.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7250478763900305918.kers'
[2026-05-30 15:21:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7114314062452786932.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7250478763900305918.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 3 ms.
// Phase 1: matrix 1598 rows 339 cols 10622 entries
Finished phase 1 with 161 SingleSign rule and 139 generalized
[2026-05-30 15:21:20] [INFO ] Computed 44 invariants in 22 ms
Computed 44 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-7250478763900305918.kers
Total runtime 27 ms.
[2026-05-30 15:21:22] [INFO ] Implicit Places using invariants in 1756 ms returned []
[2026-05-30 15:21:22] [INFO ] Flow matrix only has 1598 transitions (discarded 24 similar events)
[2026-05-30 15:21:22] [INFO ] Invariant cache hit.
[2026-05-30 15:21:23] [INFO ] State equation strengthened by 112 read => feed constraints.
[2026-05-30 15:21:30] [INFO ] Implicit Places using invariants and state equation in 7881 ms returned []
Implicit Place search using SMT with State Equation took 9639 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 344/352 places, 1622/1626 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 11668 ms. Remains : 344/352 places, 1622/1626 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12525880148442847949.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4885092823931286463.kers'
[2026-05-30 15:21:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12525880148442847949.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4885092823931286463.kers]
Normalized transition count is 1598 out of 1622 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 3 ms.
// Phase 1: matrix 1598 rows 339 cols 10622 entries
Finished phase 1 with 161 SingleSign rule and 139 generalized
[2026-05-30 15:21:30] [INFO ] Computed 44 invariants in 22 ms
Computed 44 P flows in 22 ms.
Exported basis to /tmp/petrispot-output-4885092823931286463.kers
Total runtime 24 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[184]
RANDOM walk for 1000000 steps (9829 resets) in 9760 ms. (102 steps per ms)
BEST_FIRST walk for 1000001 steps (363 resets) in 3908 ms. (255 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[184]
[2026-05-30 15:21:44] [INFO ] Flow matrix only has 1598 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16921977454213972044.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9437802973631813953.kers'
[2026-05-30 15:21:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16921977454213972044.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9437802973631813953.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 3 ms.
// Phase 1: matrix 1598 rows 339 cols 10622 entries
Finished phase 1 with 161 SingleSign rule and 139 generalized
[2026-05-30 15:21:44] [INFO ] Computed 44 invariants in 20 ms
Computed 44 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-9437802973631813953.kers
Total runtime 25 ms.
[2026-05-30 15:21:44] [INFO ] [Real]Absence check using 26 positive place invariants in 12 ms returned sat
[2026-05-30 15:21:44] [INFO ] [Real]Absence check using 26 positive and 18 generalized place invariants in 17 ms returned sat
[2026-05-30 15:21:45] [INFO ] [Real]Absence check using state equation in 847 ms returned sat
[2026-05-30 15:21:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-30 15:21:45] [INFO ] [Nat]Absence check using 26 positive place invariants in 11 ms returned sat
[2026-05-30 15:21:45] [INFO ] [Nat]Absence check using 26 positive and 18 generalized place invariants in 16 ms returned sat
[2026-05-30 15:21:46] [INFO ] [Nat]Absence check using state equation in 819 ms returned sat
[2026-05-30 15:21:46] [INFO ] State equation strengthened by 112 read => feed constraints.
[2026-05-30 15:21:47] [INFO ] [Nat]Added 112 Read/Feed constraints in 1075 ms returned sat
[2026-05-30 15:21:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2546 ms
[2026-05-30 15:21:50] [INFO ] Computed and/alt/rep : 1186/4813/1181 causal constraints (skipped 411 transitions) in 328 ms.
[2026-05-30 15:21:53] [INFO ] Added : 107 causal constraints over 22 iterations in 4109 ms. Result :sat
Minimization took 5088 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[184]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[184]
Support contains 24 out of 344 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 1622/1622 transitions.
Applied a total of 0 rules in 56 ms. Remains 344 /344 variables (removed 0) and now considering 1622/1622 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 344/344 places, 1622/1622 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 1622/1622 transitions.
Applied a total of 0 rules in 58 ms. Remains 344 /344 variables (removed 0) and now considering 1622/1622 (removed 0) transitions.
[2026-05-30 15:21:59] [INFO ] Flow matrix only has 1598 transitions (discarded 24 similar events)
[2026-05-30 15:21:59] [INFO ] Invariant cache hit.
[2026-05-30 15:22:00] [INFO ] Implicit Places using invariants in 1880 ms returned []
[2026-05-30 15:22:01] [INFO ] Flow matrix only has 1598 transitions (discarded 24 similar events)
[2026-05-30 15:22:01] [INFO ] Invariant cache hit.
[2026-05-30 15:22:01] [INFO ] State equation strengthened by 112 read => feed constraints.
[2026-05-30 15:22:08] [INFO ] Implicit Places using invariants and state equation in 7631 ms returned []
Implicit Place search using SMT with State Equation took 9513 ms to find 0 implicit places.
[2026-05-30 15:22:08] [INFO ] Redundant transitions in 156 ms returned []
Running 1616 sub problems to find dead transitions.
[2026-05-30 15:22:08] [INFO ] Flow matrix only has 1598 transitions (discarded 24 similar events)
[2026-05-30 15:22:08] [INFO ] Invariant cache hit.
[2026-05-30 15:22:08] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/338 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 338/1942 variables, and 36 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 21/26 constraints, Generalized P Invariants (flows): 12/18 constraints, State Equation: 0/344 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1616/720 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/338 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 338/1942 variables, and 36 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 21/26 constraints, Generalized P Invariants (flows): 12/18 constraints, State Equation: 0/344 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 896/720 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62968ms problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 62982ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72731 ms. Remains : 344/344 places, 1622/1622 transitions.
RANDOM walk for 40000 steps (352 resets) in 1820 ms. (21 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (35 resets) in 668 ms. (59 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (30 resets) in 553 ms. (72 steps per ms) remains 2/2 properties
[2026-05-30 15:23:12] [INFO ] Flatten gal took : 700 ms
[2026-05-30 15:23:13] [INFO ] Flatten gal took : 286 ms
[2026-05-30 15:23:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9250861550073820610.gal : 150 ms
[2026-05-30 15:23:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4226944012054571266.prop : 5 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/ReachabilityCardinality9250861550073820610.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4226944012054571266.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/ReachabilityCardinality4226944012054571266.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 14
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :14 after 22
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :22 after 31
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :31 after 40
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :40 after 67
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :67 after 329
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :329 after 1444
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1444 after 3832
Interrupted probabilistic random walk after 99436 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 2
Probabilistic random walk after 99436 steps, saw 65329 distinct states, run finished after 3006 ms. (steps per millisecond=33 ) properties seen :0
[2026-05-30 15:23:15] [INFO ] Flow matrix only has 1598 transitions (discarded 24 similar events)
[2026-05-30 15:23:15] [INFO ] Invariant cache hit.
[2026-05-30 15:23:15] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 90/114 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/128 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 105/233 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 7 (OVERLAPS) 94/327 variables, 12/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 5/332 variables, 5/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/341 variables, 6/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/342 variables, 1/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/342 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1598/1940 variables, 342/385 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1940 variables, 112/497 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1940 variables, 0/497 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1942 variables, 2/499 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1942 variables, 1/500 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1942 variables, 0/500 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1942 variables, 0/500 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1942/1942 variables, and 500 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1664 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 344/344 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/114 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/128 variables, 7/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 105/233 variables, 7/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 94/327 variables, 12/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/332 variables, 5/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/341 variables, 6/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/342 variables, 1/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3832 after 28053
At refinement iteration 14 (INCLUDED_ONLY) 0/342 variables, 4/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/342 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :28053 after 108547
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1940/1942 variables, and 389 constraints, problems are : Problem set: 1 solved, 1 unsolved in 4894 ms.
Refiners :[Positive P Invariants (semi-flows): 25/26 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 342/344 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6591ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 165 ms.
Support contains 24 out of 344 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 1622/1622 transitions.
Applied a total of 0 rules in 56 ms. Remains 344 /344 variables (removed 0) and now considering 1622/1622 (removed 0) transitions.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 344/344 places, 1622/1622 transitions.
RANDOM walk for 40000 steps (357 resets) in 1542 ms. (25 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (25 resets) in 400 ms. (99 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 156741 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 1
Probabilistic random walk after 156741 steps, saw 103676 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
[2026-05-30 15:23:26] [INFO ] Flow matrix only has 1598 transitions (discarded 24 similar events)
[2026-05-30 15:23:26] [INFO ] Invariant cache hit.
[2026-05-30 15:23:26] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/114 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/128 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 105/233 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 94/327 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 5/332 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/341 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/342 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/342 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1598/1940 variables, 342/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1940 variables, 112/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1940 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1942 variables, 2/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1942 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1942 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1942 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1942/1942 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1477 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 344/344 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/114 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/128 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 105/233 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 94/327 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/332 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/341 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/342 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :108547 after 390104
At refinement iteration 14 (INCLUDED_ONLY) 0/342 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/342 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1598/1940 variables, 342/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1940 variables, 112/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MIN0 is UNSAT
After SMT solving in domain Int declared 1940/1942 variables, and 502 constraints, problems are : Problem set: 1 solved, 0 unsolved in 4643 ms.
Refiners :[Positive P Invariants (semi-flows): 25/26 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 342/344 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6146ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-15 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7644407564311375631.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15772537670720697041.kers'
[2026-05-30 15:23:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7644407564311375631.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15772537670720697041.kers]
Normalized transition count is 1598 out of 1622 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 2 ms.
// Phase 1: matrix 1598 rows 339 cols 10622 entries
Finished phase 1 with 161 SingleSign rule and 139 generalized
[2026-05-30 15:23:32] [INFO ] Computed 44 invariants in 13 ms
Computed 44 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-15772537670720697041.kers
Total runtime 16 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (9756 resets) in 9699 ms. (103 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 237417 ms.
BK_STOP 1780154622217
--------------------
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="PolyORBLF-COL-S06J06T04"
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 PolyORBLF-COL-S06J06T04, 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 r210-smll-177969942100389"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S06J06T04.tgz
mv PolyORBLF-COL-S06J06T04 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 ;