Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r130-smll-177955809000285.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is FireWire-PT-18, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809000285
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 7.9K Mar 7 05:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 7 05:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 7 05:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 7 05:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 7 05:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Mar 7 05:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 7 05:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 7 05:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:09 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 168K 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 FireWire-PT-18-UpperBounds-00
FORMULA_NAME FireWire-PT-18-UpperBounds-01
FORMULA_NAME FireWire-PT-18-UpperBounds-02
FORMULA_NAME FireWire-PT-18-UpperBounds-03
FORMULA_NAME FireWire-PT-18-UpperBounds-04
FORMULA_NAME FireWire-PT-18-UpperBounds-05
FORMULA_NAME FireWire-PT-18-UpperBounds-06
FORMULA_NAME FireWire-PT-18-UpperBounds-07
FORMULA_NAME FireWire-PT-18-UpperBounds-08
FORMULA_NAME FireWire-PT-18-UpperBounds-09
FORMULA_NAME FireWire-PT-18-UpperBounds-10
FORMULA_NAME FireWire-PT-18-UpperBounds-11
FORMULA_NAME FireWire-PT-18-UpperBounds-12
FORMULA_NAME FireWire-PT-18-UpperBounds-13
FORMULA_NAME FireWire-PT-18-UpperBounds-14
FORMULA_NAME FireWire-PT-18-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779843270782

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-27 00:54:33] [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-27 00:54:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 00:54:33] [INFO ] Load time of PNML (sax parser for PT used): 226 ms
[2026-05-27 00:54:33] [INFO ] Transformed 437 places.
[2026-05-27 00:54:33] [INFO ] Transformed 707 transitions.
[2026-05-27 00:54:33] [INFO ] Found NUPN structural information;
[2026-05-27 00:54:33] [INFO ] Parsed PT model containing 437 places and 707 transitions and 2170 arcs in 499 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1695018089040871834.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17205119431402562772.kers'
[2026-05-27 00:54:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1695018089040871834.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17205119431402562772.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 707 rows 437 cols 2170 entries
Finished phase 1 with 428 SingleSign rule and 0 generalized
[2026-05-27 00:54:34] [INFO ] Computed 9 invariants in 6 ms
Computed 9 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-17205119431402562772.kers
Total runtime 8 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (7 resets) in 61 ms. (161 steps per ms)
FORMULA FireWire-PT-18-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80000 steps (25 resets) in 184 ms. (432 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-27 00:54:34] [INFO ] Invariant cache hit.
[2026-05-27 00:54:34] [INFO ] [Real]Absence check using 9 positive place invariants in 24 ms returned sat
[2026-05-27 00:54:35] [INFO ] [Real]Absence check using state equation in 685 ms returned sat
[2026-05-27 00:54:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:54:36] [INFO ] [Nat]Absence check using 9 positive place invariants in 37 ms returned sat
[2026-05-27 00:54:36] [INFO ] [Nat]Absence check using state equation in 454 ms returned sat
[2026-05-27 00:54:36] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 117 ms.
[2026-05-27 00:54:40] [INFO ] Added : 190 causal constraints over 38 iterations in 4076 ms. Result :unknown
[2026-05-27 00:54:41] [INFO ] [Real]Absence check using 9 positive place invariants in 23 ms returned sat
[2026-05-27 00:54:41] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2026-05-27 00:54:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:54:41] [INFO ] [Nat]Absence check using 9 positive place invariants in 23 ms returned sat
[2026-05-27 00:54:42] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2026-05-27 00:54:42] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 77 ms.
[2026-05-27 00:54:46] [INFO ] Added : 300 causal constraints over 60 iterations in 4360 ms. Result :unknown
[2026-05-27 00:54:46] [INFO ] [Real]Absence check using 9 positive place invariants in 15 ms returned sat
[2026-05-27 00:54:47] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2026-05-27 00:54:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:54:47] [INFO ] [Nat]Absence check using 9 positive place invariants in 16 ms returned sat
[2026-05-27 00:54:47] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2026-05-27 00:54:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 672 ms
[2026-05-27 00:54:48] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 58 ms.
Minimization took 0 ms.
[2026-05-27 00:54:52] [INFO ] [Real]Absence check using 9 positive place invariants in 15 ms returned sat
[2026-05-27 00:54:52] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2026-05-27 00:54:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:54:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 16 ms returned sat
[2026-05-27 00:54:53] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2026-05-27 00:54:53] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 139 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2026-05-27 00:54:57] [INFO ] [Real]Absence check using 9 positive place invariants in 15 ms returned sat
[2026-05-27 00:54:58] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2026-05-27 00:54:58] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:54:58] [INFO ] [Nat]Absence check using 9 positive place invariants in 20 ms returned sat
[2026-05-27 00:54:58] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2026-05-27 00:54:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 642 ms
[2026-05-27 00:54:59] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 96 ms.
[2026-05-27 00:55:03] [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 4
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.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1143)
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-27 00:55:03] [INFO ] [Real]Absence check using 9 positive place invariants in 15 ms returned sat
[2026-05-27 00:55:03] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2026-05-27 00:55:03] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 121 ms.
[2026-05-27 00:55:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:55:04] [INFO ] [Nat]Absence check using 9 positive place invariants in 31 ms returned sat
[2026-05-27 00:55:05] [INFO ] [Nat]Absence check using state equation in 567 ms returned sat
[2026-05-27 00:55:05] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 144 ms.
[2026-05-27 00:55:09] [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 5
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.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1143)
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-27 00:55:09] [INFO ] [Real]Absence check using 9 positive place invariants in 18 ms returned sat
[2026-05-27 00:55:09] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2026-05-27 00:55:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:55:10] [INFO ] [Nat]Absence check using 9 positive place invariants in 18 ms returned sat
[2026-05-27 00:55:10] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2026-05-27 00:55:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 439 ms
[2026-05-27 00:55:11] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 57 ms.
[2026-05-27 00:55:15] [INFO ] Added : 215 causal constraints over 43 iterations in 4155 ms. Result :unknown
[2026-05-27 00:55:15] [INFO ] [Real]Absence check using 9 positive place invariants in 23 ms returned sat
[2026-05-27 00:55:15] [INFO ] [Real]Absence check using state equation in 422 ms returned sat
[2026-05-27 00:55:16] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 133 ms.
[2026-05-27 00:55:16] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:55:16] [INFO ] [Nat]Absence check using 9 positive place invariants in 25 ms returned sat
[2026-05-27 00:55:16] [INFO ] [Nat]Absence check using state equation in 420 ms returned sat
[2026-05-27 00:55:17] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 96 ms.
[2026-05-27 00:55:21] [INFO ] Added : 295 causal constraints over 59 iterations in 4321 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-18-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 707/707 transitions.
Graph (trivial) has 320 edges and 437 vertex of which 12 / 437 are part of one of the 3 SCC in 13 ms
Free SCC test removed 9 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 1269 edges and 428 vertex of which 418 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.4 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 84 rules applied. Total rules applied 86 place count 418 transition count 610
Reduce places removed 82 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 84 rules applied. Total rules applied 170 place count 336 transition count 608
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 171 place count 335 transition count 608
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 171 place count 335 transition count 597
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 193 place count 324 transition count 597
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 254 place count 263 transition count 532
Iterating global reduction 3 with 61 rules applied. Total rules applied 315 place count 263 transition count 532
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 317 place count 263 transition count 530
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 317 place count 263 transition count 524
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 329 place count 257 transition count 524
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 349 place count 237 transition count 441
Iterating global reduction 4 with 20 rules applied. Total rules applied 369 place count 237 transition count 441
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 371 place count 237 transition count 439
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 377 place count 231 transition count 429
Iterating global reduction 5 with 6 rules applied. Total rules applied 383 place count 231 transition count 429
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 386 place count 231 transition count 426
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 388 place count 230 transition count 425
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 389 place count 229 transition count 425
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 390 place count 228 transition count 422
Iterating global reduction 8 with 1 rules applied. Total rules applied 391 place count 228 transition count 422
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 392 place count 227 transition count 420
Iterating global reduction 8 with 1 rules applied. Total rules applied 393 place count 227 transition count 420
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 394 place count 226 transition count 417
Iterating global reduction 8 with 1 rules applied. Total rules applied 395 place count 226 transition count 417
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 396 place count 225 transition count 415
Iterating global reduction 8 with 1 rules applied. Total rules applied 397 place count 225 transition count 415
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 398 place count 224 transition count 412
Iterating global reduction 8 with 1 rules applied. Total rules applied 399 place count 224 transition count 412
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 400 place count 223 transition count 410
Iterating global reduction 8 with 1 rules applied. Total rules applied 401 place count 223 transition count 410
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 402 place count 222 transition count 407
Iterating global reduction 8 with 1 rules applied. Total rules applied 403 place count 222 transition count 407
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 404 place count 221 transition count 405
Iterating global reduction 8 with 1 rules applied. Total rules applied 405 place count 221 transition count 405
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 406 place count 220 transition count 402
Iterating global reduction 8 with 1 rules applied. Total rules applied 407 place count 220 transition count 402
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 408 place count 219 transition count 400
Iterating global reduction 8 with 1 rules applied. Total rules applied 409 place count 219 transition count 400
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 410 place count 218 transition count 398
Iterating global reduction 8 with 1 rules applied. Total rules applied 411 place count 218 transition count 398
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 412 place count 217 transition count 396
Iterating global reduction 8 with 1 rules applied. Total rules applied 413 place count 217 transition count 396
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 8 with 66 rules applied. Total rules applied 479 place count 184 transition count 363
Performed 30 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 8 with 60 rules applied. Total rules applied 539 place count 154 transition count 426
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 541 place count 154 transition count 424
Free-agglomeration rule applied 17 times.
Iterating global reduction 8 with 17 rules applied. Total rules applied 558 place count 154 transition count 407
Reduce places removed 17 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 23 rules applied. Total rules applied 581 place count 137 transition count 401
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 585 place count 133 transition count 397
Iterating global reduction 9 with 4 rules applied. Total rules applied 589 place count 133 transition count 397
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 595 place count 133 transition count 391
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 10 with 17 rules applied. Total rules applied 612 place count 133 transition count 374
Applied a total of 612 rules in 593 ms. Remains 133 /437 variables (removed 304) and now considering 374/707 (removed 333) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 617 ms. Remains : 133/437 places, 374/707 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5546512337480279213.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17640964400029666915.kers'
[2026-05-27 00:55:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5546512337480279213.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17640964400029666915.kers]
Normalized transition count is 367 out of 374 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 367 rows 133 cols 1320 entries
Finished phase 1 with 126 SingleSign rule and 0 generalized
[2026-05-27 00:55:23] [INFO ] Computed 7 invariants in 6 ms
Computed 7 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-17640964400029666915.kers
Total runtime 14 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (49894 resets) in 1999 ms. (500 steps per ms)
FORMULA FireWire-PT-18-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000002 steps (24796 resets) in 1401 ms. (1426 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-27 00:55:26] [INFO ] Flow matrix only has 367 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16043587971810732286.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4050301998566485129.kers'
[2026-05-27 00:55:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16043587971810732286.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4050301998566485129.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 367 rows 133 cols 1320 entries
Finished phase 1 with 126 SingleSign rule and 0 generalized
[2026-05-27 00:55:26] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4050301998566485129.kers
Total runtime 2 ms.
[2026-05-27 00:55:26] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-27 00:55:26] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2026-05-27 00:55:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:55:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-27 00:55:27] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2026-05-27 00:55:27] [INFO ] State equation strengthened by 69 read => feed constraints.
[2026-05-27 00:55:27] [INFO ] [Nat]Added 69 Read/Feed constraints in 56 ms returned sat
[2026-05-27 00:55:27] [INFO ] Computed and/alt/rep : 165/912/165 causal constraints (skipped 198 transitions) in 48 ms.
[2026-05-27 00:55:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 457 ms
[2026-05-27 00:55:28] [INFO ] Added : 76 causal constraints over 16 iterations in 1011 ms. Result :sat
Minimization took 306 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 133 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p144) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 371/371 transitions.
Reduce places removed 1 places and 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 132 transition count 368
Reduce places removed 2 places and 3 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 130 transition count 365
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 129 transition count 363
Reduce places removed 1 places and 3 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6 place count 128 transition count 360
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7 place count 127 transition count 358
Reduce places removed 1 places and 3 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 8 place count 126 transition count 355
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 9 place count 125 transition count 353
Reduce places removed 1 places and 6 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 10 place count 124 transition count 347
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 10 place count 124 transition count 346
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 12 place count 123 transition count 346
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 13 place count 122 transition count 343
Iterating global reduction 8 with 1 rules applied. Total rules applied 14 place count 122 transition count 343
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 18 place count 120 transition count 341
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 19 place count 120 transition count 340
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 20 place count 120 transition count 339
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 21 place count 119 transition count 339
Applied a total of 21 rules in 65 ms. Remains 119 /133 variables (removed 14) and now considering 339/371 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 119/133 places, 339/371 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17353678701666805341.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15858222429319388728.kers'
[2026-05-27 00:55:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17353678701666805341.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15858222429319388728.kers]
Normalized transition count is 332 out of 339 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 332 rows 119 cols 1206 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-27 00:55:28] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15858222429319388728.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (49942 resets) in 1521 ms. (657 steps per ms)
BEST_FIRST walk for 1000001 steps (12453 resets) in 498 ms. (2004 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-27 00:55:30] [INFO ] Flow matrix only has 332 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16589711171130406565.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2702333852428655638.kers'
[2026-05-27 00:55:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16589711171130406565.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2702333852428655638.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 332 rows 119 cols 1206 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-27 00:55:30] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2702333852428655638.kers
Total runtime 1 ms.
[2026-05-27 00:55:30] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-27 00:55:30] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2026-05-27 00:55:30] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-27 00:55:30] [INFO ] [Real]Added 61 Read/Feed constraints in 26 ms returned sat
[2026-05-27 00:55:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:55:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-27 00:55:31] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2026-05-27 00:55:31] [INFO ] [Nat]Added 61 Read/Feed constraints in 60 ms returned sat
[2026-05-27 00:55:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2026-05-27 00:55:31] [INFO ] Computed and/alt/rep : 141/818/141 causal constraints (skipped 187 transitions) in 55 ms.
[2026-05-27 00:55:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 629 ms
[2026-05-27 00:55:32] [INFO ] Added : 47 causal constraints over 13 iterations in 1158 ms. Result :sat
Minimization took 197 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 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 339/339 transitions.
Applied a total of 0 rules in 9 ms. Remains 119 /119 variables (removed 0) and now considering 339/339 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 119/119 places, 339/339 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 339/339 transitions.
Applied a total of 0 rules in 7 ms. Remains 119 /119 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2026-05-27 00:55:32] [INFO ] Flow matrix only has 332 transitions (discarded 7 similar events)
[2026-05-27 00:55:32] [INFO ] Invariant cache hit.
[2026-05-27 00:55:32] [INFO ] Implicit Places using invariants in 137 ms returned []
[2026-05-27 00:55:32] [INFO ] Flow matrix only has 332 transitions (discarded 7 similar events)
[2026-05-27 00:55:32] [INFO ] Invariant cache hit.
[2026-05-27 00:55:33] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-27 00:55:33] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
[2026-05-27 00:55:33] [INFO ] Redundant transitions in 24 ms returned []
Running 335 sub problems to find dead transitions.
[2026-05-27 00:55:33] [INFO ] Flow matrix only has 332 transitions (discarded 7 similar events)
[2026-05-27 00:55:33] [INFO ] Invariant cache hit.
[2026-05-27 00:55:33] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (OVERLAPS) 2/119 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 332/451 variables, 119/132 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (OVERLAPS) 0/451 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 451/451 variables, and 193 constraints, problems are : Problem set: 0 solved, 335 unsolved in 19768 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 119/119 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (OVERLAPS) 2/119 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 332/451 variables, 119/132 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 335/528 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 451/451 variables, and 529 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 119/119 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50140ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 50174ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50866 ms. Remains : 119/119 places, 339/339 transitions.
RANDOM walk for 40000 steps (1987 resets) in 1118 ms. (35 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (499 resets) in 456 ms. (87 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (499 resets) in 304 ms. (131 steps per ms) remains 2/2 properties
[2026-05-27 00:56:24] [INFO ] Flatten gal took : 222 ms
[2026-05-27 00:56:24] [INFO ] Flatten gal took : 86 ms
[2026-05-27 00:56:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16481331975662349569.gal : 35 ms
[2026-05-27 00:56:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8534227788593188742.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/ReachabilityCardinality16481331975662349569.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8534227788593188742.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
Finished probabilistic random walk after 26070 steps, run visited all 2 properties in 454 ms. (steps per millisecond=57 )
Probabilistic random walk after 26070 steps, saw 9319 distinct states, run finished after 459 ms. (steps per millisecond=56 ) properties seen :2
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:188)
at java.base/java.io.BufferedInputStream.read1(BufferedInputStream.java:343)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:420)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
FORMULA FireWire-PT-18-UpperBounds-03 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-12877799527811106407.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18088400980357300692.kers'
[2026-05-27 00:56:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12877799527811106407.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18088400980357300692.kers]
Normalized transition count is 332 out of 339 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 332 rows 119 cols 1206 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-27 00:56:24] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-18088400980357300692.kers
Total runtime 4 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (49985 resets) in 1899 ms. (526 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 113226 ms.

BK_STOP 1779843386692

--------------------
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="FireWire-PT-18"
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 FireWire-PT-18, 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 r130-smll-177955809000285"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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