Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r002-oct2-177944366000197.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is Anderson-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366000197
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 7.3K Mar 4 18:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 4 18:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Mar 4 18:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 4 18:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 07:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 15 07:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.2K Mar 4 18:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 50K Mar 4 18:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 4 18:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Mar 4 18:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.3M 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 Anderson-PT-10-UpperBounds-00
FORMULA_NAME Anderson-PT-10-UpperBounds-01
FORMULA_NAME Anderson-PT-10-UpperBounds-02
FORMULA_NAME Anderson-PT-10-UpperBounds-03
FORMULA_NAME Anderson-PT-10-UpperBounds-04
FORMULA_NAME Anderson-PT-10-UpperBounds-05
FORMULA_NAME Anderson-PT-10-UpperBounds-06
FORMULA_NAME Anderson-PT-10-UpperBounds-07
FORMULA_NAME Anderson-PT-10-UpperBounds-08
FORMULA_NAME Anderson-PT-10-UpperBounds-09
FORMULA_NAME Anderson-PT-10-UpperBounds-10
FORMULA_NAME Anderson-PT-10-UpperBounds-11
FORMULA_NAME Anderson-PT-10-UpperBounds-12
FORMULA_NAME Anderson-PT-10-UpperBounds-13
FORMULA_NAME Anderson-PT-10-UpperBounds-14
FORMULA_NAME Anderson-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779464239730

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-22 15:37:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 15:37:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 15:37:21] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2026-05-22 15:37:21] [INFO ] Transformed 621 places.
[2026-05-22 15:37:21] [INFO ] Transformed 2480 transitions.
[2026-05-22 15:37:21] [INFO ] Found NUPN structural information;
[2026-05-22 15:37:21] [INFO ] Parsed PT model containing 621 places and 2480 transitions and 9560 arcs in 265 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA Anderson-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14854532747131904332.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9741646958256084919.kers'
[2026-05-22 15:37:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14854532747131904332.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9741646958256084919.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2480 rows 621 cols 9360 entries
Finished phase 1 with 370 SingleSign rule and 228 generalized
[2026-05-22 15:37:21] [INFO ] Computed 23 invariants in 18 ms
Computed 23 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-9741646958256084919.kers
Total runtime 20 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 91 ms. (108 steps per ms)
FORMULA Anderson-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (6 resets) in 125 ms. (238 steps per ms)
FORMULA Anderson-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-22 15:37:21] [INFO ] Invariant cache hit.
[2026-05-22 15:37:22] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2026-05-22 15:37:22] [INFO ] [Real]Absence check using 11 positive and 12 generalized place invariants in 56 ms returned sat
[2026-05-22 15:37:23] [INFO ] [Real]Absence check using state equation in 973 ms returned sat
[2026-05-22 15:37:23] [INFO ] State equation strengthened by 90 read => feed constraints.
[2026-05-22 15:37:23] [INFO ] [Real]Added 90 Read/Feed constraints in 45 ms returned sat
[2026-05-22 15:37:23] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 15:37:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2026-05-22 15:37:23] [INFO ] [Nat]Absence check using 11 positive and 12 generalized place invariants in 58 ms returned sat
[2026-05-22 15:37:25] [INFO ] [Nat]Absence check using state equation in 1521 ms returned sat
[2026-05-22 15:37:25] [INFO ] [Nat]Added 90 Read/Feed constraints in 262 ms returned sat
[2026-05-22 15:37:25] [INFO ] Computed and/alt/rep : 110/120/110 causal constraints (skipped 2360 transitions) in 387 ms.
[2026-05-22 15:37:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1134)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:881)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-22 15:37:29] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2026-05-22 15:37:29] [INFO ] [Real]Absence check using 11 positive and 12 generalized place invariants in 50 ms returned sat
[2026-05-22 15:37:30] [INFO ] [Real]Absence check using state equation in 1147 ms returned sat
[2026-05-22 15:37:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 15:37:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2026-05-22 15:37:30] [INFO ] [Nat]Absence check using 11 positive and 12 generalized place invariants in 115 ms returned sat
[2026-05-22 15:37:32] [INFO ] [Nat]Absence check using state equation in 1318 ms returned sat
[2026-05-22 15:37:32] [INFO ] [Nat]Added 90 Read/Feed constraints in 174 ms returned sat
[2026-05-22 15:37:32] [INFO ] Computed and/alt/rep : 110/120/110 causal constraints (skipped 2360 transitions) in 284 ms.
[2026-05-22 15:37:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 923 ms
[2026-05-22 15:37:34] [INFO ] Added : 2 causal constraints over 1 iterations in 1879 ms. Result :sat
Minimization took 602 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 621 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 621/621 places, 2480/2480 transitions.
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 89 Pre rules applied. Total rules applied 0 place count 621 transition count 2391
Deduced a syphon composed of 89 places in 4 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 0 with 178 rules applied. Total rules applied 178 place count 532 transition count 2391
Discarding 179 places :
Symmetric choice reduction at 0 with 179 rule applications. Total rules 357 place count 353 transition count 592
Iterating global reduction 0 with 179 rules applied. Total rules applied 536 place count 353 transition count 592
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 538 place count 352 transition count 591
Applied a total of 538 rules in 195 ms. Remains 352 /621 variables (removed 269) and now considering 591/2480 (removed 1889) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 352/621 places, 591/2480 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9607910471582207927.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16682257891331931253.kers'
[2026-05-22 15:37:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9607910471582207927.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16682257891331931253.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 591 rows 352 cols 2162 entries
Finished phase 1 with 101 SingleSign rule and 228 generalized
[2026-05-22 15:37:35] [INFO ] Computed 23 invariants in 3 ms
Computed 23 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16682257891331931253.kers
Total runtime 4 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1780 ms. (561 steps per ms)
FORMULA Anderson-PT-10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 946 ms. (1055 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-22 15:37:37] [INFO ] Invariant cache hit.
[2026-05-22 15:37:37] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2026-05-22 15:37:37] [INFO ] [Real]Absence check using 12 positive and 11 generalized place invariants in 14 ms returned sat
[2026-05-22 15:37:38] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2026-05-22 15:37:38] [INFO ] State equation strengthened by 90 read => feed constraints.
[2026-05-22 15:37:38] [INFO ] [Real]Added 90 Read/Feed constraints in 47 ms returned sat
[2026-05-22 15:37:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 15:37:38] [INFO ] [Nat]Absence check using 12 positive place invariants in 12 ms returned sat
[2026-05-22 15:37:38] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 16 ms returned sat
[2026-05-22 15:37:38] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2026-05-22 15:37:38] [INFO ] [Nat]Added 90 Read/Feed constraints in 19 ms returned sat
[2026-05-22 15:37:38] [INFO ] Computed and/alt/rep : 21/31/21 causal constraints (skipped 560 transitions) in 40 ms.
[2026-05-22 15:37:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 403 ms
[2026-05-22 15:37:39] [INFO ] Added : 2 causal constraints over 1 iterations in 660 ms. Result :sat
Minimization took 321 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 352 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p1_9_16) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 590/590 transitions.
Applied a total of 0 rules in 22 ms. Remains 352 /352 variables (removed 0) and now considering 590/590 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 352/352 places, 590/590 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-779203123727963094.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8128281198085865377.kers'
[2026-05-22 15:37:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-779203123727963094.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8128281198085865377.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 590 rows 352 cols 2160 entries
Finished phase 1 with 100 SingleSign rule and 229 generalized
[2026-05-22 15:37:39] [INFO ] Computed 23 invariants in 3 ms
Computed 23 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8128281198085865377.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 1680 ms. (594 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 961 ms. (1039 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-22 15:37:42] [INFO ] Invariant cache hit.
[2026-05-22 15:37:42] [INFO ] [Real]Absence check using 12 positive place invariants in 14 ms returned sat
[2026-05-22 15:37:42] [INFO ] [Real]Absence check using 12 positive and 11 generalized place invariants in 25 ms returned sat
[2026-05-22 15:37:42] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2026-05-22 15:37:42] [INFO ] State equation strengthened by 90 read => feed constraints.
[2026-05-22 15:37:42] [INFO ] [Real]Added 90 Read/Feed constraints in 20 ms returned sat
[2026-05-22 15:37:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 15:37:42] [INFO ] [Nat]Absence check using 12 positive place invariants in 11 ms returned sat
[2026-05-22 15:37:42] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 17 ms returned sat
[2026-05-22 15:37:42] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2026-05-22 15:37:43] [INFO ] [Nat]Added 90 Read/Feed constraints in 39 ms returned sat
[2026-05-22 15:37:43] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 560 transitions) in 80 ms.
[2026-05-22 15:37:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 316 ms
[2026-05-22 15:37:43] [INFO ] Added : 2 causal constraints over 1 iterations in 587 ms. Result :sat
Minimization took 287 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 590/590 transitions.
Applied a total of 0 rules in 41 ms. Remains 352 /352 variables (removed 0) and now considering 590/590 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 352/352 places, 590/590 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 590/590 transitions.
Applied a total of 0 rules in 25 ms. Remains 352 /352 variables (removed 0) and now considering 590/590 (removed 0) transitions.
[2026-05-22 15:37:44] [INFO ] Invariant cache hit.
[2026-05-22 15:37:44] [INFO ] Implicit Places using invariants in 563 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 568 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 351/352 places, 590/590 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 351 transition count 490
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 251 transition count 490
Applied a total of 200 rules in 35 ms. Remains 251 /351 variables (removed 100) and now considering 490/590 (removed 100) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-987038899216728613.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8954035703941306413.kers'
[2026-05-22 15:37:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-987038899216728613.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8954035703941306413.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 490 rows 251 cols 1760 entries
Finished phase 1 with 100 SingleSign rule and 129 generalized
[2026-05-22 15:37:44] [INFO ] Computed 22 invariants in 6 ms
Computed 22 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-8954035703941306413.kers
Total runtime 8 ms.
[2026-05-22 15:37:45] [INFO ] Implicit Places using invariants in 401 ms returned []
[2026-05-22 15:37:45] [INFO ] Invariant cache hit.
[2026-05-22 15:37:45] [INFO ] State equation strengthened by 90 read => feed constraints.
[2026-05-22 15:37:46] [INFO ] Implicit Places using invariants and state equation in 1122 ms returned []
Implicit Place search using SMT with State Equation took 1535 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 251/352 places, 490/590 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2174 ms. Remains : 251/352 places, 490/590 transitions.
[2026-05-22 15:37:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 1243 ms. (803 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 675 ms. (1479 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-22 15:37:48] [INFO ] Invariant cache hit.
[2026-05-22 15:37:48] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2026-05-22 15:37:48] [INFO ] [Real]Absence check using 13 positive and 9 generalized place invariants in 10 ms returned sat
[2026-05-22 15:37:48] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2026-05-22 15:37:48] [INFO ] State equation strengthened by 90 read => feed constraints.
[2026-05-22 15:37:48] [INFO ] [Real]Added 90 Read/Feed constraints in 39 ms returned sat
[2026-05-22 15:37:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 15:37:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2026-05-22 15:37:48] [INFO ] [Nat]Absence check using 13 positive and 9 generalized place invariants in 10 ms returned sat
[2026-05-22 15:37:48] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2026-05-22 15:37:48] [INFO ] [Nat]Added 90 Read/Feed constraints in 27 ms returned sat
[2026-05-22 15:37:48] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 460 transitions) in 41 ms.
[2026-05-22 15:37:48] [INFO ] Added : 0 causal constraints over 0 iterations in 94 ms. Result :sat
Minimization took 162 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 490/490 transitions.
Applied a total of 0 rules in 18 ms. Remains 251 /251 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 251/251 places, 490/490 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 490/490 transitions.
Applied a total of 0 rules in 14 ms. Remains 251 /251 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2026-05-22 15:37:49] [INFO ] Invariant cache hit.
[2026-05-22 15:37:49] [INFO ] Implicit Places using invariants in 256 ms returned []
[2026-05-22 15:37:49] [INFO ] Invariant cache hit.
[2026-05-22 15:37:49] [INFO ] State equation strengthened by 90 read => feed constraints.
[2026-05-22 15:37:50] [INFO ] Implicit Places using invariants and state equation in 1114 ms returned []
Implicit Place search using SMT with State Equation took 1376 ms to find 0 implicit places.
[2026-05-22 15:37:50] [INFO ] Redundant transitions in 22 ms returned []
Running 480 sub problems to find dead transitions.
[2026-05-22 15:37:50] [INFO ] Invariant cache hit.
[2026-05-22 15:37:50] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 3 (OVERLAPS) 2/251 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 480 unsolved
SMT process timed out in 30249ms, After SMT, problems are : Problem set: 0 solved, 480 unsolved
Search for dead transitions found 0 dead transitions in 30262ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31717 ms. Remains : 251/251 places, 490/490 transitions.
RANDOM walk for 40000 steps (8 resets) in 616 ms. (64 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 239 ms. (166 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 279 ms. (142 steps per ms) remains 2/2 properties
[2026-05-22 15:38:21] [INFO ] Flatten gal took : 145 ms
[2026-05-22 15:38:21] [INFO ] Flatten gal took : 55 ms
[2026-05-22 15:38:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2298481372044853835.gal : 26 ms
[2026-05-22 15:38:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10843789709288461701.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2298481372044853835.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10843789709288461701.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10843789709288461701.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 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 12
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :12 after 24
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :24 after 61
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :61 after 172
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :172 after 1015
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1015 after 3827
Interrupted probabilistic random walk after 548664 steps, run timeout after 3010 ms. (steps per millisecond=182 ) properties seen :0 out of 2
Probabilistic random walk after 548664 steps, saw 395434 distinct states, run finished after 3015 ms. (steps per millisecond=181 ) properties seen :0
[2026-05-22 15:38:24] [INFO ] Invariant cache hit.
[2026-05-22 15:38:24] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 204/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 37/242 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/251 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 490/741 variables, 251/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/741 variables, 90/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/741 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 741/741 variables, and 363 constraints, problems are : Problem set: 0 solved, 2 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 251/251 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 204/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 37/242 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/251 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 490/741 variables, 251/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/741 variables, 90/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 2/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/741 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/741 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 741/741 variables, and 365 constraints, problems are : Problem set: 0 solved, 2 unsolved in 402 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 251/251 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 682ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 55 ms.
Support contains 1 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 490/490 transitions.
Applied a total of 0 rules in 22 ms. Remains 251 /251 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 251/251 places, 490/490 transitions.
RANDOM walk for 40000 steps (8 resets) in 268 ms. (148 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3827 after 10923
Interrupted probabilistic random walk after 553145 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :0 out of 2
Probabilistic random walk after 553145 steps, saw 398700 distinct states, run finished after 3001 ms. (steps per millisecond=184 ) properties seen :0
[2026-05-22 15:38:28] [INFO ] Invariant cache hit.
[2026-05-22 15:38:28] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 204/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 37/242 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/251 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 490/741 variables, 251/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/741 variables, 90/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/741 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 741/741 variables, and 363 constraints, problems are : Problem set: 0 solved, 2 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 251/251 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 204/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 37/242 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/251 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 490/741 variables, 251/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/741 variables, 90/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 2/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/741 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/741 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 741/741 variables, and 365 constraints, problems are : Problem set: 0 solved, 2 unsolved in 464 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 251/251 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 750ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 36 ms.
Support contains 1 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 490/490 transitions.
Applied a total of 0 rules in 11 ms. Remains 251 /251 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 251/251 places, 490/490 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 490/490 transitions.
Applied a total of 0 rules in 9 ms. Remains 251 /251 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2026-05-22 15:38:28] [INFO ] Invariant cache hit.
[2026-05-22 15:38:29] [INFO ] Implicit Places using invariants in 191 ms returned []
[2026-05-22 15:38:29] [INFO ] Invariant cache hit.
[2026-05-22 15:38:29] [INFO ] State equation strengthened by 90 read => feed constraints.
[2026-05-22 15:38:30] [INFO ] Implicit Places using invariants and state equation in 999 ms returned []
Implicit Place search using SMT with State Equation took 1194 ms to find 0 implicit places.
[2026-05-22 15:38:30] [INFO ] Redundant transitions in 29 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1244 ms. Remains : 251/251 places, 490/490 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 100 Pre rules applied. Total rules applied 0 place count 251 transition count 390
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 151 transition count 390
Applied a total of 200 rules in 16 ms. Remains 151 /251 variables (removed 100) and now considering 390/490 (removed 100) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12127598576059970952.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5373099362354876211.kers'
[2026-05-22 15:38:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12127598576059970952.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5373099362354876211.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 390 rows 151 cols 1560 entries
Finished phase 1 with 0 SingleSign rule and 129 generalized
[2026-05-22 15:38:30] [INFO ] Computed 22 invariants in 5 ms
Computed 22 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-5373099362354876211.kers
Total runtime 6 ms.
[2026-05-22 15:38:30] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2026-05-22 15:38:30] [INFO ] [Real]Absence check using 13 positive and 9 generalized place invariants in 5 ms returned sat
[2026-05-22 15:38:30] [INFO ] After 98ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-22 15:38:30] [INFO ] After 144ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2026-05-22 15:38:30] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
[2026-05-22 15:38:30] [INFO ] Flatten gal took : 31 ms
[2026-05-22 15:38:30] [INFO ] Flatten gal took : 23 ms
[2026-05-22 15:38:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2612017403298228451.gal : 8 ms
[2026-05-22 15:38:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7934589395009356167.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2612017403298228451.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7934589395009356167.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/ReachabilityCardinality7934589395009356167.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 35
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :35 after 65
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :65 after 198
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :198 after 325
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :325 after 929
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :929 after 1858
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1858 after 3620
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :10923 after 8.78677e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3620 after 1.32889e+07
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :8.78677e+06 after 8.93303e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.32889e+07 after 1.83221e+07
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.83221e+07 after 2.03843e+07
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :8.93303e+06 after 1.01559e+07
Detected timeout of ITS tools.
[2026-05-22 15:38:45] [INFO ] Flatten gal took : 51 ms
[2026-05-22 15:38:45] [INFO ] Applying decomposition
[2026-05-22 15:38:45] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1646811329055260180.txt' '-o' '/tmp/graph1646811329055260180.bin' '-w' '/tmp/graph1646811329055260180.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1646811329055260180.bin' '-l' '-1' '-v' '-w' '/tmp/graph1646811329055260180.weights' '-q' '0' '-e' '0.001'
[2026-05-22 15:38:45] [INFO ] Decomposing Gal with order
[2026-05-22 15:38:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 15:38:45] [INFO ] Removed a total of 739 redundant transitions.
[2026-05-22 15:38:45] [INFO ] Flatten gal took : 97 ms
[2026-05-22 15:38:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 24 ms.
[2026-05-22 15:38:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4137408370907883120.gal : 9 ms
[2026-05-22 15:38:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13640762925529334920.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4137408370907883120.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13640762925529334920.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality13640762925529334920.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.02214e+08,7.72055,215728,20860,78,486231,417,865,329393,84,838,0
Total reachable state count : 202214083

Verifying 2 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,4,7.74883,215728,57,58,486231,417,865,329393,86,838,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,4,7.75589,215728,57,58,486231,417,868,329393,87,838,0
Over-approximation ignoring read arcs solved 0 properties in 23607 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 15:38:53] [INFO ] Flatten gal took : 20 ms
[2026-05-22 15:38:53] [INFO ] Applying decomposition
[2026-05-22 15:38:53] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1022865706822241969.txt' '-o' '/tmp/graph1022865706822241969.bin' '-w' '/tmp/graph1022865706822241969.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1022865706822241969.bin' '-l' '-1' '-v' '-w' '/tmp/graph1022865706822241969.weights' '-q' '0' '-e' '0.001'
[2026-05-22 15:38:53] [INFO ] Decomposing Gal with order
[2026-05-22 15:38:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 15:38:53] [INFO ] Removed a total of 873 redundant transitions.
[2026-05-22 15:38:53] [INFO ] Flatten gal took : 45 ms
[2026-05-22 15:38:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 15 ms.
[2026-05-22 15:38:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7270311535165819459.gal : 6 ms
[2026-05-22 15:38:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6505344171203220860.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7270311535165819459.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6505344171203220860.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality6505344171203220860.prop.
Detected timeout of ITS tools.
Starting property specific reduction for Anderson-PT-10-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10458735883711667888.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9445945970517504465.kers'
[2026-05-22 15:39:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10458735883711667888.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9445945970517504465.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 490 rows 251 cols 1760 entries
Finished phase 1 with 100 SingleSign rule and 129 generalized
[2026-05-22 15:39:44] [INFO ] Computed 22 invariants in 2 ms
Computed 22 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9445945970517504465.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (2 resets) in 28 ms. (344 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 18 ms. (526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-22 15:39:44] [INFO ] Invariant cache hit.
[2026-05-22 15:39:44] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2026-05-22 15:39:44] [INFO ] [Real]Absence check using 13 positive and 9 generalized place invariants in 4 ms returned sat
[2026-05-22 15:39:44] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2026-05-22 15:39:44] [INFO ] State equation strengthened by 90 read => feed constraints.
[2026-05-22 15:39:44] [INFO ] [Real]Added 90 Read/Feed constraints in 15 ms returned sat
[2026-05-22 15:39:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 15:39:44] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2026-05-22 15:39:44] [INFO ] [Nat]Absence check using 13 positive and 9 generalized place invariants in 5 ms returned sat
[2026-05-22 15:39:44] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2026-05-22 15:39:44] [INFO ] [Nat]Added 90 Read/Feed constraints in 53 ms returned sat
[2026-05-22 15:39:44] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 460 transitions) in 54 ms.
[2026-05-22 15:39:44] [INFO ] Added : 0 causal constraints over 0 iterations in 137 ms. Result :sat
Minimization took 170 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 490/490 transitions.
Applied a total of 0 rules in 25 ms. Remains 251 /251 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 251/251 places, 490/490 transitions.
[2026-05-22 15:39:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 1196 ms. (835 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 575 ms. (1736 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-22 15:39:46] [INFO ] Invariant cache hit.
[2026-05-22 15:39:46] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2026-05-22 15:39:46] [INFO ] [Real]Absence check using 13 positive and 9 generalized place invariants in 10 ms returned sat
[2026-05-22 15:39:46] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2026-05-22 15:39:47] [INFO ] State equation strengthened by 90 read => feed constraints.
[2026-05-22 15:39:47] [INFO ] [Real]Added 90 Read/Feed constraints in 18 ms returned sat
[2026-05-22 15:39:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 15:39:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2026-05-22 15:39:47] [INFO ] [Nat]Absence check using 13 positive and 9 generalized place invariants in 10 ms returned sat
[2026-05-22 15:39:47] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2026-05-22 15:39:47] [INFO ] [Nat]Added 90 Read/Feed constraints in 60 ms returned sat
[2026-05-22 15:39:47] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 460 transitions) in 50 ms.
[2026-05-22 15:39:47] [INFO ] Added : 0 causal constraints over 0 iterations in 130 ms. Result :sat
Minimization took 183 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 490/490 transitions.
Applied a total of 0 rules in 17 ms. Remains 251 /251 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 251/251 places, 490/490 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 490/490 transitions.
Applied a total of 0 rules in 16 ms. Remains 251 /251 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2026-05-22 15:39:47] [INFO ] Invariant cache hit.
[2026-05-22 15:39:48] [INFO ] Implicit Places using invariants in 310 ms returned []
[2026-05-22 15:39:48] [INFO ] Invariant cache hit.
[2026-05-22 15:39:48] [INFO ] State equation strengthened by 90 read => feed constraints.
[2026-05-22 15:39:49] [INFO ] Implicit Places using invariants and state equation in 1084 ms returned []
Implicit Place search using SMT with State Equation took 1396 ms to find 0 implicit places.
[2026-05-22 15:39:49] [INFO ] Redundant transitions in 9 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1430 ms. Remains : 251/251 places, 490/490 transitions.
[2026-05-22 15:39:49] [INFO ] Flatten gal took : 45 ms
RANDOM walk for 40000 steps (8 resets) in 239 ms. (166 steps per ms) remains 2/2 properties
[2026-05-22 15:39:49] [INFO ] Flatten gal took : 32 ms
[2026-05-22 15:39:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13312141188247949458.gal : 11 ms
[2026-05-22 15:39:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11389205409862463601.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13312141188247949458.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11389205409862463601.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (8 resets) in 129 ms. (307 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40002 steps (8 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality11389205409862463601.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 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 12
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :12 after 24
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :24 after 61
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :61 after 172
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :172 after 1015
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1015 after 3827
Interrupted probabilistic random walk after 572148 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :0 out of 2
Probabilistic random walk after 572148 steps, saw 412196 distinct states, run finished after 3001 ms. (steps per millisecond=190 ) properties seen :0
[2026-05-22 15:39:52] [INFO ] Invariant cache hit.
[2026-05-22 15:39:52] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 204/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 37/242 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/251 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 490/741 variables, 251/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/741 variables, 90/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/741 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 741/741 variables, and 363 constraints, problems are : Problem set: 0 solved, 2 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 251/251 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 204/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 37/242 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/251 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 490/741 variables, 251/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/741 variables, 90/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 2/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/741 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/741 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 741/741 variables, and 365 constraints, problems are : Problem set: 0 solved, 2 unsolved in 582 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 251/251 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 814ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
SDD proceeding with computation,2 properties remain. new max is 2048
Parikh walk visited 0 properties in 48 ms.
Support contains 1 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 490/490 transitions.
SDD size :3827 after 10923
Applied a total of 0 rules in 10 ms. Remains 251 /251 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 251/251 places, 490/490 transitions.
RANDOM walk for 40000 steps (8 resets) in 197 ms. (202 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 479425 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :0 out of 2
Probabilistic random walk after 479425 steps, saw 346922 distinct states, run finished after 3001 ms. (steps per millisecond=159 ) properties seen :0
[2026-05-22 15:39:56] [INFO ] Invariant cache hit.
[2026-05-22 15:39:56] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 204/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 37/242 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/251 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 490/741 variables, 251/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/741 variables, 90/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/741 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 741/741 variables, and 363 constraints, problems are : Problem set: 0 solved, 2 unsolved in 373 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 251/251 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 204/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 37/242 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/251 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 490/741 variables, 251/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/741 variables, 90/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 2/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/741 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/741 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 741/741 variables, and 365 constraints, problems are : Problem set: 0 solved, 2 unsolved in 586 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 251/251 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 971ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 40 ms.
Support contains 1 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 490/490 transitions.
Applied a total of 0 rules in 10 ms. Remains 251 /251 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 251/251 places, 490/490 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 490/490 transitions.
Applied a total of 0 rules in 9 ms. Remains 251 /251 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2026-05-22 15:39:57] [INFO ] Invariant cache hit.
[2026-05-22 15:39:57] [INFO ] Implicit Places using invariants in 318 ms returned []
[2026-05-22 15:39:57] [INFO ] Invariant cache hit.
[2026-05-22 15:39:57] [INFO ] State equation strengthened by 90 read => feed constraints.
[2026-05-22 15:39:58] [INFO ] Implicit Places using invariants and state equation in 1066 ms returned []
Implicit Place search using SMT with State Equation took 1387 ms to find 0 implicit places.
[2026-05-22 15:39:58] [INFO ] Redundant transitions in 6 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1412 ms. Remains : 251/251 places, 490/490 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 100 Pre rules applied. Total rules applied 0 place count 251 transition count 390
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 151 transition count 390
Applied a total of 200 rules in 22 ms. Remains 151 /251 variables (removed 100) and now considering 390/490 (removed 100) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12389042818370867441.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2126259782250850560.kers'
[2026-05-22 15:39:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12389042818370867441.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2126259782250850560.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 390 rows 151 cols 1560 entries
Finished phase 1 with 0 SingleSign rule and 129 generalized
[2026-05-22 15:39:58] [INFO ] Computed 22 invariants in 5 ms
Computed 22 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-2126259782250850560.kers
Total runtime 7 ms.
[2026-05-22 15:39:58] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2026-05-22 15:39:58] [INFO ] [Real]Absence check using 13 positive and 9 generalized place invariants in 14 ms returned sat
[2026-05-22 15:39:59] [INFO ] After 147ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-22 15:39:59] [INFO ] After 222ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2026-05-22 15:39:59] [INFO ] After 371ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
[2026-05-22 15:39:59] [INFO ] Flatten gal took : 28 ms
[2026-05-22 15:39:59] [INFO ] Flatten gal took : 17 ms
[2026-05-22 15:39:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10588106264095599176.gal : 5 ms
[2026-05-22 15:39:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17635592547504949139.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10588106264095599176.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17635592547504949139.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 ...330
Loading property file /tmp/ReachabilityCardinality17635592547504949139.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 35
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :35 after 65
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :65 after 198
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :198 after 325
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :325 after 929
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :929 after 1858
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :10923 after 8.78677e+06
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1858 after 3620
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3620 after 1.32889e+07
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :8.78677e+06 after 8.93303e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.32889e+07 after 1.83221e+07
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :8.93303e+06 after 1.01559e+07
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.83221e+07 after 2.03843e+07
Detected timeout of ITS tools.
[2026-05-22 15:40:14] [INFO ] Flatten gal took : 12 ms
[2026-05-22 15:40:14] [INFO ] Applying decomposition
[2026-05-22 15:40:14] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5084852714842857597.txt' '-o' '/tmp/graph5084852714842857597.bin' '-w' '/tmp/graph5084852714842857597.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5084852714842857597.bin' '-l' '-1' '-v' '-w' '/tmp/graph5084852714842857597.weights' '-q' '0' '-e' '0.001'
[2026-05-22 15:40:14] [INFO ] Decomposing Gal with order
[2026-05-22 15:40:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 15:40:14] [INFO ] Removed a total of 740 redundant transitions.
[2026-05-22 15:40:14] [INFO ] Flatten gal took : 33 ms
[2026-05-22 15:40:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 12 ms.
[2026-05-22 15:40:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11949415483009445780.gal : 4 ms
[2026-05-22 15:40:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8650857213020671451.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11949415483009445780.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8650857213020671451.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality8650857213020671451.prop.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.01559e+07 after 1.54609e+07
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.02214e+08,14.1959,423520,50827,79,790683,424,879,508143,83,861,0
Total reachable state count : 202214083

Verifying 2 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,48,14.2552,423520,91,64,790683,424,879,508143,85,861,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,48,14.2657,423520,91,64,790683,424,882,508143,86,861,0
Over-approximation ignoring read arcs solved 0 properties in 29979 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 15:40:28] [INFO ] Flatten gal took : 21 ms
[2026-05-22 15:40:28] [INFO ] Applying decomposition
[2026-05-22 15:40:28] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9030677075929361603.txt' '-o' '/tmp/graph9030677075929361603.bin' '-w' '/tmp/graph9030677075929361603.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9030677075929361603.bin' '-l' '-1' '-v' '-w' '/tmp/graph9030677075929361603.weights' '-q' '0' '-e' '0.001'
[2026-05-22 15:40:28] [INFO ] Decomposing Gal with order
[2026-05-22 15:40:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 15:40:28] [INFO ] Removed a total of 877 redundant transitions.
[2026-05-22 15:40:28] [INFO ] Flatten gal took : 25 ms
[2026-05-22 15:40:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 10 ms.
[2026-05-22 15:40:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2417547584818193445.gal : 4 ms
[2026-05-22 15:40:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality887611766606406390.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2417547584818193445.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality887611766606406390.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/ReachabilityCardinality887611766606406390.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.92591e+08,29.7626,722168,62858,223,1.13001e+06,1968,1233,2.65057e+06,128,6791,0
Total reachable state count : 392591318

Verifying 2 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,4,29.8567,722168,88,49,1.13001e+06,1968,1233,2.65057e+06,130,6791,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,4,29.8774,722168,88,49,1.13001e+06,1968,1236,2.65057e+06,131,6791,0
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA Anderson-PT-10-UpperBounds-12 1 TECHNIQUES REACHABILITY_MAX
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-8518612261946608378.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7194836598308309047.kers'
[2026-05-22 15:40:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8518612261946608378.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7194836598308309047.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 490 rows 251 cols 1760 entries
Finished phase 1 with 100 SingleSign rule and 129 generalized
[2026-05-22 15:40:58] [INFO ] Computed 22 invariants in 6 ms
Computed 22 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-7194836598308309047.kers
Total runtime 8 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (2 resets) in 1238 ms. (807 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:[]
Ending property specific reduction for Anderson-PT-10-UpperBounds-12 in 76036 ms.
[2026-05-22 15:41:00] [INFO ] Flatten gal took : 9 ms
Total runtime 219018 ms.

BK_STOP 1779464460222

--------------------
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="Anderson-PT-10"
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 Anderson-PT-10, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-oct2-177944366000197"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-10.tgz
mv Anderson-PT-10 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;