fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r146-tall-177961074000150
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for FunctionPointer-PT-c032

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16199.539 3600000.00 5061300.00 266159.10 TTFTFFFTF?FFTTTF 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.r146-tall-177961074000150.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 FunctionPointer-PT-c032, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074000150
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.7K Mar 7 07:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Mar 7 07:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 7 07:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K Mar 7 07:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 10:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 10:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 10:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 7 07:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Mar 7 07:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 7 07:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 7 07:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 4.2M 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 FunctionPointer-PT-c032-ReachabilityCardinality-2024-00
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityCardinality-2024-01
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityCardinality-2024-02
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityCardinality-2024-03
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityCardinality-2024-04
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityCardinality-2024-05
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityCardinality-2024-06
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityCardinality-2024-07
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityCardinality-2024-08
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityCardinality-2024-09
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityCardinality-2024-10
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityCardinality-2024-11
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityCardinality-2024-12
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityCardinality-2024-13
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityCardinality-2024-14
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779699473967

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c032
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-25 08:57:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 08:57:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 08:57:55] [INFO ] Load time of PNML (sax parser for PT used): 367 ms
[2026-05-25 08:57:55] [INFO ] Transformed 2826 places.
[2026-05-25 08:57:55] [INFO ] Transformed 8960 transitions.
[2026-05-25 08:57:55] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 505 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 33 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c032-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40018 steps (8 resets) in 4290 ms. (9 steps per ms) remains 7/10 properties
FORMULA FunctionPointer-PT-c032-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-c032-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-c032-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (16 resets) in 289 ms. (137 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (16 resets) in 153 ms. (259 steps per ms) remains 7/7 properties
[2026-05-25 08:57:57] [INFO ] Flatten gal took : 840 ms
BEST_FIRST walk for 40004 steps (13 resets) in 223 ms. (178 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (19 resets) in 192 ms. (207 steps per ms) remains 6/7 properties
FORMULA FunctionPointer-PT-c032-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (17 resets) in 574 ms. (69 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 157 ms. (253 steps per ms) remains 6/6 properties
[2026-05-25 08:57:57] [INFO ] Flatten gal took : 350 ms
BEST_FIRST walk for 40004 steps (15 resets) in 162 ms. (245 steps per ms) remains 6/6 properties
[2026-05-25 08:57:57] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11985714040207412574.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9792435041989742726.kers'
[2026-05-25 08:57:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11985714040207412574.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9792435041989742726.kers]
[2026-05-25 08:57:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12304645608641753222.gal : 137 ms
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 3540 rows 1627 cols 8708 entries
[2026-05-25 08:57:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2911436365340708553.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/ReachabilityCardinality12304645608641753222.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2911436365340708553.prop' '--nowitness' '--gen-order' 'FOLLOW'
Finished phase 1 with 1624 SingleSign rule and 0 generalized
[2026-05-25 08:57:57] [INFO ] Computed 4 invariants in 18 ms
Computed 4 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-9792435041989742726.kers
Total runtime 23 ms.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
[2026-05-25 08:57:57] [INFO ] State equation strengthened by 479 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem FunctionPointer-PT-c032-ReachabilityCardinality-2024-06 is UNSAT
FORMULA FunctionPointer-PT-c032-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 537/563 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/563 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/565 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/565 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/566 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Loading property file /tmp/ReachabilityCardinality2911436365340708553.prop.
At refinement iteration 7 (OVERLAPS) 1441/2007 variables, 566/570 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2007 variables, 399/969 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2007 variables, 0/969 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1415/3422 variables, 430/1399 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3422 variables, 80/1479 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3422 variables, 0/1479 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 795/4217 variables, 400/1879 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4217 variables, 0/1879 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 690/4907 variables, 139/2018 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4907 variables, 0/2018 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 261/5168 variables, 93/2111 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5168/5168 variables, and 2111 constraints, problems are : Problem set: 1 solved, 5 unsolved in 3251 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1628/1628 constraints, ReadFeed: 479/479 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 539/563 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/563 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/565 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/565 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/566 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1441/2007 variables, 566/570 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2007 variables, 399/969 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2007 variables, 1/970 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2007 variables, 1/971 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2007 variables, 0/971 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1415/3422 variables, 430/1401 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3422 variables, 80/1481 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3422 variables, 4/1485 constraints. Problems are: Problem set: 1 solved, 5 unsolved
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 31
At refinement iteration 15 (INCLUDED_ONLY) 0/3422 variables, 2/1487 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3422 variables, 0/1487 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 795/4217 variables, 400/1887 constraints. Problems are: Problem set: 1 solved, 5 unsolved
SMT process timed out in 8523ms, After SMT, problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
FORMULA FunctionPointer-PT-c032-ReachabilityCardinality-2024-11 FALSE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-c032-ReachabilityCardinality-2024-07 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 1534 ms.
Support contains 18 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1419 are kept as prefixes of interest. Removing 209 places using SCC suffix rule.13 ms
Discarding 209 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 1419 transition count 5578
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :31 after 2059
Discarding 295 places :
Symmetric choice reduction at 1 with 295 rule applications. Total rules 680 place count 1124 transition count 3326
Iterating global reduction 1 with 295 rules applied. Total rules applied 975 place count 1124 transition count 3326
Ensure Unique test removed 368 transitions
Reduce isomorphic transitions removed 368 transitions.
Iterating post reduction 1 with 368 rules applied. Total rules applied 1343 place count 1124 transition count 2958
Discarding 152 places :
Symmetric choice reduction at 2 with 152 rule applications. Total rules 1495 place count 972 transition count 2654
Iterating global reduction 2 with 152 rules applied. Total rules applied 1647 place count 972 transition count 2654
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 1715 place count 972 transition count 2586
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1729 place count 958 transition count 2558
Iterating global reduction 3 with 14 rules applied. Total rules applied 1743 place count 958 transition count 2558
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1757 place count 944 transition count 2530
Iterating global reduction 3 with 14 rules applied. Total rules applied 1771 place count 944 transition count 2530
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1785 place count 930 transition count 2502
Iterating global reduction 3 with 14 rules applied. Total rules applied 1799 place count 930 transition count 2502
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1813 place count 916 transition count 2474
Iterating global reduction 3 with 14 rules applied. Total rules applied 1827 place count 916 transition count 2474
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1841 place count 902 transition count 2446
Iterating global reduction 3 with 14 rules applied. Total rules applied 1855 place count 902 transition count 2446
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1867 place count 890 transition count 2422
Iterating global reduction 3 with 12 rules applied. Total rules applied 1879 place count 890 transition count 2422
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1890 place count 879 transition count 2400
Iterating global reduction 3 with 11 rules applied. Total rules applied 1901 place count 879 transition count 2400
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1943 place count 837 transition count 2244
Iterating global reduction 3 with 42 rules applied. Total rules applied 1985 place count 837 transition count 2244
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 2039 place count 783 transition count 2028
Iterating global reduction 3 with 54 rules applied. Total rules applied 2093 place count 783 transition count 2028
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 2147 place count 729 transition count 1884
Iterating global reduction 3 with 54 rules applied. Total rules applied 2201 place count 729 transition count 1884
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 2254 place count 676 transition count 1778
Iterating global reduction 3 with 53 rules applied. Total rules applied 2307 place count 676 transition count 1778
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 2358 place count 625 transition count 1676
Iterating global reduction 3 with 51 rules applied. Total rules applied 2409 place count 625 transition count 1676
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 2460 place count 574 transition count 1574
Iterating global reduction 3 with 51 rules applied. Total rules applied 2511 place count 574 transition count 1574
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 2560 place count 525 transition count 1476
Iterating global reduction 3 with 49 rules applied. Total rules applied 2609 place count 525 transition count 1476
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 2627 place count 507 transition count 1440
Iterating global reduction 3 with 18 rules applied. Total rules applied 2645 place count 507 transition count 1440
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 2665 place count 507 transition count 1420
Applied a total of 2665 rules in 1542 ms. Remains 507 /1628 variables (removed 1121) and now considering 1420/5962 (removed 4542) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1551 ms. Remains : 507/1628 places, 1420/5962 transitions.
RANDOM walk for 40004 steps (8 resets) in 283 ms. (140 steps per ms) remains 2/3 properties
FORMULA FunctionPointer-PT-c032-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
[2026-05-25 08:58:09] [INFO ] Flow matrix only has 834 transitions (discarded 586 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4796841630746799297.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-994295557514445076.kers'
[2026-05-25 08:58:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4796841630746799297.kers, --Pflows, --basisKERS=/tmp/petrispot-output-994295557514445076.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 834 rows 507 cols 2444 entries
Finished phase 1 with 504 SingleSign rule and 0 generalized
[2026-05-25 08:58:09] [INFO ] Computed 3 invariants in 4 ms
Computed 3 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-994295557514445076.kers
Total runtime 5 ms.
[2026-05-25 08:58:09] [INFO ] State equation strengthened by 110 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 405/422 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/424 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 757/1181 variables, 424/427 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1181 variables, 108/535 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1181 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 114/1295 variables, 55/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1295 variables, 2/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1295 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 45/1340 variables, 27/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1340 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/1341 variables, 1/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1341 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1341 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1341/1341 variables, and 620 constraints, problems are : Problem set: 0 solved, 2 unsolved in 433 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 507/507 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 405/422 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/424 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 757/1181 variables, 424/427 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1181 variables, 108/535 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1181 variables, 1/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1181 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 114/1295 variables, 55/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1295 variables, 2/593 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1295 variables, 1/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1295 variables, 2/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1295 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 45/1340 variables, 27/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1340 variables, 1/624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1340 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/1341 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1341 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1341 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1341 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1341/1341 variables, and 626 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1460 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 507/507 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 1923ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA FunctionPointer-PT-c032-ReachabilityCardinality-2024-15 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 410 ms.
Support contains 16 out of 507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 1420/1420 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 505 transition count 1416
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 505 transition count 1416
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 505 transition count 1414
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 503 transition count 1410
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 503 transition count 1410
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 501 transition count 1406
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 501 transition count 1406
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 498 transition count 1394
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 498 transition count 1394
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 495 transition count 1388
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 495 transition count 1388
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 492 transition count 1382
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 492 transition count 1382
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 489 transition count 1376
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 489 transition count 1376
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 486 transition count 1370
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 486 transition count 1370
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 483 transition count 1364
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 483 transition count 1364
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 53 place count 480 transition count 1358
Iterating global reduction 1 with 3 rules applied. Total rules applied 56 place count 480 transition count 1358
Applied a total of 56 rules in 153 ms. Remains 480 /507 variables (removed 27) and now considering 1358/1420 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 480/507 places, 1358/1420 transitions.
RANDOM walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 437808 steps, run timeout after 3004 ms. (steps per millisecond=145 ) properties seen :0 out of 1
Probabilistic random walk after 437808 steps, saw 268462 distinct states, run finished after 3009 ms. (steps per millisecond=145 ) properties seen :0
[2026-05-25 08:58:14] [INFO ] Flow matrix only has 788 transitions (discarded 570 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5086752508612033211.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13559183190067747192.kers'
[2026-05-25 08:58:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5086752508612033211.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13559183190067747192.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 788 rows 480 cols 2316 entries
Finished phase 1 with 477 SingleSign rule and 0 generalized
[2026-05-25 08:58:14] [INFO ] Computed 3 invariants in 3 ms
Computed 3 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13559183190067747192.kers
Total runtime 4 ms.
[2026-05-25 08:58:14] [INFO ] State equation strengthened by 99 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 399/415 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/417 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 731/1148 variables, 417/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1148 variables, 97/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1148 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 91/1239 variables, 44/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1239 variables, 2/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1239 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 28/1267 variables, 18/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1267 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/1268 variables, 1/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1268 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1268 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1268/1268 variables, and 582 constraints, problems are : Problem set: 0 solved, 1 unsolved in 347 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 480/480 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 399/415 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/417 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 731/1148 variables, 417/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1148 variables, 97/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1148 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1148 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 91/1239 variables, 44/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1239 variables, 2/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1239 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1239 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 28/1267 variables, 18/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1267 variables, 6/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1267 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1268 variables, 1/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1268 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1268 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1268/1268 variables, and 590 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1076 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 480/480 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 1444ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 176 ms.
Support contains 16 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1358/1358 transitions.
Applied a total of 0 rules in 71 ms. Remains 480 /480 variables (removed 0) and now considering 1358/1358 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 480/480 places, 1358/1358 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1358/1358 transitions.
Applied a total of 0 rules in 56 ms. Remains 480 /480 variables (removed 0) and now considering 1358/1358 (removed 0) transitions.
[2026-05-25 08:58:16] [INFO ] Flow matrix only has 788 transitions (discarded 570 similar events)
[2026-05-25 08:58:16] [INFO ] Invariant cache hit.
[2026-05-25 08:58:17] [INFO ] Implicit Places using invariants in 364 ms returned []
[2026-05-25 08:58:17] [INFO ] Flow matrix only has 788 transitions (discarded 570 similar events)
[2026-05-25 08:58:17] [INFO ] Invariant cache hit.
[2026-05-25 08:58:17] [INFO ] State equation strengthened by 99 read => feed constraints.
[2026-05-25 08:58:18] [INFO ] Implicit Places using invariants and state equation in 1774 ms returned []
Implicit Place search using SMT with State Equation took 2151 ms to find 0 implicit places.
[2026-05-25 08:58:18] [INFO ] Redundant transitions in 91 ms returned []
Running 1356 sub problems to find dead transitions.
[2026-05-25 08:58:18] [INFO ] Flow matrix only has 788 transitions (discarded 570 similar events)
[2026-05-25 08:58:18] [INFO ] Invariant cache hit.
[2026-05-25 08:58:18] [INFO ] State equation strengthened by 99 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 480/1268 variables, and 4 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/480 constraints, ReadFeed: 0/99 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 3 (OVERLAPS) 788/1268 variables, 480/484 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1268 variables, 99/583 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1268/1268 variables, and 1939 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 31131 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 480/480 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63125ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 63132ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65464 ms. Remains : 480/480 places, 1358/1358 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 570 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 581 rules applied. Total rules applied 581 place count 480 transition count 777
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 592 place count 469 transition count 777
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 86 Pre rules applied. Total rules applied 592 place count 469 transition count 691
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 764 place count 383 transition count 691
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 2 with 262 rules applied. Total rules applied 1026 place count 252 transition count 560
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 1088 place count 190 transition count 436
Iterating global reduction 2 with 62 rules applied. Total rules applied 1150 place count 190 transition count 436
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1152 place count 190 transition count 434
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 1213 place count 129 transition count 312
Iterating global reduction 3 with 61 rules applied. Total rules applied 1274 place count 129 transition count 312
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 1334 place count 69 transition count 192
Iterating global reduction 3 with 60 rules applied. Total rules applied 1394 place count 69 transition count 192
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 3 with 56 rules applied. Total rules applied 1450 place count 69 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1452 place count 68 transition count 135
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 1462 place count 63 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 1479 place count 63 transition count 122
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1480 place count 62 transition count 121
Iterating global reduction 4 with 1 rules applied. Total rules applied 1481 place count 62 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1483 place count 62 transition count 119
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1484 place count 62 transition count 119
Applied a total of 1484 rules in 86 ms. Remains 62 /480 variables (removed 418) and now considering 119/1358 (removed 1239) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6820437330415289853.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-58960152034161198.kers'
[2026-05-25 08:59:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6820437330415289853.kers, --Pflows, --basisKERS=/tmp/petrispot-output-58960152034161198.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 119 rows 62 cols 374 entries
Finished phase 1 with 59 SingleSign rule and 0 generalized
[2026-05-25 08:59:22] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-58960152034161198.kers
Total runtime 5 ms.
[2026-05-25 08:59:22] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 08:59:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 08:59:22] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-25 08:59:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 08:59:22] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 08:59:22] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 08:59:22] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-25 08:59:22] [INFO ] Flatten gal took : 4 ms
[2026-05-25 08:59:22] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:59:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6133431871790229619.gal : 1 ms
[2026-05-25 08:59:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12275776327760829296.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6133431871790229619.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12275776327760829296.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality12275776327760829296.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 29
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :29 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 260
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :260 after 6431
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :6431 after 170543
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :170543 after 1.26203e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.26203e+07 after 6.49127e+15
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6.49127e+15 after 2.65047e+19
Detected timeout of ITS tools.
[2026-05-25 08:59:37] [INFO ] Flatten gal took : 4 ms
[2026-05-25 08:59:37] [INFO ] Applying decomposition
[2026-05-25 08:59:37] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1748469108520736964.txt' '-o' '/tmp/graph1748469108520736964.bin' '-w' '/tmp/graph1748469108520736964.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1748469108520736964.bin' '-l' '-1' '-v' '-w' '/tmp/graph1748469108520736964.weights' '-q' '0' '-e' '0.001'
[2026-05-25 08:59:37] [INFO ] Decomposing Gal with order
[2026-05-25 08:59:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 08:59:37] [INFO ] Removed a total of 90 redundant transitions.
[2026-05-25 08:59:37] [INFO ] Flatten gal took : 59 ms
[2026-05-25 08:59:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 4 ms.
[2026-05-25 08:59:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11710021231727002525.gal : 2 ms
[2026-05-25 08:59:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16129017954766867481.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11710021231727002525.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16129017954766867481.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality16129017954766867481.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 27
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :27 after 50
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :50 after 220
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :220 after 11437
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :11437 after 817186
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :817186 after 1.24404e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.24404e+08 after 3.31733e+15
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3.31733e+15 after 1.44949e+18
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.44949e+18 after 1.94145e+20
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30532 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 08:59:53] [INFO ] Flatten gal took : 199 ms
[2026-05-25 08:59:53] [INFO ] Applying decomposition
[2026-05-25 08:59:53] [INFO ] Flatten gal took : 148 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8922483111849595811.txt' '-o' '/tmp/graph8922483111849595811.bin' '-w' '/tmp/graph8922483111849595811.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8922483111849595811.bin' '-l' '-1' '-v' '-w' '/tmp/graph8922483111849595811.weights' '-q' '0' '-e' '0.001'
[2026-05-25 08:59:53] [INFO ] Decomposing Gal with order
[2026-05-25 08:59:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 08:59:55] [INFO ] Removed a total of 4595 redundant transitions.
[2026-05-25 08:59:55] [INFO ] Flatten gal took : 2009 ms
[2026-05-25 08:59:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 2401 labels/synchronizations in 306 ms.
[2026-05-25 08:59:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5833558338186342450.gal : 25 ms
[2026-05-25 08:59:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13539451888003891330.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5833558338186342450.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13539451888003891330.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality13539451888003891330.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 17
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :17 after 254
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :254 after 500
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :500 after 4076
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :4076 after 55430
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :55430 after 800429
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :800429 after 1.19381e+07
Detected timeout of ITS tools.
[2026-05-25 09:29:59] [INFO ] Flatten gal took : 304 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14721134931552069300
[2026-05-25 09:30:05] [INFO ] Applying decomposition
[2026-05-25 09:30:05] [INFO ] Computing symmetric may disable matrix : 1358 transitions.
[2026-05-25 09:30:06] [INFO ] Flatten gal took : 299 ms
[2026-05-25 09:30:06] [INFO ] Computation of Complete disable matrix. took 141 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:30:06] [INFO ] Computing symmetric may enable matrix : 1358 transitions.
[2026-05-25 09:30:06] [INFO ] Computation of Complete enable matrix. took 166 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11642368305498557690.txt' '-o' '/tmp/graph11642368305498557690.bin' '-w' '/tmp/graph11642368305498557690.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11642368305498557690.bin' '-l' '-1' '-v' '-w' '/tmp/graph11642368305498557690.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:30:07] [INFO ] Decomposing Gal with order
[2026-05-25 09:30:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:30:08] [INFO ] Removed a total of 1125 redundant transitions.
[2026-05-25 09:30:08] [INFO ] Flatten gal took : 1038 ms
[2026-05-25 09:30:08] [INFO ] Computing Do-Not-Accords matrix : 1358 transitions.
[2026-05-25 09:30:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 564 labels/synchronizations in 106 ms.
[2026-05-25 09:30:09] [INFO ] Computation of Completed DNA matrix. took 264 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:30:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17079990676550046853.gal : 19 ms
[2026-05-25 09:30:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10390318935618168251.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17079990676550046853.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10390318935618168251.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality10390318935618168251.prop.
[2026-05-25 09:30:09] [INFO ] Built C files in 3989ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14721134931552069300
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 29
Running compilation step : cd /tmp/ltsmin14721134931552069300;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :29 after 1336
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1336 after 404040
Compilation finished in 5765 ms.
Running link step : cd /tmp/ltsmin14721134931552069300;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 93 ms.
Running LTSmin : cd /tmp/ltsmin14721134931552069300;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'FunctionPointerPTc032ReachabilityCardinality202409==true'
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :404040 after 2.54131e+09
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2.54131e+09 after 1.49925e+15
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.49925e+15 after 3.64175e+23
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3.64175e+23 after 2.0335e+28
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.0335e+28 after 2.51259e+30
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.51259e+30 after 4.95028e+30
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.95028e+30 after 2.8496e+31
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.8496e+31 after 1.52636e+32
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.52636e+32 after 6.96539e+32
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :6.96539e+32 after 9.16214e+32
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :9.16214e+32 after 7.57607e+33

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="FunctionPointer-PT-c032"
export BK_EXAMINATION="ReachabilityCardinality"
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 FunctionPointer-PT-c032, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r146-tall-177961074000150"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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