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-177946842100607.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 BusinessProcesses-PT-20, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842100607
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.5K Mar 5 17:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 5 17:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 5 17:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 5 17:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Mar 15 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 15 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Mar 5 17:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 5 17:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 5 17:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 5 17:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 192K 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779630307938

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-24 13:45:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 13:45:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 13:45:09] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2026-05-24 13:45:09] [INFO ] Transformed 782 places.
[2026-05-24 13:45:09] [INFO ] Transformed 697 transitions.
[2026-05-24 13:45:09] [INFO ] Found NUPN structural information;
[2026-05-24 13:45:09] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 63 places in 13 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (204 resets) in 1532 ms. (26 steps per ms) remains 10/15 properties
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-24 13:45:09] [INFO ] Flatten gal took : 130 ms
BEST_FIRST walk for 40004 steps (37 resets) in 368 ms. (108 steps per ms) remains 9/10 properties
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2026-05-24 13:45:10] [INFO ] Flatten gal took : 89 ms
BEST_FIRST walk for 40002 steps (36 resets) in 221 ms. (180 steps per ms) remains 8/9 properties
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2026-05-24 13:45:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18090321266267622405.gal : 76 ms
[2026-05-24 13:45:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14571788522490979347.prop : 3 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/ReachabilityCardinality18090321266267622405.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14571788522490979347.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40004 steps (32 resets) in 577 ms. (69 steps per ms) remains 7/8 properties
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Loading property file /tmp/ReachabilityCardinality14571788522490979347.prop.
BEST_FIRST walk for 40003 steps (38 resets) in 265 ms. (150 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (36 resets) in 200 ms. (199 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (32 resets) in 222 ms. (179 steps per ms) remains 6/7 properties
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (37 resets) in 230 ms. (173 steps per ms) remains 5/6 properties
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10416610608751719638.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14281956935862531383.kers'
[2026-05-24 13:45:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10416610608751719638.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14281956935862531383.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 638 rows 719 cols 1853 entries
Finished phase 1 with 518 SingleSign rule and 80 generalized
[2026-05-24 13:45:10] [INFO ] Computed 121 invariants in 4 ms
Computed 121 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-14281956935862531383.kers
Total runtime 6 ms.
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :6 after 7
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :8 after 11
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :11 after 41
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :41 after 81
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :81 after 248
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :248 after 456
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :456 after 604
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :604 after 382835
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :3.61047e+06 after 4.87704e+06
At refinement iteration 2 (OVERLAPS) 446/524 variables, 91/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/524 variables, 446/615 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 53/577 variables, 11/626 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 53/679 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 0/679 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,8 properties remain. new max is 8192
At refinement iteration 8 (OVERLAPS) 140/717 variables, 18/697 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD size :1.17848e+08 after 1.84874e+08
At refinement iteration 9 (INCLUDED_ONLY) 0/717 variables, 140/837 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/717 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 2/719 variables, 1/838 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/719 variables, 2/840 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :1.84874e+08 after 7.89485e+08
At refinement iteration 13 (INCLUDED_ONLY) 0/719 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 638/1357 variables, 719/1559 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1357 variables, 0/1559 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/1357 variables, 0/1559 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1357/1357 variables, and 1559 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3311 ms.
Refiners :[Domain max(s): 719/719 constraints, Positive P Invariants (semi-flows): 102/102 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 719/719 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 446/524 variables, 91/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/524 variables, 446/615 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 15/630 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 1/631 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 53/577 variables, 11/642 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 53/695 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/577 variables, 4/699 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/577 variables, 1/700 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/577 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 140/717 variables, 18/718 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/717 variables, 140/858 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SMT process timed out in 8599ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 78 out of 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 638/638 transitions.
Graph (complete) has 1418 edges and 719 vertex of which 693 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.2 ms
Discarding 26 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 693 transition count 541
Reduce places removed 85 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 99 rules applied. Total rules applied 185 place count 608 transition count 527
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 199 place count 594 transition count 527
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 132 Pre rules applied. Total rules applied 199 place count 594 transition count 395
Deduced a syphon composed of 132 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 281 rules applied. Total rules applied 480 place count 445 transition count 395
Discarding 73 places :
Symmetric choice reduction at 3 with 73 rule applications. Total rules 553 place count 372 transition count 322
Iterating global reduction 3 with 73 rules applied. Total rules applied 626 place count 372 transition count 322
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 626 place count 372 transition count 320
Deduced a syphon composed of 2 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 631 place count 369 transition count 320
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 789 place count 290 transition count 241
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 790 place count 290 transition count 240
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 794 place count 288 transition count 246
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 798 place count 288 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 799 place count 287 transition count 245
Applied a total of 799 rules in 180 ms. Remains 287 /719 variables (removed 432) and now considering 245/638 (removed 393) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 287/719 places, 245/638 transitions.
RANDOM walk for 40000 steps (795 resets) in 552 ms. (72 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (173 resets) in 134 ms. (296 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (153 resets) in 286 ms. (139 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (180 resets) in 182 ms. (218 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (171 resets) in 159 ms. (250 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (166 resets) in 232 ms. (171 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 434941 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :0 out of 5
Probabilistic random walk after 434941 steps, saw 70784 distinct states, run finished after 3007 ms. (steps per millisecond=144 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2378012863513005878.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-901062276047862181.kers'
[2026-05-24 13:45:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2378012863513005878.kers, --Pflows, --basisKERS=/tmp/petrispot-output-901062276047862181.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 245 rows 281 cols 1017 entries
Finished phase 1 with 124 SingleSign rule and 74 generalized
[2026-05-24 13:45:22] [INFO ] Computed 89 invariants in 1 ms
Computed 89 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-901062276047862181.kers
Total runtime 2 ms.
[2026-05-24 13:45:22] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 153/231 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 9/240 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 34/274 variables, 16/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/275 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 245/520 variables, 275/359 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/520 variables, 3/362 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/520 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 12/532 variables, 12/374 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/532 variables, 5/379 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/532 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/532 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 379 constraints, problems are : Problem set: 0 solved, 5 unsolved in 678 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 287/287 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 153/231 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 11/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 9/240 variables, 5/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 34/274 variables, 16/95 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :7.89485e+08 after 1.1715e+10
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 13/108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 7/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/275 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/275 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 245/520 variables, 275/391 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/520 variables, 3/394 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/520 variables, 3/397 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/520 variables, 3/400 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/520 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/520 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 12/532 variables, 12/413 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/532 variables, 5/418 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/532 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 0/532 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 418 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5719 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 287/287 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 6430ms problems are : Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,8 properties remain. new max is 65536
SDD size :1.1715e+10 after 1.34009e+10
Parikh walk visited 0 properties in 864 ms.
Support contains 78 out of 287 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 287/287 places, 245/245 transitions.
Applied a total of 0 rules in 12 ms. Remains 287 /287 variables (removed 0) and now considering 245/245 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 287/287 places, 245/245 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 287/287 places, 245/245 transitions.
Applied a total of 0 rules in 25 ms. Remains 287 /287 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2026-05-24 13:45:30] [INFO ] Invariant cache hit.
[2026-05-24 13:45:30] [INFO ] Implicit Places using invariants in 330 ms returned [44, 49, 51, 53, 55, 58, 80, 82, 246]
[2026-05-24 13:45:30] [INFO ] Actually due to overlaps returned [58, 44, 49, 53, 80, 246]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 344 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 281/287 places, 245/245 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 277 transition count 241
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 277 transition count 241
Applied a total of 8 rules in 14 ms. Remains 277 /281 variables (removed 4) and now considering 241/245 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1748859248817736570.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1367286844421119727.kers'
[2026-05-24 13:45:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1748859248817736570.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1367286844421119727.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 241 rows 271 cols 971 entries
Finished phase 1 with 155 SingleSign rule and 39 generalized
[2026-05-24 13:45:30] [INFO ] Computed 83 invariants in 1 ms
Computed 83 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1367286844421119727.kers
Total runtime 4 ms.
[2026-05-24 13:45:30] [INFO ] Implicit Places using invariants in 153 ms returned []
[2026-05-24 13:45:30] [INFO ] Invariant cache hit.
[2026-05-24 13:45:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-24 13:45:31] [INFO ] Implicit Places using invariants and state equation in 416 ms returned [199, 201, 203, 205, 207]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 572 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 272/287 places, 241/245 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 272 transition count 239
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 270 transition count 239
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 270 transition count 239
Applied a total of 5 rules in 23 ms. Remains 270 /272 variables (removed 2) and now considering 239/241 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14747777095185001014.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15855204687705555513.kers'
[2026-05-24 13:45:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14747777095185001014.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15855204687705555513.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 239 rows 268 cols 963 entries
Finished phase 1 with 160 SingleSign rule and 32 generalized
[2026-05-24 13:45:31] [INFO ] Computed 78 invariants in 1 ms
Computed 78 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15855204687705555513.kers
Total runtime 2 ms.
[2026-05-24 13:45:31] [INFO ] Implicit Places using invariants in 170 ms returned []
[2026-05-24 13:45:31] [INFO ] Invariant cache hit.
[2026-05-24 13:45:31] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-24 13:45:31] [INFO ] Implicit Places using invariants and state equation in 347 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 525 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 269/287 places, 239/245 transitions.
Applied a total of 0 rules in 19 ms. Remains 269 /269 variables (removed 0) and now considering 239/239 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 1527 ms. Remains : 269/287 places, 239/245 transitions.
RANDOM walk for 40000 steps (799 resets) in 216 ms. (184 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (166 resets) in 71 ms. (555 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (153 resets) in 184 ms. (216 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (182 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (167 resets) in 130 ms. (305 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (167 resets) in 139 ms. (285 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 662152 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :0 out of 5
Probabilistic random walk after 662152 steps, saw 103452 distinct states, run finished after 3001 ms. (steps per millisecond=220 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3096068886639949279.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9520568001605896722.kers'
[2026-05-24 13:45:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3096068886639949279.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9520568001605896722.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 239 rows 268 cols 963 entries
Finished phase 1 with 160 SingleSign rule and 32 generalized
[2026-05-24 13:45:34] [INFO ] Computed 77 invariants in 1 ms
Computed 77 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9520568001605896722.kers
Total runtime 2 ms.
[2026-05-24 13:45:34] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 140/218 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 9/227 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 33/260 variables, 12/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2/262 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 239/501 variables, 262/339 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 5/344 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 7/508 variables, 7/351 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/508 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/508 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 508/508 variables, and 351 constraints, problems are : Problem set: 0 solved, 5 unsolved in 757 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 269/269 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 140/218 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 15/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 9/227 variables, 5/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 33/260 variables, 12/90 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 9/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/260 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/260 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 2/262 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/262 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 239/501 variables, 262/405 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/501 variables, 5/410 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/501 variables, 3/413 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/501 variables, 2/415 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/501 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/501 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/501 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 7/508 variables, 7/426 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/508 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 0/508 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 508/508 variables, and 426 constraints, problems are : Problem set: 0 solved, 5 unsolved in 8098 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 269/269 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 69/69 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 8872ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 853 ms.
Support contains 78 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 239/239 transitions.
Applied a total of 0 rules in 6 ms. Remains 269 /269 variables (removed 0) and now considering 239/239 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 269/269 places, 239/239 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 239/239 transitions.
Applied a total of 0 rules in 6 ms. Remains 269 /269 variables (removed 0) and now considering 239/239 (removed 0) transitions.
[2026-05-24 13:45:44] [INFO ] Invariant cache hit.
[2026-05-24 13:45:44] [INFO ] Implicit Places using invariants in 153 ms returned []
[2026-05-24 13:45:44] [INFO ] Invariant cache hit.
[2026-05-24 13:45:45] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-24 13:45:45] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2026-05-24 13:45:45] [INFO ] Redundant transitions in 12 ms returned []
Running 236 sub problems to find dead transitions.
[2026-05-24 13:45:45] [INFO ] Invariant cache hit.
[2026-05-24 13:45:45] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (OVERLAPS) 2/268 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD173 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 20/93 constraints. Problems are: Problem set: 7 solved, 229 unsolved
Problem TDEAD87 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 20/113 constraints. Problems are: Problem set: 11 solved, 225 unsolved
Problem TDEAD170 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 12/125 constraints. Problems are: Problem set: 12 solved, 224 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 268/508 variables, and 125 constraints, problems are : Problem set: 12 solved, 224 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 10/14 constraints, State Equation: 0/269 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 6/6 constraints. Problems are: Problem set: 12 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 0/6 constraints. Problems are: Problem set: 12 solved, 224 unsolved
At refinement iteration 2 (OVERLAPS) 2/268 variables, 63/69 constraints. Problems are: Problem set: 12 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 4/73 constraints. Problems are: Problem set: 12 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 52/125 constraints. Problems are: Problem set: 12 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 0/125 constraints. Problems are: Problem set: 12 solved, 224 unsolved
At refinement iteration 6 (OVERLAPS) 1/269 variables, 4/129 constraints. Problems are: Problem set: 12 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 20/149 constraints. Problems are: Problem set: 12 solved, 224 unsolved
SDD proceeding with computation,8 properties remain. new max is 131072
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 20/169 constraints. Problems are: Problem set: 12 solved, 224 unsolved
SDD size :1.34009e+10 after 7.42991e+10
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 20/189 constraints. Problems are: Problem set: 12 solved, 224 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 20/209 constraints. Problems are: Problem set: 12 solved, 224 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 20/229 constraints. Problems are: Problem set: 12 solved, 224 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 20/249 constraints. Problems are: Problem set: 12 solved, 224 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/269 variables, 20/269 constraints. Problems are: Problem set: 12 solved, 224 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/269 variables, 20/289 constraints. Problems are: Problem set: 12 solved, 224 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/269 variables, 20/309 constraints. Problems are: Problem set: 12 solved, 224 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/269 variables, 20/329 constraints. Problems are: Problem set: 12 solved, 224 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/269 variables, 20/349 constraints. Problems are: Problem set: 12 solved, 224 unsolved
SMT process timed out in 60112ms, After SMT, problems are : Problem set: 12 solved, 224 unsolved
Search for dead transitions found 12 dead transitions in 60120ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 269/269 places, 227/239 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 268 transition count 227
Applied a total of 1 rules in 11 ms. Remains 268 /269 variables (removed 1) and now considering 227/227 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17182887055619692272.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4260240769631362039.kers'
[2026-05-24 13:46:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17182887055619692272.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4260240769631362039.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 227 rows 267 cols 889 entries
Finished phase 1 with 161 SingleSign rule and 28 generalized
[2026-05-24 13:46:45] [INFO ] Computed 79 invariants in 1 ms
Computed 79 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4260240769631362039.kers
Total runtime 2 ms.
[2026-05-24 13:46:45] [INFO ] Implicit Places using invariants in 143 ms returned [40, 258]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 145 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 266/269 places, 227/239 transitions.
Applied a total of 0 rules in 8 ms. Remains 266 /266 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 60842 ms. Remains : 266/269 places, 227/239 transitions.
RANDOM walk for 40000 steps (802 resets) in 353 ms. (112 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (174 resets) in 108 ms. (367 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (157 resets) in 178 ms. (223 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (180 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (173 resets) in 58 ms. (678 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (168 resets) in 139 ms. (285 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 703941 steps, run timeout after 3001 ms. (steps per millisecond=234 ) properties seen :0 out of 5
Probabilistic random walk after 703941 steps, saw 109350 distinct states, run finished after 3001 ms. (steps per millisecond=234 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11688439548262880733.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4561809936916226574.kers'
[2026-05-24 13:46:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11688439548262880733.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4561809936916226574.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 227 rows 265 cols 885 entries
Finished phase 1 with 163 SingleSign rule and 26 generalized
[2026-05-24 13:46:48] [INFO ] Computed 77 invariants in 2 ms
Computed 77 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4561809936916226574.kers
Total runtime 3 ms.
[2026-05-24 13:46:48] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 140/218 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 9/227 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 31/258 variables, 13/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/259 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 227/486 variables, 259/336 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 5/341 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/486 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 7/493 variables, 7/348 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/493 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/493 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 493/493 variables, and 348 constraints, problems are : Problem set: 0 solved, 5 unsolved in 648 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 266/266 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 140/218 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 9/227 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 31/258 variables, 13/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 6/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/259 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 227/486 variables, 259/349 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/486 variables, 5/354 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/486 variables, 3/357 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/486 variables, 3/360 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/486 variables, 3/363 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/486 variables, 5/368 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/486 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/486 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 7/493 variables, 7/376 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/493 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem BusinessProcesses-PT-20-ReachabilityFireability-2024-02 is UNSAT
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 22 (INCLUDED_ONLY) 0/493 variables, 2/379 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/493 variables, 0/379 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/493 variables, 0/379 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 493/493 variables, and 379 constraints, problems are : Problem set: 1 solved, 4 unsolved in 4283 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 266/266 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 4948ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 939 ms.
Support contains 39 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 227/227 transitions.
Graph (trivial) has 35 edges and 266 vertex of which 2 / 266 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 735 edges and 265 vertex of which 264 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 0 with 5 rules applied. Total rules applied 7 place count 264 transition count 219
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 259 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 258 transition count 218
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 14 place count 258 transition count 212
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 26 place count 252 transition count 212
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 31 place count 247 transition count 201
Iterating global reduction 3 with 5 rules applied. Total rules applied 36 place count 247 transition count 201
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 61 rules applied. Total rules applied 97 place count 216 transition count 171
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 215 transition count 170
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 215 transition count 170
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 101 place count 214 transition count 172
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 214 transition count 170
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 105 place count 212 transition count 170
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 107 place count 212 transition count 168
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 109 place count 210 transition count 168
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 110 place count 209 transition count 167
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 114 place count 205 transition count 167
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 115 place count 204 transition count 166
Iterating global reduction 6 with 1 rules applied. Total rules applied 116 place count 204 transition count 166
Applied a total of 116 rules in 74 ms. Remains 204 /266 variables (removed 62) and now considering 166/227 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 204/266 places, 166/227 transitions.
RANDOM walk for 40000 steps (989 resets) in 760 ms. (52 steps per ms) remains 1/4 properties
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 30017 steps (133 resets) in 180 ms. (165 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 106172 ms.

BK_STOP 1779630415303

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="BusinessProcesses-PT-20"
export BK_EXAMINATION="ReachabilityFireability"
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 BusinessProcesses-PT-20, examination is ReachabilityFireability"
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-177946842100607"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-20.tgz
mv BusinessProcesses-PT-20 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;