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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 980K
-rw-r--r-- 1 mcc users 5.0K Mar 5 14:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Mar 5 14:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 5 14:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 5 14:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 07:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 544K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779473040504

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-22 18:04:01] [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 18:04:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 18:04:02] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2026-05-22 18:04:02] [INFO ] Transformed 1638 places.
[2026-05-22 18:04:02] [INFO ] Transformed 2094 transitions.
[2026-05-22 18:04:02] [INFO ] Found NUPN structural information;
[2026-05-22 18:04:02] [INFO ] Parsed PT model containing 1638 places and 2094 transitions and 6458 arcs in 314 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 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-2686641971694296884.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13941426992044903868.kers'
[2026-05-22 18:04:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2686641971694296884.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13941426992044903868.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2094 rows 1638 cols 6458 entries
Finished phase 1 with 1093 SingleSign rule and 385 generalized
[2026-05-22 18:04:02] [INFO ] Computed 160 invariants in 13 ms
Computed 160 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-13941426992044903868.kers
Total runtime 16 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 (26 resets) in 72 ms. (136 steps per ms)
FORMULA ASLink-PT-03b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (15 resets) in 38 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-22 18:04:02] [INFO ] Invariant cache hit.
[2026-05-22 18:04:03] [INFO ] [Real]Absence check using 32 positive place invariants in 36 ms returned sat
[2026-05-22 18:04:03] [INFO ] [Real]Absence check using 32 positive and 128 generalized place invariants in 107 ms returned sat
[2026-05-22 18:04:04] [INFO ] [Real]Absence check using state equation in 1085 ms returned sat
[2026-05-22 18:04:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:04:05] [INFO ] [Nat]Absence check using 32 positive place invariants in 34 ms returned sat
[2026-05-22 18:04:05] [INFO ] [Nat]Absence check using 32 positive and 128 generalized place invariants in 100 ms returned sat
[2026-05-22 18:04:06] [INFO ] [Nat]Absence check using state equation in 1041 ms returned sat
[2026-05-22 18:04:06] [INFO ] Computed and/alt/rep : 1742/3856/1742 causal constraints (skipped 351 transitions) in 109 ms.
[2026-05-22 18:04:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
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-22 18:04:10] [INFO ] [Real]Absence check using 32 positive place invariants in 31 ms returned sat
[2026-05-22 18:04:10] [INFO ] [Real]Absence check using 32 positive and 128 generalized place invariants in 77 ms returned sat
[2026-05-22 18:04:10] [INFO ] [Real]Absence check using state equation in 825 ms returned sat
[2026-05-22 18:04:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:04:11] [INFO ] [Nat]Absence check using 32 positive place invariants in 37 ms returned sat
[2026-05-22 18:04:11] [INFO ] [Nat]Absence check using 32 positive and 128 generalized place invariants in 120 ms returned sat
[2026-05-22 18:04:12] [INFO ] [Nat]Absence check using state equation in 1002 ms returned sat
[2026-05-22 18:04:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3063 ms
[2026-05-22 18:04:15] [INFO ] Computed and/alt/rep : 1742/3856/1742 causal constraints (skipped 351 transitions) in 124 ms.
[2026-05-22 18:04:16] [INFO ] Added : 15 causal constraints over 3 iterations in 551 ms. Result :unknown
[2026-05-22 18:04:16] [INFO ] [Real]Absence check using 32 positive place invariants in 48 ms returned sat
[2026-05-22 18:04:16] [INFO ] [Real]Absence check using 32 positive and 128 generalized place invariants in 56 ms returned sat
[2026-05-22 18:04:18] [INFO ] [Real]Absence check using state equation in 1461 ms returned sat
[2026-05-22 18:04:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:04:18] [INFO ] [Nat]Absence check using 32 positive place invariants in 58 ms returned sat
[2026-05-22 18:04:18] [INFO ] [Nat]Absence check using 32 positive and 128 generalized place invariants in 84 ms returned sat
[2026-05-22 18:04:19] [INFO ] [Nat]Absence check using state equation in 1150 ms returned sat
[2026-05-22 18:04:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 758 ms
[2026-05-22 18:04:20] [INFO ] Computed and/alt/rep : 1742/3856/1742 causal constraints (skipped 351 transitions) in 160 ms.
[2026-05-22 18:04:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
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)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 1638 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1638/1638 places, 2094/2094 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 375 transitions
Trivial Post-agglo rules discarded 375 transitions
Performed 375 trivial Post agglomeration. Transition count delta: 375
Iterating post reduction 0 with 375 rules applied. Total rules applied 375 place count 1638 transition count 1719
Reduce places removed 375 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 393 rules applied. Total rules applied 768 place count 1263 transition count 1701
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 774 place count 1258 transition count 1700
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 775 place count 1257 transition count 1700
Performed 374 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 374 Pre rules applied. Total rules applied 775 place count 1257 transition count 1326
Deduced a syphon composed of 374 places in 6 ms
Ensure Unique test removed 31 places
Reduce places removed 405 places and 0 transitions.
Iterating global reduction 4 with 779 rules applied. Total rules applied 1554 place count 852 transition count 1326
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 4 with 25 rules applied. Total rules applied 1579 place count 848 transition count 1305
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 1600 place count 827 transition count 1305
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1600 place count 827 transition count 1294
Deduced a syphon composed of 11 places in 5 ms
Ensure Unique test removed 11 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 33 rules applied. Total rules applied 1633 place count 805 transition count 1294
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1633 place count 805 transition count 1283
Deduced a syphon composed of 11 places in 5 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1655 place count 794 transition count 1283
Discarding 51 places :
Symmetric choice reduction at 6 with 51 rule applications. Total rules 1706 place count 743 transition count 1232
Iterating global reduction 6 with 51 rules applied. Total rules applied 1757 place count 743 transition count 1232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1758 place count 743 transition count 1231
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 18 Pre rules applied. Total rules applied 1758 place count 743 transition count 1213
Deduced a syphon composed of 18 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 37 rules applied. Total rules applied 1795 place count 724 transition count 1213
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1795 place count 724 transition count 1212
Deduced a syphon composed of 1 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 1798 place count 722 transition count 1212
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1802 place count 718 transition count 1185
Iterating global reduction 7 with 4 rules applied. Total rules applied 1806 place count 718 transition count 1185
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 1806 place count 718 transition count 1182
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1812 place count 715 transition count 1182
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1813 place count 714 transition count 1174
Iterating global reduction 7 with 1 rules applied. Total rules applied 1814 place count 714 transition count 1174
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1815 place count 713 transition count 1166
Iterating global reduction 7 with 1 rules applied. Total rules applied 1816 place count 713 transition count 1166
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1817 place count 712 transition count 1158
Iterating global reduction 7 with 1 rules applied. Total rules applied 1818 place count 712 transition count 1158
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1819 place count 711 transition count 1150
Iterating global reduction 7 with 1 rules applied. Total rules applied 1820 place count 711 transition count 1150
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1821 place count 710 transition count 1142
Iterating global reduction 7 with 1 rules applied. Total rules applied 1822 place count 710 transition count 1142
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1823 place count 709 transition count 1134
Iterating global reduction 7 with 1 rules applied. Total rules applied 1824 place count 709 transition count 1134
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1825 place count 708 transition count 1126
Iterating global reduction 7 with 1 rules applied. Total rules applied 1826 place count 708 transition count 1126
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1827 place count 707 transition count 1118
Iterating global reduction 7 with 1 rules applied. Total rules applied 1828 place count 707 transition count 1118
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1829 place count 706 transition count 1110
Iterating global reduction 7 with 1 rules applied. Total rules applied 1830 place count 706 transition count 1110
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1831 place count 705 transition count 1102
Iterating global reduction 7 with 1 rules applied. Total rules applied 1832 place count 705 transition count 1102
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1833 place count 704 transition count 1094
Iterating global reduction 7 with 1 rules applied. Total rules applied 1834 place count 704 transition count 1094
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1835 place count 703 transition count 1086
Iterating global reduction 7 with 1 rules applied. Total rules applied 1836 place count 703 transition count 1086
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1837 place count 702 transition count 1078
Iterating global reduction 7 with 1 rules applied. Total rules applied 1838 place count 702 transition count 1078
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1839 place count 701 transition count 1070
Iterating global reduction 7 with 1 rules applied. Total rules applied 1840 place count 701 transition count 1070
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1841 place count 700 transition count 1062
Iterating global reduction 7 with 1 rules applied. Total rules applied 1842 place count 700 transition count 1062
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1843 place count 699 transition count 1054
Iterating global reduction 7 with 1 rules applied. Total rules applied 1844 place count 699 transition count 1054
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 2 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 7 with 182 rules applied. Total rules applied 2026 place count 608 transition count 963
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2027 place count 607 transition count 962
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 2029 place count 606 transition count 962
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2030 place count 605 transition count 961
Iterating global reduction 7 with 1 rules applied. Total rules applied 2031 place count 605 transition count 961
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 7 with 2 rules applied. Total rules applied 2033 place count 605 transition count 959
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2034 place count 604 transition count 959
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2036 place count 603 transition count 968
Free-agglomeration rule applied 4 times.
Iterating global reduction 9 with 4 rules applied. Total rules applied 2040 place count 603 transition count 964
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 2044 place count 599 transition count 964
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 2047 place count 599 transition count 961
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 2050 place count 596 transition count 961
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2051 place count 595 transition count 960
Reduce places removed 5 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 11 with 7 rules applied. Total rules applied 2058 place count 590 transition count 958
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 2060 place count 588 transition count 958
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 8 Pre rules applied. Total rules applied 2060 place count 588 transition count 950
Deduced a syphon composed of 8 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 13 with 17 rules applied. Total rules applied 2077 place count 579 transition count 950
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 13 with 3 rules applied. Total rules applied 2080 place count 576 transition count 950
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 2080 place count 576 transition count 949
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 2082 place count 575 transition count 949
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 14 with 12 rules applied. Total rules applied 2094 place count 569 transition count 943
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 2096 place count 567 transition count 941
Iterating global reduction 14 with 2 rules applied. Total rules applied 2098 place count 567 transition count 941
Free-agglomeration rule applied 2 times.
Iterating global reduction 14 with 2 rules applied. Total rules applied 2100 place count 567 transition count 939
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 2102 place count 565 transition count 939
Applied a total of 2102 rules in 1006 ms. Remains 565 /1638 variables (removed 1073) and now considering 939/2094 (removed 1155) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1013 ms. Remains : 565/1638 places, 939/2094 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17477672640202964472.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7508847282177666548.kers'
[2026-05-22 18:04:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17477672640202964472.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7508847282177666548.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 939 rows 555 cols 3670 entries
Finished phase 1 with 172 SingleSign rule and 291 generalized
[2026-05-22 18:04:24] [INFO ] Computed 102 invariants in 6 ms
Computed 102 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-7508847282177666548.kers
Total runtime 8 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (14455 resets) in 2201 ms. (454 steps per ms)
FORMULA ASLink-PT-03b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000001 steps (7931 resets) in 2111 ms. (946 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-22 18:04:28] [INFO ] Invariant cache hit.
[2026-05-22 18:04:29] [INFO ] [Real]Absence check using 32 positive place invariants in 16 ms returned sat
[2026-05-22 18:04:29] [INFO ] [Real]Absence check using 32 positive and 70 generalized place invariants in 40 ms returned sat
[2026-05-22 18:04:29] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2026-05-22 18:04:29] [INFO ] Computed and/alt/rep : 364/1407/364 causal constraints (skipped 553 transitions) in 61 ms.
[2026-05-22 18:04:29] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:04:29] [INFO ] [Nat]Absence check using 32 positive place invariants in 10 ms returned sat
[2026-05-22 18:04:29] [INFO ] [Nat]Absence check using 32 positive and 70 generalized place invariants in 18 ms returned sat
[2026-05-22 18:04:30] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2026-05-22 18:04:30] [INFO ] Computed and/alt/rep : 364/1407/364 causal constraints (skipped 553 transitions) in 61 ms.
[2026-05-22 18:04:34] [INFO ] Added : 264 causal constraints over 53 iterations in 4740 ms. Result :sat
Minimization took 421 ms.
[2026-05-22 18:04:35] [INFO ] [Real]Absence check using 32 positive place invariants in 11 ms returned sat
[2026-05-22 18:04:35] [INFO ] [Real]Absence check using 32 positive and 70 generalized place invariants in 21 ms returned sat
[2026-05-22 18:04:35] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2026-05-22 18:04:36] [INFO ] Computed and/alt/rep : 364/1407/364 causal constraints (skipped 553 transitions) in 90 ms.
[2026-05-22 18:04:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:04:36] [INFO ] [Nat]Absence check using 32 positive place invariants in 11 ms returned sat
[2026-05-22 18:04:36] [INFO ] [Nat]Absence check using 32 positive and 70 generalized place invariants in 41 ms returned sat
[2026-05-22 18:04:36] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2026-05-22 18:04:36] [INFO ] Computed and/alt/rep : 364/1407/364 causal constraints (skipped 553 transitions) in 56 ms.
[2026-05-22 18:04:41] [INFO ] Added : 249 causal constraints over 50 iterations in 4293 ms. Result :sat
Minimization took 386 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 565 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 565/565 places, 939/939 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 565 transition count 938
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 2 place count 564 transition count 938
Applied a total of 2 rules in 23 ms. Remains 564 /565 variables (removed 1) and now considering 938/939 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 564/565 places, 938/939 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3262038509810764242.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2948513359303037685.kers'
[2026-05-22 18:04:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3262038509810764242.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2948513359303037685.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 1 ms.
// Phase 1: matrix 938 rows 554 cols 3668 entries
Finished phase 1 with 171 SingleSign rule and 291 generalized
[2026-05-22 18:04:43] [INFO ] Computed 102 invariants in 9 ms
Computed 102 P flows in 22 ms.
Exported basis to /tmp/petrispot-output-2948513359303037685.kers
Total runtime 23 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (14559 resets) in 2311 ms. (432 steps per ms)
BEST_FIRST walk for 2000002 steps (7914 resets) in 2094 ms. (954 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-22 18:04:47] [INFO ] Invariant cache hit.
[2026-05-22 18:04:47] [INFO ] [Real]Absence check using 32 positive place invariants in 20 ms returned sat
[2026-05-22 18:04:47] [INFO ] [Real]Absence check using 32 positive and 70 generalized place invariants in 15 ms returned sat
[2026-05-22 18:04:48] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2026-05-22 18:04:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:04:48] [INFO ] [Nat]Absence check using 32 positive place invariants in 10 ms returned sat
[2026-05-22 18:04:48] [INFO ] [Nat]Absence check using 32 positive and 70 generalized place invariants in 51 ms returned sat
[2026-05-22 18:04:48] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2026-05-22 18:04:48] [INFO ] Computed and/alt/rep : 363/1405/363 causal constraints (skipped 553 transitions) in 56 ms.
[2026-05-22 18:04:53] [INFO ] Added : 289 causal constraints over 58 iterations in 5065 ms. Result :sat
Minimization took 376 ms.
[2026-05-22 18:04:54] [INFO ] [Real]Absence check using 32 positive place invariants in 9 ms returned sat
[2026-05-22 18:04:54] [INFO ] [Real]Absence check using 32 positive and 70 generalized place invariants in 23 ms returned sat
[2026-05-22 18:04:54] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2026-05-22 18:04:54] [INFO ] Computed and/alt/rep : 363/1405/363 causal constraints (skipped 553 transitions) in 56 ms.
[2026-05-22 18:04:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:04:54] [INFO ] [Nat]Absence check using 32 positive place invariants in 9 ms returned sat
[2026-05-22 18:04:54] [INFO ] [Nat]Absence check using 32 positive and 70 generalized place invariants in 15 ms returned sat
[2026-05-22 18:04:55] [INFO ] [Nat]Absence check using state equation in 437 ms returned sat
[2026-05-22 18:04:55] [INFO ] Computed and/alt/rep : 363/1405/363 causal constraints (skipped 553 transitions) in 56 ms.
[2026-05-22 18:04:59] [INFO ] Added : 258 causal constraints over 52 iterations in 4528 ms. Result :sat
Minimization took 374 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 564 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 564/564 places, 938/938 transitions.
Applied a total of 0 rules in 16 ms. Remains 564 /564 variables (removed 0) and now considering 938/938 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 564/564 places, 938/938 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 564/564 places, 938/938 transitions.
Applied a total of 0 rules in 16 ms. Remains 564 /564 variables (removed 0) and now considering 938/938 (removed 0) transitions.
[2026-05-22 18:05:00] [INFO ] Invariant cache hit.
[2026-05-22 18:05:01] [INFO ] Implicit Places using invariants in 594 ms returned [1, 18, 19, 31, 48, 66, 142, 146, 155, 156, 157, 159, 176, 194, 230, 233, 267, 271, 272, 283, 284, 286, 303, 321, 390, 394, 395, 398, 409, 410, 411, 429, 431, 435, 453, 454, 455, 456, 468, 474, 480, 486, 492, 498, 504, 510, 516, 522, 528]
[2026-05-22 18:05:01] [INFO ] Actually due to overlaps returned [429, 411, 31, 48, 176, 303, 435, 159, 286, 156, 283, 409, 453, 157, 284, 410, 431, 454, 1, 18, 271, 272, 394, 395, 66, 155, 194, 321, 455, 498, 516, 528, 19, 398, 456, 468, 474, 480, 486, 492, 504, 510, 522]
Discarding 43 places :
Implicit Place search using SMT only with invariants took 599 ms to find 43 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 521/564 places, 938/938 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 518 transition count 858
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 165 place count 438 transition count 856
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 165 place count 438 transition count 836
Deduced a syphon composed of 20 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 206 place count 417 transition count 836
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 13 rules applied. Total rules applied 219 place count 412 transition count 828
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 227 place count 404 transition count 828
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 242 place count 389 transition count 813
Iterating global reduction 4 with 15 rules applied. Total rules applied 257 place count 389 transition count 813
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 260 place count 389 transition count 810
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 260 place count 389 transition count 809
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 262 place count 388 transition count 809
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 265 place count 385 transition count 803
Iterating global reduction 5 with 3 rules applied. Total rules applied 268 place count 385 transition count 803
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 269 place count 384 transition count 802
Iterating global reduction 5 with 1 rules applied. Total rules applied 270 place count 384 transition count 802
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 271 place count 383 transition count 800
Iterating global reduction 5 with 1 rules applied. Total rules applied 272 place count 383 transition count 800
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 330 place count 354 transition count 771
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 333 place count 351 transition count 768
Iterating global reduction 5 with 3 rules applied. Total rules applied 336 place count 351 transition count 768
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 339 place count 351 transition count 765
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 343 place count 349 transition count 766
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 344 place count 349 transition count 765
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 345 place count 348 transition count 765
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 352 place count 348 transition count 758
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 360 place count 340 transition count 758
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 361 place count 340 transition count 757
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 370 place count 340 transition count 757
Applied a total of 370 rules in 300 ms. Remains 340 /521 variables (removed 181) and now considering 757/938 (removed 181) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5439232082080605271.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6091790158183884896.kers'
[2026-05-22 18:05:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5439232082080605271.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6091790158183884896.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 757 rows 339 cols 3087 entries
Finished phase 1 with 130 SingleSign rule and 161 generalized
[2026-05-22 18:05:01] [INFO ] Computed 49 invariants in 4 ms
Computed 49 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-6091790158183884896.kers
Total runtime 5 ms.
[2026-05-22 18:05:02] [INFO ] Implicit Places using invariants in 347 ms returned [73, 90, 96, 99, 101, 102, 105, 106, 158, 168, 171, 179, 185, 188, 190, 195, 196, 248, 265, 271, 274, 276]
[2026-05-22 18:05:02] [INFO ] Actually due to overlaps returned [105, 195, 106, 196, 90, 96, 101, 179, 185, 190, 265, 271, 276, 73, 102, 158, 168, 248]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 349 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 322/564 places, 757/938 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 310 transition count 745
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 310 transition count 745
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 307 transition count 742
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 307 transition count 742
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 42 place count 301 transition count 736
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 51 place count 301 transition count 727
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 60 place count 292 transition count 727
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 292 transition count 724
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 66 place count 289 transition count 724
Applied a total of 66 rules in 44 ms. Remains 289 /322 variables (removed 33) and now considering 724/757 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14268053616527379983.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14993467511767151960.kers'
[2026-05-22 18:05:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14268053616527379983.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14993467511767151960.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 724 rows 289 cols 2962 entries
Finished phase 1 with 73 SingleSign rule and 185 generalized
[2026-05-22 18:05:02] [INFO ] Computed 31 invariants in 4 ms
Computed 31 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14993467511767151960.kers
Total runtime 5 ms.
[2026-05-22 18:05:02] [INFO ] Implicit Places using invariants in 219 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 220 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 288/564 places, 724/938 transitions.
Applied a total of 0 rules in 8 ms. Remains 288 /288 variables (removed 0) and now considering 724/724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 1552 ms. Remains : 288/564 places, 724/938 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2473326263876758302.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5853974409895323295.kers'
[2026-05-22 18:05:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2473326263876758302.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5853974409895323295.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 724 rows 288 cols 2960 entries
Finished phase 1 with 73 SingleSign rule and 185 generalized
[2026-05-22 18:05:02] [INFO ] Computed 30 invariants in 13 ms
Computed 30 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-5853974409895323295.kers
Total runtime 15 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (21565 resets) in 1819 ms. (549 steps per ms)
BEST_FIRST walk for 2000002 steps (13715 resets) in 1531 ms. (1305 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-22 18:05:05] [INFO ] Invariant cache hit.
[2026-05-22 18:05:05] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-22 18:05:05] [INFO ] [Real]Absence check using 11 positive and 19 generalized place invariants in 9 ms returned sat
[2026-05-22 18:05:06] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2026-05-22 18:05:06] [INFO ] Computed and/alt/rep : 141/734/141 causal constraints (skipped 562 transitions) in 70 ms.
[2026-05-22 18:05:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:05:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 27 ms returned sat
[2026-05-22 18:05:06] [INFO ] [Nat]Absence check using 11 positive and 19 generalized place invariants in 5 ms returned sat
[2026-05-22 18:05:06] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2026-05-22 18:05:06] [INFO ] Computed and/alt/rep : 141/734/141 causal constraints (skipped 562 transitions) in 38 ms.
[2026-05-22 18:05:06] [INFO ] Added : 5 causal constraints over 2 iterations in 129 ms. Result :sat
Minimization took 305 ms.
[2026-05-22 18:05:07] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2026-05-22 18:05:07] [INFO ] [Real]Absence check using 11 positive and 19 generalized place invariants in 13 ms returned sat
[2026-05-22 18:05:07] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2026-05-22 18:05:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:05:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2026-05-22 18:05:07] [INFO ] [Nat]Absence check using 11 positive and 19 generalized place invariants in 4 ms returned sat
[2026-05-22 18:05:07] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2026-05-22 18:05:07] [INFO ] Computed and/alt/rep : 141/734/141 causal constraints (skipped 562 transitions) in 47 ms.
[2026-05-22 18:05:07] [INFO ] Added : 10 causal constraints over 2 iterations in 151 ms. Result :sat
Minimization took 211 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 288 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 288/288 places, 724/724 transitions.
Applied a total of 0 rules in 8 ms. Remains 288 /288 variables (removed 0) and now considering 724/724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 288/288 places, 724/724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 288/288 places, 724/724 transitions.
Applied a total of 0 rules in 7 ms. Remains 288 /288 variables (removed 0) and now considering 724/724 (removed 0) transitions.
[2026-05-22 18:05:08] [INFO ] Invariant cache hit.
[2026-05-22 18:05:08] [INFO ] Implicit Places using invariants in 547 ms returned []
[2026-05-22 18:05:08] [INFO ] Invariant cache hit.
[2026-05-22 18:05:09] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 1101 ms to find 0 implicit places.
[2026-05-22 18:05:09] [INFO ] Redundant transitions in 36 ms returned []
Running 703 sub problems to find dead transitions.
[2026-05-22 18:05:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/287 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 3 (OVERLAPS) 1/288 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 703 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 288/1012 variables, and 31 constraints, problems are : Problem set: 0 solved, 703 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/288 constraints, PredecessorRefiner: 703/703 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 703 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/287 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 3 (OVERLAPS) 1/288 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 703 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 288/1012 variables, and 34 constraints, problems are : Problem set: 0 solved, 703 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/288 constraints, PredecessorRefiner: 0/703 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60457ms problems are : Problem set: 0 solved, 703 unsolved
Search for dead transitions found 0 dead transitions in 60474ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61667 ms. Remains : 288/288 places, 724/724 transitions.
RANDOM walk for 40000 steps (896 resets) in 732 ms. (54 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (275 resets) in 182 ms. (218 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (270 resets) in 181 ms. (219 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (278 resets) in 149 ms. (266 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (277 resets) in 178 ms. (223 steps per ms) remains 4/4 properties
[2026-05-22 18:06:10] [INFO ] Flatten gal took : 129 ms
[2026-05-22 18:06:10] [INFO ] Flatten gal took : 47 ms
[2026-05-22 18:06:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4633633117917738907.gal : 32 ms
[2026-05-22 18:06:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4173569425399707758.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/ReachabilityCardinality4633633117917738907.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4173569425399707758.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/ReachabilityCardinality4173569425399707758.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :12 after 44
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :44 after 1144
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1144 after 2376
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2376 after 2701
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2701 after 2800
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2800 after 3620
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3620 after 37152
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :37152 after 165761
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
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,684469,0.53508,23548,2,15145,18,44719,6,0,1880,29816,0
Total reachable state count : 684469

Verifying 4 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,1,0.537136,23664,2,289,18,44719,7,0,1883,29816,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,1,0.538516,23812,2,289,18,44719,8,0,1884,29816,0
Reachability property MAX1 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
MAX1,6,0.540552,23812,2,398,18,44719,9,0,1886,29816,0
Invariant property MIN1 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
MIN1,6,0.542342,23812,2,398,18,44719,10,0,1887,29816,0
Interrupted probabilistic random walk after 406934 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :2 out of 4
Probabilistic random walk after 406934 steps, saw 214034 distinct states, run finished after 3008 ms. (steps per millisecond=135 ) properties seen :2
FORMULA ASLink-PT-03b-UpperBounds-00 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-03b-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
[2026-05-22 18:06:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (21599 resets) in 1440 ms. (693 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 132923 ms.

BK_STOP 1779473174995

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-03b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is ASLink-PT-03b, 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-177944366200325"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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