About the Execution of ITS-Tools for BugTracking-PT-q8m008
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5053.279 | 313677.00 | 381254.00 | 2671.50 | 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r034-tall-177946841900405.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 BugTracking-PT-q8m008, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946841900405
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.6K Mar 5 17:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 5 17:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 5 17:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 5 17:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 15 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 5 17:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Mar 5 17:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 5 17:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Mar 5 17:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 16M 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 BugTracking-PT-q8m008-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779598360747
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m008
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-24 04:52:41] [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-24 04:52:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 04:52:42] [INFO ] Load time of PNML (sax parser for PT used): 784 ms
[2026-05-24 04:52:42] [INFO ] Transformed 754 places.
[2026-05-24 04:52:42] [INFO ] Transformed 27370 transitions.
[2026-05-24 04:52:42] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 961 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 474 places in 106 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m008-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13467374583512585000.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4305310383630005175.kers'
[2026-05-24 04:52:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13467374583512585000.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4305310383630005175.kers]
Normalized transition count is 3729 out of 3904 initially.
Culled 0 columns in 2 ms.
// Phase 1: matrix 3729 rows 280 cols 17780 entries
Finished phase 1 with 270 SingleSign rule and 0 generalized
[2026-05-24 04:52:43] [INFO ] Computed 10 invariants in 11 ms
Computed 10 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-4305310383630005175.kers
Total runtime 16 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 10000 steps (49 resets) in 124 ms. (80 steps per ms)
FORMULA BugTracking-PT-q8m008-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BugTracking-PT-q8m008-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (13 resets) in 32 ms. (303 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-24 04:52:43] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9282837751831818947.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6712925739284362140.kers'
[2026-05-24 04:52:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9282837751831818947.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6712925739284362140.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 3729 rows 280 cols 17780 entries
Finished phase 1 with 270 SingleSign rule and 0 generalized
[2026-05-24 04:52:43] [INFO ] Computed 10 invariants in 13 ms
Computed 10 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-6712925739284362140.kers
Total runtime 16 ms.
[2026-05-24 04:52:43] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2026-05-24 04:52:44] [INFO ] [Real]Absence check using state equation in 706 ms returned sat
[2026-05-24 04:52:44] [INFO ] State equation strengthened by 303 read => feed constraints.
[2026-05-24 04:52:44] [INFO ] [Real]Added 303 Read/Feed constraints in 101 ms returned sat
[2026-05-24 04:52:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:52:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-24 04:52:45] [INFO ] [Nat]Absence check using state equation in 557 ms returned sat
[2026-05-24 04:52:45] [INFO ] [Nat]Added 303 Read/Feed constraints in 229 ms returned sat
[2026-05-24 04:52:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1248 ms
[2026-05-24 04:52:47] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 401 ms.
[2026-05-24 04:52:47] [INFO ] Added : 6 causal constraints over 2 iterations in 936 ms. Result :sat
Minimization took 1010 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 280 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place x4_FIX_AGAIN_q5) removed 33 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3871/3871 transitions.
Graph (complete) has 4620 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3839
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3839
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3845
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3839
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3839
Applied a total of 19 rules in 342 ms. Remains 269 /280 variables (removed 11) and now considering 3839/3871 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 351 ms. Remains : 269/280 places, 3839/3871 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9038231550901739000.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17392273678123672610.kers'
[2026-05-24 04:52:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9038231550901739000.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17392273678123672610.kers]
Normalized transition count is 3669 out of 3839 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 3669 rows 269 cols 17531 entries
Finished phase 1 with 261 SingleSign rule and 0 generalized
[2026-05-24 04:52:49] [INFO ] Computed 8 invariants in 13 ms
Computed 8 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-17392273678123672610.kers
Total runtime 16 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000003 steps (2 resets) in 5711 ms. (175 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 2107 ms. (474 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-24 04:52:56] [INFO ] Flow matrix only has 3669 transitions (discarded 170 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7760607783630715943.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16309400263627695514.kers'
[2026-05-24 04:52:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7760607783630715943.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16309400263627695514.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 3669 rows 269 cols 17531 entries
Finished phase 1 with 261 SingleSign rule and 0 generalized
[2026-05-24 04:52:56] [INFO ] Computed 8 invariants in 12 ms
Computed 8 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-16309400263627695514.kers
Total runtime 19 ms.
[2026-05-24 04:52:56] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2026-05-24 04:52:57] [INFO ] [Real]Absence check using state equation in 540 ms returned sat
[2026-05-24 04:52:57] [INFO ] State equation strengthened by 282 read => feed constraints.
[2026-05-24 04:52:57] [INFO ] [Real]Added 282 Read/Feed constraints in 71 ms returned sat
[2026-05-24 04:52:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:52:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-24 04:52:58] [INFO ] [Nat]Absence check using state equation in 544 ms returned sat
[2026-05-24 04:52:58] [INFO ] [Nat]Added 282 Read/Feed constraints in 205 ms returned sat
[2026-05-24 04:52:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 832 ms
[2026-05-24 04:52:59] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3210 transitions) in 434 ms.
[2026-05-24 04:53:00] [INFO ] Added : 3 causal constraints over 1 iterations in 750 ms. Result :sat
Minimization took 3269 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 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3839/3839 transitions.
Applied a total of 0 rules in 60 ms. Remains 269 /269 variables (removed 0) and now considering 3839/3839 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 269/269 places, 3839/3839 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3839/3839 transitions.
Applied a total of 0 rules in 84 ms. Remains 269 /269 variables (removed 0) and now considering 3839/3839 (removed 0) transitions.
[2026-05-24 04:53:03] [INFO ] Flow matrix only has 3669 transitions (discarded 170 similar events)
[2026-05-24 04:53:03] [INFO ] Invariant cache hit.
[2026-05-24 04:53:04] [INFO ] Implicit Places using invariants in 457 ms returned []
[2026-05-24 04:53:04] [INFO ] Flow matrix only has 3669 transitions (discarded 170 similar events)
[2026-05-24 04:53:04] [INFO ] Invariant cache hit.
[2026-05-24 04:53:04] [INFO ] State equation strengthened by 282 read => feed constraints.
[2026-05-24 04:53:07] [INFO ] Implicit Places using invariants and state equation in 3057 ms returned []
Implicit Place search using SMT with State Equation took 3518 ms to find 0 implicit places.
[2026-05-24 04:53:07] [INFO ] Redundant transitions in 266 ms returned []
Running 3838 sub problems to find dead transitions.
[2026-05-24 04:53:07] [INFO ] Flow matrix only has 3669 transitions (discarded 170 similar events)
[2026-05-24 04:53:07] [INFO ] Invariant cache hit.
[2026-05-24 04:53:07] [INFO ] State equation strengthened by 282 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3838 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 268/3938 variables, and 7 constraints, problems are : Problem set: 0 solved, 3838 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 7/8 constraints, State Equation: 0/269 constraints, ReadFeed: 0/282 constraints, PredecessorRefiner: 3838/594 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3838 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3838 unsolved
Problem TDEAD2044 is UNSAT
Problem TDEAD2045 is UNSAT
Problem TDEAD2046 is UNSAT
Problem TDEAD2047 is UNSAT
Problem TDEAD2048 is UNSAT
Problem TDEAD2049 is UNSAT
Problem TDEAD2050 is UNSAT
Problem TDEAD2051 is UNSAT
Problem TDEAD2052 is UNSAT
Problem TDEAD2053 is UNSAT
Problem TDEAD2054 is UNSAT
Problem TDEAD2055 is UNSAT
Problem TDEAD2056 is UNSAT
Problem TDEAD2057 is UNSAT
Problem TDEAD2058 is UNSAT
Problem TDEAD2059 is UNSAT
Problem TDEAD2060 is UNSAT
Problem TDEAD2061 is UNSAT
Problem TDEAD2062 is UNSAT
Problem TDEAD2063 is UNSAT
Problem TDEAD2069 is UNSAT
Problem TDEAD2070 is UNSAT
Problem TDEAD2071 is UNSAT
Problem TDEAD2072 is UNSAT
Problem TDEAD2073 is UNSAT
Problem TDEAD2074 is UNSAT
Problem TDEAD2075 is UNSAT
Problem TDEAD2076 is UNSAT
Problem TDEAD2081 is UNSAT
Problem TDEAD2082 is UNSAT
Problem TDEAD2083 is UNSAT
Problem TDEAD2084 is UNSAT
Problem TDEAD2085 is UNSAT
Problem TDEAD2086 is UNSAT
Problem TDEAD2087 is UNSAT
Problem TDEAD2088 is UNSAT
Problem TDEAD2089 is UNSAT
Problem TDEAD2090 is UNSAT
Problem TDEAD2091 is UNSAT
Problem TDEAD2092 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 268/3938 variables, and 10 constraints, problems are : Problem set: 40 solved, 3798 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 7/8 constraints, State Equation: 0/269 constraints, ReadFeed: 0/282 constraints, PredecessorRefiner: 3244/594 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 66129ms problems are : Problem set: 40 solved, 3798 unsolved
Search for dead transitions found 40 dead transitions in 66165ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 269/269 places, 3799/3839 transitions.
Reduce places removed 14 places and 483 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 255 transition count 3316
Reduce places removed 10 places and 280 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 24 place count 245 transition count 3036
Reduce places removed 12 places and 337 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 36 place count 233 transition count 2699
Reduce places removed 8 places and 189 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 44 place count 225 transition count 2510
Applied a total of 44 rules in 58 ms. Remains 225 /269 variables (removed 44) and now considering 2510/3799 (removed 1289) transitions.
[2026-05-24 04:54:13] [INFO ] Flow matrix only has 2392 transitions (discarded 118 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18046667738175307083.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8236618965847202090.kers'
[2026-05-24 04:54:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18046667738175307083.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8236618965847202090.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2392 rows 225 cols 11309 entries
Finished phase 1 with 217 SingleSign rule and 0 generalized
[2026-05-24 04:54:13] [INFO ] Computed 8 invariants in 8 ms
Computed 8 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-8236618965847202090.kers
Total runtime 10 ms.
[2026-05-24 04:54:14] [INFO ] Implicit Places using invariants in 405 ms returned []
[2026-05-24 04:54:14] [INFO ] Flow matrix only has 2392 transitions (discarded 118 similar events)
[2026-05-24 04:54:14] [INFO ] Invariant cache hit.
[2026-05-24 04:54:14] [INFO ] State equation strengthened by 217 read => feed constraints.
[2026-05-24 04:54:16] [INFO ] Implicit Places using invariants and state equation in 2164 ms returned []
Implicit Place search using SMT with State Equation took 2575 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 225/269 places, 2510/3839 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 72719 ms. Remains : 225/269 places, 2510/3839 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1482569417151486119.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13246440969193434908.kers'
[2026-05-24 04:54:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1482569417151486119.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13246440969193434908.kers]
Normalized transition count is 2392 out of 2510 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 2392 rows 225 cols 11309 entries
Finished phase 1 with 217 SingleSign rule and 0 generalized
[2026-05-24 04:54:16] [INFO ] Computed 8 invariants in 8 ms
Computed 8 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-13246440969193434908.kers
Total runtime 12 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000006 steps (2 resets) in 3591 ms. (278 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1708 ms. (585 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-24 04:54:21] [INFO ] Flow matrix only has 2392 transitions (discarded 118 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11251004835893176949.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4578137990384164769.kers'
[2026-05-24 04:54:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11251004835893176949.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4578137990384164769.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2392 rows 225 cols 11309 entries
Finished phase 1 with 217 SingleSign rule and 0 generalized
[2026-05-24 04:54:21] [INFO ] Computed 8 invariants in 15 ms
Computed 8 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-4578137990384164769.kers
Total runtime 22 ms.
[2026-05-24 04:54:21] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-24 04:54:22] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2026-05-24 04:54:22] [INFO ] State equation strengthened by 217 read => feed constraints.
[2026-05-24 04:54:22] [INFO ] [Real]Added 217 Read/Feed constraints in 50 ms returned sat
[2026-05-24 04:54:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:54:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-24 04:54:22] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2026-05-24 04:54:22] [INFO ] [Nat]Added 217 Read/Feed constraints in 137 ms returned sat
[2026-05-24 04:54:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1538 ms
[2026-05-24 04:54:24] [INFO ] Computed and/alt/rep : 512/2058/512 causal constraints (skipped 1879 transitions) in 178 ms.
[2026-05-24 04:54:24] [INFO ] Added : 8 causal constraints over 2 iterations in 486 ms. Result :sat
Minimization took 1261 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 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 2510/2510 transitions.
Applied a total of 0 rules in 30 ms. Remains 225 /225 variables (removed 0) and now considering 2510/2510 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 225/225 places, 2510/2510 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 2510/2510 transitions.
Applied a total of 0 rules in 28 ms. Remains 225 /225 variables (removed 0) and now considering 2510/2510 (removed 0) transitions.
[2026-05-24 04:54:26] [INFO ] Flow matrix only has 2392 transitions (discarded 118 similar events)
[2026-05-24 04:54:26] [INFO ] Invariant cache hit.
[2026-05-24 04:54:26] [INFO ] Implicit Places using invariants in 291 ms returned []
[2026-05-24 04:54:26] [INFO ] Flow matrix only has 2392 transitions (discarded 118 similar events)
[2026-05-24 04:54:26] [INFO ] Invariant cache hit.
[2026-05-24 04:54:26] [INFO ] State equation strengthened by 217 read => feed constraints.
[2026-05-24 04:54:28] [INFO ] Implicit Places using invariants and state equation in 1985 ms returned []
Implicit Place search using SMT with State Equation took 2278 ms to find 0 implicit places.
[2026-05-24 04:54:28] [INFO ] Redundant transitions in 146 ms returned []
Running 2509 sub problems to find dead transitions.
[2026-05-24 04:54:28] [INFO ] Flow matrix only has 2392 transitions (discarded 118 similar events)
[2026-05-24 04:54:28] [INFO ] Invariant cache hit.
[2026-05-24 04:54:28] [INFO ] State equation strengthened by 217 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2509 unsolved
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD2469 is UNSAT
Problem TDEAD2470 is UNSAT
Problem TDEAD2481 is UNSAT
Problem TDEAD2482 is UNSAT
Problem TDEAD2483 is UNSAT
Problem TDEAD2494 is UNSAT
Problem TDEAD2495 is UNSAT
Problem TDEAD2506 is UNSAT
Problem TDEAD2507 is UNSAT
Problem TDEAD2508 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 3/10 constraints. Problems are: Problem set: 322 solved, 2187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 224/2617 variables, and 10 constraints, problems are : Problem set: 322 solved, 2187 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 7/8 constraints, State Equation: 0/225 constraints, ReadFeed: 0/217 constraints, PredecessorRefiner: 2509/1337 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 322 solved, 2187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 7/7 constraints. Problems are: Problem set: 322 solved, 2187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 3/10 constraints. Problems are: Problem set: 322 solved, 2187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/10 constraints. Problems are: Problem set: 322 solved, 2187 unsolved
At refinement iteration 3 (OVERLAPS) 1/225 variables, 1/11 constraints. Problems are: Problem set: 322 solved, 2187 unsolved
Problem TDEAD1379 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1415 is UNSAT
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 225/2617 variables, and 12 constraints, problems are : Problem set: 352 solved, 2157 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/225 constraints, ReadFeed: 0/217 constraints, PredecessorRefiner: 1172/1337 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64262ms problems are : Problem set: 352 solved, 2157 unsolved
Search for dead transitions found 352 dead transitions in 64272ms
Found 352 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 352 transitions
Dead transitions reduction (with SMT) removed 352 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 225/225 places, 2158/2510 transitions.
Reduce places removed 1 places and 21 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 224 transition count 2137
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 209 transition count 2071
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 209 transition count 2071
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 44 place count 196 transition count 1967
Iterating global reduction 1 with 13 rules applied. Total rules applied 57 place count 196 transition count 1967
Applied a total of 57 rules in 54 ms. Remains 196 /225 variables (removed 29) and now considering 1967/2158 (removed 191) transitions.
[2026-05-24 04:55:32] [INFO ] Flow matrix only has 1832 transitions (discarded 135 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-517357469095392610.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16611209046610541163.kers'
[2026-05-24 04:55:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-517357469095392610.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16611209046610541163.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1832 rows 196 cols 8659 entries
Finished phase 1 with 188 SingleSign rule and 0 generalized
[2026-05-24 04:55:32] [INFO ] Computed 8 invariants in 11 ms
Computed 8 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-16611209046610541163.kers
Total runtime 13 ms.
[2026-05-24 04:55:33] [INFO ] Implicit Places using invariants in 254 ms returned []
[2026-05-24 04:55:33] [INFO ] Flow matrix only has 1832 transitions (discarded 135 similar events)
[2026-05-24 04:55:33] [INFO ] Invariant cache hit.
[2026-05-24 04:55:33] [INFO ] State equation strengthened by 164 read => feed constraints.
[2026-05-24 04:55:34] [INFO ] Implicit Places using invariants and state equation in 1171 ms returned []
Implicit Place search using SMT with State Equation took 1431 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 196/225 places, 1967/2510 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 68236 ms. Remains : 196/225 places, 1967/2510 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16054424018045274122.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11812732810968329317.kers'
[2026-05-24 04:55:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16054424018045274122.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11812732810968329317.kers]
Normalized transition count is 1832 out of 1967 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 1832 rows 196 cols 8659 entries
Finished phase 1 with 188 SingleSign rule and 0 generalized
[2026-05-24 04:55:34] [INFO ] Computed 8 invariants in 11 ms
Computed 8 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-11812732810968329317.kers
Total runtime 13 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 3976 ms. (251 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1566 ms. (638 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-24 04:55:39] [INFO ] Flow matrix only has 1832 transitions (discarded 135 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10269863138087247321.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16468505113362924029.kers'
[2026-05-24 04:55:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10269863138087247321.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16468505113362924029.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1832 rows 196 cols 8659 entries
Finished phase 1 with 188 SingleSign rule and 0 generalized
[2026-05-24 04:55:39] [INFO ] Computed 8 invariants in 6 ms
Computed 8 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-16468505113362924029.kers
Total runtime 11 ms.
[2026-05-24 04:55:40] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-24 04:55:40] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2026-05-24 04:55:40] [INFO ] State equation strengthened by 164 read => feed constraints.
[2026-05-24 04:55:40] [INFO ] [Real]Added 164 Read/Feed constraints in 32 ms returned sat
[2026-05-24 04:55:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:55:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2026-05-24 04:55:40] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2026-05-24 04:55:40] [INFO ] [Nat]Added 164 Read/Feed constraints in 41 ms returned sat
[2026-05-24 04:55:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1399 ms
[2026-05-24 04:55:42] [INFO ] Computed and/alt/rep : 426/1515/426 causal constraints (skipped 1405 transitions) in 98 ms.
[2026-05-24 04:55:42] [INFO ] Added : 9 causal constraints over 3 iterations in 407 ms. Result :sat
Minimization took 962 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 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 1967/1967 transitions.
Applied a total of 0 rules in 21 ms. Remains 196 /196 variables (removed 0) and now considering 1967/1967 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 196/196 places, 1967/1967 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 1967/1967 transitions.
Applied a total of 0 rules in 20 ms. Remains 196 /196 variables (removed 0) and now considering 1967/1967 (removed 0) transitions.
[2026-05-24 04:55:43] [INFO ] Flow matrix only has 1832 transitions (discarded 135 similar events)
[2026-05-24 04:55:43] [INFO ] Invariant cache hit.
[2026-05-24 04:55:43] [INFO ] Implicit Places using invariants in 231 ms returned []
[2026-05-24 04:55:43] [INFO ] Flow matrix only has 1832 transitions (discarded 135 similar events)
[2026-05-24 04:55:43] [INFO ] Invariant cache hit.
[2026-05-24 04:55:44] [INFO ] State equation strengthened by 164 read => feed constraints.
[2026-05-24 04:55:45] [INFO ] Implicit Places using invariants and state equation in 1180 ms returned []
Implicit Place search using SMT with State Equation took 1413 ms to find 0 implicit places.
[2026-05-24 04:55:45] [INFO ] Redundant transitions in 39 ms returned []
Running 1966 sub problems to find dead transitions.
[2026-05-24 04:55:45] [INFO ] Flow matrix only has 1832 transitions (discarded 135 similar events)
[2026-05-24 04:55:45] [INFO ] Invariant cache hit.
[2026-05-24 04:55:45] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1966 unsolved
At refinement iteration 2 (OVERLAPS) 1/196 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1966 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 196/2028 variables, and 8 constraints, problems are : Problem set: 0 solved, 1966 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/196 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 1966/883 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1966 unsolved
At refinement iteration 2 (OVERLAPS) 1/196 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1966 unsolved
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1420 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1426 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1493 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1508 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1439 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1464 is UNSAT
Problem TDEAD1465 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 2/10 constraints. Problems are: Problem set: 258 solved, 1708 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 196/2028 variables, and 10 constraints, problems are : Problem set: 258 solved, 1708 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/196 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 1083/883 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62551ms problems are : Problem set: 258 solved, 1708 unsolved
Search for dead transitions found 258 dead transitions in 62556ms
Found 258 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 258 transitions
Dead transitions reduction (with SMT) removed 258 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 196/196 places, 1709/1967 transitions.
Reduce places removed 15 places and 365 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 181 transition count 1344
Reduce places removed 13 places and 204 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 28 place count 168 transition count 1140
Reduce places removed 7 places and 87 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 35 place count 161 transition count 1053
Reduce places removed 5 places and 29 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 40 place count 156 transition count 1024
Reduce places removed 2 places and 46 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 42 place count 154 transition count 978
Reduce places removed 1 places and 16 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 43 place count 153 transition count 962
Reduce places removed 1 places and 8 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 44 place count 152 transition count 954
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 51 place count 145 transition count 918
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 32 transitions.
Iterating global reduction 7 with 9 rules applied. Total rules applied 60 place count 143 transition count 886
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 65 place count 138 transition count 826
Iterating global reduction 7 with 5 rules applied. Total rules applied 70 place count 138 transition count 826
Applied a total of 70 rules in 28 ms. Remains 138 /196 variables (removed 58) and now considering 826/1709 (removed 883) transitions.
[2026-05-24 04:56:47] [INFO ] Flow matrix only has 732 transitions (discarded 94 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6461861032042708493.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8978312535211267420.kers'
[2026-05-24 04:56:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6461861032042708493.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8978312535211267420.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 732 rows 138 cols 3349 entries
Finished phase 1 with 130 SingleSign rule and 0 generalized
[2026-05-24 04:56:47] [INFO ] Computed 8 invariants in 7 ms
Computed 8 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-8978312535211267420.kers
Total runtime 9 ms.
[2026-05-24 04:56:47] [INFO ] Implicit Places using invariants in 137 ms returned []
[2026-05-24 04:56:47] [INFO ] Flow matrix only has 732 transitions (discarded 94 similar events)
[2026-05-24 04:56:47] [INFO ] Invariant cache hit.
[2026-05-24 04:56:47] [INFO ] State equation strengthened by 95 read => feed constraints.
[2026-05-24 04:56:48] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 846 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 138/196 places, 826/1967 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64916 ms. Remains : 138/196 places, 826/1967 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14558160225212625019.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11068796425143606229.kers'
[2026-05-24 04:56:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14558160225212625019.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11068796425143606229.kers]
Normalized transition count is 732 out of 826 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 732 rows 138 cols 3349 entries
Finished phase 1 with 130 SingleSign rule and 0 generalized
[2026-05-24 04:56:48] [INFO ] Computed 8 invariants in 5 ms
Computed 8 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-11068796425143606229.kers
Total runtime 7 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000007 steps (2 resets) in 1636 ms. (610 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 868 ms. (1150 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-24 04:56:51] [INFO ] Flow matrix only has 732 transitions (discarded 94 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7706830232344138009.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4923370428435256052.kers'
[2026-05-24 04:56:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7706830232344138009.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4923370428435256052.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 732 rows 138 cols 3349 entries
Finished phase 1 with 130 SingleSign rule and 0 generalized
[2026-05-24 04:56:51] [INFO ] Computed 8 invariants in 7 ms
Computed 8 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-4923370428435256052.kers
Total runtime 10 ms.
[2026-05-24 04:56:51] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-24 04:56:51] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2026-05-24 04:56:51] [INFO ] State equation strengthened by 95 read => feed constraints.
[2026-05-24 04:56:51] [INFO ] [Real]Added 95 Read/Feed constraints in 19 ms returned sat
[2026-05-24 04:56:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:56:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-24 04:56:51] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2026-05-24 04:56:51] [INFO ] [Nat]Added 95 Read/Feed constraints in 21 ms returned sat
[2026-05-24 04:56:52] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 929 ms
[2026-05-24 04:56:52] [INFO ] Computed and/alt/rep : 289/1154/289 causal constraints (skipped 442 transitions) in 29 ms.
[2026-05-24 04:56:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2026-05-24 04:56:52] [INFO ] Added : 10 causal constraints over 2 iterations in 270 ms. Result :sat
Minimization took 211 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 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 826/826 transitions.
Applied a total of 0 rules in 8 ms. Remains 138 /138 variables (removed 0) and now considering 826/826 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 138/138 places, 826/826 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 826/826 transitions.
Applied a total of 0 rules in 7 ms. Remains 138 /138 variables (removed 0) and now considering 826/826 (removed 0) transitions.
[2026-05-24 04:56:52] [INFO ] Flow matrix only has 732 transitions (discarded 94 similar events)
[2026-05-24 04:56:52] [INFO ] Invariant cache hit.
[2026-05-24 04:56:53] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-05-24 04:56:53] [INFO ] Flow matrix only has 732 transitions (discarded 94 similar events)
[2026-05-24 04:56:53] [INFO ] Invariant cache hit.
[2026-05-24 04:56:53] [INFO ] State equation strengthened by 95 read => feed constraints.
[2026-05-24 04:56:53] [INFO ] Implicit Places using invariants and state equation in 688 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
[2026-05-24 04:56:53] [INFO ] Redundant transitions in 11 ms returned []
Running 825 sub problems to find dead transitions.
[2026-05-24 04:56:53] [INFO ] Flow matrix only has 732 transitions (discarded 94 similar events)
[2026-05-24 04:56:53] [INFO ] Invariant cache hit.
[2026-05-24 04:56:53] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 825 unsolved
Problem TDEAD818 is UNSAT
Problem TDEAD825 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 2/9 constraints. Problems are: Problem set: 2 solved, 823 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 823 unsolved
At refinement iteration 3 (OVERLAPS) 1/138 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 823 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 823 unsolved
At refinement iteration 5 (OVERLAPS) 732/870 variables, 138/148 constraints. Problems are: Problem set: 2 solved, 823 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/870 variables, 95/243 constraints. Problems are: Problem set: 2 solved, 823 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/870 variables, 0/243 constraints. Problems are: Problem set: 2 solved, 823 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 870/870 variables, and 243 constraints, problems are : Problem set: 2 solved, 823 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 138/138 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 825/825 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 823 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 823 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 2/9 constraints. Problems are: Problem set: 2 solved, 823 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 823 unsolved
At refinement iteration 3 (OVERLAPS) 1/138 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 823 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 823 unsolved
At refinement iteration 5 (OVERLAPS) 732/870 variables, 138/148 constraints. Problems are: Problem set: 2 solved, 823 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/870 variables, 95/243 constraints. Problems are: Problem set: 2 solved, 823 unsolved
Problem TDEAD82 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD819 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/870 variables, 823/1066 constraints. Problems are: Problem set: 122 solved, 703 unsolved
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 870/870 variables, and 1068 constraints, problems are : Problem set: 177 solved, 648 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 138/138 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 823/825 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60533ms problems are : Problem set: 177 solved, 648 unsolved
Search for dead transitions found 177 dead transitions in 60535ms
Found 177 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 177 transitions
Dead transitions reduction (with SMT) removed 177 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 138/138 places, 649/826 transitions.
Graph (complete) has 958 edges and 138 vertex of which 132 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Reduce places removed 20 places and 206 transitions.
Graph (complete) has 671 edges and 112 vertex of which 1 are kept as prefixes of interest. Removing 111 places using SCC suffix rule.1 ms
Discarding 111 places :
Also discarding 443 output transitions
Drop transitions (Output transitions of discarded places.) removed 443 transitions
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 1 transition count 0
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 22 rules in 2 ms. Remains 1 /138 variables (removed 137) and now considering 0/649 (removed 649) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15032563857950025806.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3985318285768205777.kers'
[2026-05-24 04:57:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15032563857950025806.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3985318285768205777.kers]
[2026-05-24 04:57:54] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3985318285768205777.kers
Total runtime 0 ms.
[2026-05-24 04:57:54] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-24 04:57:54] [INFO ] Invariant cache hit.
[2026-05-24 04:57:54] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1/138 places, 0/826 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61434 ms. Remains : 1/138 places, 0/826 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
FORMULA BugTracking-PT-q8m008-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (after structural reductions) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 312480 ms.
BK_STOP 1779598674424
--------------------
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="BugTracking-PT-q8m008"
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 BugTracking-PT-q8m008, 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 r034-tall-177946841900405"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m008.tgz
mv BugTracking-PT-q8m008 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;