About the Execution of ITS-Tools for FunctionPointer-PT-c128
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4610.808 | 3600000.00 | 5495749.00 | 40354.40 | ?FTTTTFTF?FFFFFF | 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-177961074000166.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-c128, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074000166
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.4K Mar 7 07:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 7 07:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 7 07:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 7 07:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 10:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 10:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 10:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 10:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 07:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Mar 7 07:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Mar 7 07:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 07:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:27 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-c128-ReachabilityCardinality-2024-00
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-01
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-02
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-03
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-04
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-05
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-06
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-07
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-08
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-09
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-10
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-11
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-12
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-13
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-14
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1779704438166
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-c128
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-25 10:20:39] [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 10:20:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 10:20:39] [INFO ] Load time of PNML (sax parser for PT used): 395 ms
[2026-05-25 10:20:39] [INFO ] Transformed 2826 places.
[2026-05-25 10:20:39] [INFO ] Transformed 8960 transitions.
[2026-05-25 10:20:39] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 523 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 47 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40063 steps (8 resets) in 3410 ms. (11 steps per ms) remains 8/10 properties
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (17 resets) in 201 ms. (198 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (11 resets) in 159 ms. (250 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (12 resets) in 138 ms. (287 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (13 resets) in 161 ms. (246 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (18 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (13 resets) in 152 ms. (261 steps per ms) remains 7/8 properties
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (16 resets) in 222 ms. (179 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (16 resets) in 136 ms. (292 steps per ms) remains 7/7 properties
[2026-05-25 10:20:41] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
[2026-05-25 10:20:41] [INFO ] Flatten gal took : 817 ms
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15516430238720729837.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1608148884161404202.kers'
[2026-05-25 10:20:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15516430238720729837.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1608148884161404202.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 5 ms.
// Phase 1: matrix 3540 rows 1627 cols 8708 entries
Finished phase 1 with 1624 SingleSign rule and 0 generalized
[2026-05-25 10:20:41] [INFO ] Computed 4 invariants in 20 ms
Computed 4 P flows in 24 ms.
Exported basis to /tmp/petrispot-output-1608148884161404202.kers
Total runtime 28 ms.
[2026-05-25 10:20:41] [INFO ] State equation strengthened by 479 read => feed constraints.
[2026-05-25 10:20:41] [INFO ] Flatten gal took : 265 ms
[2026-05-25 10:20:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality257829727391082331.gal : 88 ms
[2026-05-25 10:20:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4134139004277135427.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/ReachabilityCardinality257829727391082331.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4134139004277135427.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 ...327
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem FunctionPointer-PT-c128-ReachabilityCardinality-2024-10 is UNSAT
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 543/554 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/554 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/556 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/557 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Loading property file /tmp/ReachabilityCardinality4134139004277135427.prop.
At refinement iteration 7 (OVERLAPS) 1402/1959 variables, 557/561 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1959 variables, 400/961 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1959 variables, 0/961 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1179/3138 variables, 399/1360 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3138 variables, 79/1439 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3138 variables, 0/1439 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 733/3871 variables, 375/1814 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3871 variables, 0/1814 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 932/4803 variables, 188/2002 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4803 variables, 0/2002 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 365/5168 variables, 109/2111 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5168/5168 variables, and 2111 constraints, problems are : Problem set: 1 solved, 6 unsolved in 3464 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: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 381/391 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 674/1065 variables, 391/392 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1065 variables, 0/392 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 848/1913 variables, 39/431 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1913 variables, 1/432 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1913 variables, 1/433 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1913 variables, 322/755 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1913 variables, 6/761 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1913 variables, 0/761 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 157/2070 variables, 1/762 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2070 variables, 1/763 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2070 variables, 0/763 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 1236/3306 variables, 560/1323 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3306 variables, 157/1480 constraints. Problems are: Problem set: 1 solved, 6 unsolved
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 31
At refinement iteration 16 (INCLUDED_ONLY) 0/3306 variables, 1/1481 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3306 variables, 0/1481 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 971/4277 variables, 398/1879 constraints. Problems are: Problem set: 1 solved, 6 unsolved
SMT process timed out in 8712ms, After SMT, problems are : Problem set: 1 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :31 after 2059
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-15 FALSE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-11 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 8580 ms.
Support contains 7 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 1422 are kept as prefixes of interest. Removing 206 places using SCC suffix rule.11 ms
Discarding 206 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 378 transitions
Reduce isomorphic transitions removed 378 transitions.
Iterating post reduction 0 with 378 rules applied. Total rules applied 379 place count 1422 transition count 5584
Discarding 300 places :
Symmetric choice reduction at 1 with 300 rule applications. Total rules 679 place count 1122 transition count 3316
Iterating global reduction 1 with 300 rules applied. Total rules applied 979 place count 1122 transition count 3316
Ensure Unique test removed 372 transitions
Reduce isomorphic transitions removed 372 transitions.
Iterating post reduction 1 with 372 rules applied. Total rules applied 1351 place count 1122 transition count 2944
Discarding 156 places :
Symmetric choice reduction at 2 with 156 rule applications. Total rules 1507 place count 966 transition count 2632
Iterating global reduction 2 with 156 rules applied. Total rules applied 1663 place count 966 transition count 2632
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 1735 place count 966 transition count 2560
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1749 place count 952 transition count 2532
Iterating global reduction 3 with 14 rules applied. Total rules applied 1763 place count 952 transition count 2532
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1777 place count 938 transition count 2504
Iterating global reduction 3 with 14 rules applied. Total rules applied 1791 place count 938 transition count 2504
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1805 place count 924 transition count 2476
Iterating global reduction 3 with 14 rules applied. Total rules applied 1819 place count 924 transition count 2476
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1833 place count 910 transition count 2448
Iterating global reduction 3 with 14 rules applied. Total rules applied 1847 place count 910 transition count 2448
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1861 place count 896 transition count 2420
Iterating global reduction 3 with 14 rules applied. Total rules applied 1875 place count 896 transition count 2420
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1889 place count 882 transition count 2392
Iterating global reduction 3 with 14 rules applied. Total rules applied 1903 place count 882 transition count 2392
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1917 place count 868 transition count 2364
Iterating global reduction 3 with 14 rules applied. Total rules applied 1931 place count 868 transition count 2364
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 1990 place count 809 transition count 2142
Iterating global reduction 3 with 59 rules applied. Total rules applied 2049 place count 809 transition count 2142
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2107 place count 751 transition count 1910
Iterating global reduction 3 with 58 rules applied. Total rules applied 2165 place count 751 transition count 1910
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2223 place count 693 transition count 1780
Iterating global reduction 3 with 58 rules applied. Total rules applied 2281 place count 693 transition count 1780
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2339 place count 635 transition count 1664
Iterating global reduction 3 with 58 rules applied. Total rules applied 2397 place count 635 transition count 1664
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2455 place count 577 transition count 1548
Iterating global reduction 3 with 58 rules applied. Total rules applied 2513 place count 577 transition count 1548
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2571 place count 519 transition count 1432
Iterating global reduction 3 with 58 rules applied. Total rules applied 2629 place count 519 transition count 1432
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2687 place count 461 transition count 1316
Iterating global reduction 3 with 58 rules applied. Total rules applied 2745 place count 461 transition count 1316
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2752 place count 454 transition count 1302
Iterating global reduction 3 with 7 rules applied. Total rules applied 2759 place count 454 transition count 1302
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 2771 place count 454 transition count 1290
Applied a total of 2771 rules in 1102 ms. Remains 454 /1628 variables (removed 1174) and now considering 1290/5962 (removed 4672) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1110 ms. Remains : 454/1628 places, 1290/5962 transitions.
RANDOM walk for 40001 steps (8 resets) in 228 ms. (174 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 228095 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 4
Probabilistic random walk after 228095 steps, saw 139880 distinct states, run finished after 3006 ms. (steps per millisecond=75 ) properties seen :0
[2026-05-25 10:21:02] [INFO ] Flow matrix only has 743 transitions (discarded 547 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15863049048805609066.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5972521325339207502.kers'
[2026-05-25 10:21:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15863049048805609066.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5972521325339207502.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 743 rows 454 cols 2202 entries
Finished phase 1 with 451 SingleSign rule and 1 generalized
[2026-05-25 10:21:02] [INFO ] Computed 2 invariants in 3 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5972521325339207502.kers
Total runtime 4 ms.
[2026-05-25 10:21:02] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 383/390 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 657/1047 variables, 390/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1047 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 77/1124 variables, 18/409 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1124 variables, 82/491 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1124 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 13/1137 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1137 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1137 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 52/1189 variables, 37/530 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1189 variables, 8/538 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1189 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 8/1197 variables, 8/546 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1197 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/1197 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1197/1197 variables, and 546 constraints, problems are : Problem set: 0 solved, 4 unsolved in 641 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 454/454 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 383/390 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 657/1047 variables, 390/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1047 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 77/1124 variables, 18/409 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1124 variables, 82/491 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1124 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1124 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 13/1137 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1137 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1137 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 52/1189 variables, 37/534 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1189 variables, 8/542 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1189 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 8/1197 variables, 8/550 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1197 variables, 4/554 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1197 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/1197 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1197/1197 variables, and 554 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1734 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 454/454 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 2399ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-02 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 8653 ms.
Support contains 6 out of 454 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 454/454 places, 1290/1290 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 1286
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 1286
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 452 transition count 1284
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 452 transition count 1284
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 451 transition count 1282
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 451 transition count 1282
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 450 transition count 1280
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 450 transition count 1280
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 449 transition count 1278
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 449 transition count 1278
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 448 transition count 1276
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 448 transition count 1276
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 447 transition count 1274
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 447 transition count 1274
Applied a total of 14 rules in 118 ms. Remains 447 /454 variables (removed 7) and now considering 1274/1290 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 447/454 places, 1274/1290 transitions.
RANDOM walk for 40014 steps (8 resets) in 194 ms. (205 steps per ms) remains 2/3 properties
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
[2026-05-25 10:21:14] [INFO ] Flow matrix only has 731 transitions (discarded 543 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9332396739529041249.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15942976104542434607.kers'
[2026-05-25 10:21:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9332396739529041249.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15942976104542434607.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 731 rows 447 cols 2168 entries
Finished phase 1 with 444 SingleSign rule and 1 generalized
[2026-05-25 10:21:14] [INFO ] Computed 2 invariants in 3 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-15942976104542434607.kers
Total runtime 4 ms.
[2026-05-25 10:21:14] [INFO ] State equation strengthened by 87 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 235/246 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 795/1041 variables, 363/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1041 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1041 variables, 87/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1041 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 62/1103 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1103 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 73/1176 variables, 71/534 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1176 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/1178 variables, 2/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1178 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1178 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1178/1178 variables, and 536 constraints, problems are : Problem set: 0 solved, 2 unsolved in 382 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 447/447 constraints, ReadFeed: 87/87 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 235/246 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 795/1041 variables, 363/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1041 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1041 variables, 87/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1041 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1041 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 62/1103 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1103 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 73/1176 variables, 71/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1176 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1176 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/1178 variables, 2/539 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1178 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1178 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1178/1178 variables, and 539 constraints, problems are : Problem set: 0 solved, 2 unsolved in 827 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 447/447 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1237ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1718 ms.
Support contains 3 out of 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1274/1274 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 445 transition count 1270
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 445 transition count 1270
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 443 transition count 1266
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 443 transition count 1266
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 441 transition count 1260
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 441 transition count 1260
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 439 transition count 1256
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 439 transition count 1256
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 437 transition count 1252
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 437 transition count 1252
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 435 transition count 1248
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 435 transition count 1248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 434 transition count 1246
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 434 transition count 1246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 433 transition count 1244
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 433 transition count 1244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 432 transition count 1242
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 432 transition count 1242
Applied a total of 30 rules in 134 ms. Remains 432 /447 variables (removed 15) and now considering 1242/1274 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 432/447 places, 1242/1274 transitions.
RANDOM walk for 40000 steps (8 resets) in 181 ms. (219 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 321271 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :0 out of 2
Probabilistic random walk after 321271 steps, saw 197011 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
[2026-05-25 10:21:20] [INFO ] Flow matrix only has 707 transitions (discarded 535 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8030554155623323199.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17973322298933884193.kers'
[2026-05-25 10:21:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8030554155623323199.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17973322298933884193.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 707 rows 432 cols 2100 entries
Finished phase 1 with 429 SingleSign rule and 1 generalized
[2026-05-25 10:21:20] [INFO ] Computed 2 invariants in 3 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17973322298933884193.kers
Total runtime 3 ms.
[2026-05-25 10:21:20] [INFO ] State equation strengthened by 81 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 228/239 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 769/1008 variables, 352/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1008 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1008 variables, 81/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1008 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 62/1070 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1070 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 68/1138 variables, 68/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1138 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/1139 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1139 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1139 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1139/1139 variables, and 515 constraints, problems are : Problem set: 0 solved, 2 unsolved in 445 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 432/432 constraints, ReadFeed: 81/81 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 228/239 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 769/1008 variables, 352/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1008 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1008 variables, 81/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1008 variables, 2/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1008 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 62/1070 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1070 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 68/1138 variables, 68/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1138 variables, 1/517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1138 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/1139 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1139 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1139 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1139/1139 variables, and 518 constraints, problems are : Problem set: 0 solved, 2 unsolved in 829 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 432/432 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1291ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2397 ms.
Support contains 3 out of 432 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 432/432 places, 1242/1242 transitions.
Applied a total of 0 rules in 53 ms. Remains 432 /432 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 432/432 places, 1242/1242 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 432/432 places, 1242/1242 transitions.
Applied a total of 0 rules in 53 ms. Remains 432 /432 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2026-05-25 10:21:24] [INFO ] Flow matrix only has 707 transitions (discarded 535 similar events)
[2026-05-25 10:21:24] [INFO ] Invariant cache hit.
[2026-05-25 10:21:24] [INFO ] Implicit Places using invariants in 365 ms returned []
[2026-05-25 10:21:24] [INFO ] Flow matrix only has 707 transitions (discarded 535 similar events)
[2026-05-25 10:21:24] [INFO ] Invariant cache hit.
[2026-05-25 10:21:24] [INFO ] State equation strengthened by 81 read => feed constraints.
[2026-05-25 10:21:26] [INFO ] Implicit Places using invariants and state equation in 1514 ms returned []
Implicit Place search using SMT with State Equation took 1896 ms to find 0 implicit places.
[2026-05-25 10:21:26] [INFO ] Redundant transitions in 98 ms returned []
Running 1240 sub problems to find dead transitions.
[2026-05-25 10:21:26] [INFO ] Flow matrix only has 707 transitions (discarded 535 similar events)
[2026-05-25 10:21:26] [INFO ] Invariant cache hit.
[2026-05-25 10:21:26] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/432 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 707/1139 variables, 432/434 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
SMT process timed out in 31736ms, After SMT, problems are : Problem set: 0 solved, 1240 unsolved
Search for dead transitions found 0 dead transitions in 31745ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33826 ms. Remains : 432/432 places, 1242/1242 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 535 transitions
Reduce isomorphic transitions removed 535 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 545 rules applied. Total rules applied 545 place count 432 transition count 697
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 556 place count 422 transition count 696
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 557 place count 421 transition count 696
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 75 Pre rules applied. Total rules applied 557 place count 421 transition count 621
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 707 place count 346 transition count 621
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 963 place count 218 transition count 493
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 1027 place count 154 transition count 365
Iterating global reduction 3 with 64 rules applied. Total rules applied 1091 place count 154 transition count 365
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1093 place count 154 transition count 363
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1156 place count 91 transition count 237
Iterating global reduction 4 with 63 rules applied. Total rules applied 1219 place count 91 transition count 237
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1282 place count 28 transition count 111
Iterating global reduction 4 with 63 rules applied. Total rules applied 1345 place count 28 transition count 111
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1408 place count 28 transition count 48
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1408 place count 28 transition count 47
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1410 place count 27 transition count 47
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 5 with 2 rules applied. Total rules applied 1412 place count 26 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1414 place count 25 transition count 46
Applied a total of 1414 rules in 59 ms. Remains 25 /432 variables (removed 407) and now considering 46/1242 (removed 1196) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12280589378790509182.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11086498447298826215.kers'
[2026-05-25 10:21:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12280589378790509182.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11086498447298826215.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 46 rows 25 cols 146 entries
Finished phase 1 with 22 SingleSign rule and 1 generalized
[2026-05-25 10:21:58] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11086498447298826215.kers
Total runtime 0 ms.
[2026-05-25 10:21:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 10:21:58] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 10:21:58] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-25 10:21:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 10:21:58] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 10:21:58] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-25 10:21:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 10:21:58] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 10:21:58] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 10:21:58] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-25 10:21:58] [INFO ] Flatten gal took : 2 ms
[2026-05-25 10:21:58] [INFO ] Flatten gal took : 2 ms
[2026-05-25 10:21:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14546950682180319550.gal : 1 ms
[2026-05-25 10:21:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality803698869523975260.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/ReachabilityCardinality14546950682180319550.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality803698869523975260.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality803698869523975260.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :69 after 759
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :759 after 116100
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :116100 after 4.05802e+09
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :4.05802e+09 after 3.61374e+10
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3.61374e+10 after 1.93728e+11
Detected timeout of ITS tools.
[2026-05-25 10:22:13] [INFO ] Flatten gal took : 1 ms
[2026-05-25 10:22:13] [INFO ] Applying decomposition
[2026-05-25 10:22:13] [INFO ] Flatten gal took : 1 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/graph16016889044658622091.txt' '-o' '/tmp/graph16016889044658622091.bin' '-w' '/tmp/graph16016889044658622091.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16016889044658622091.bin' '-l' '-1' '-v' '-w' '/tmp/graph16016889044658622091.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:22:13] [INFO ] Decomposing Gal with order
[2026-05-25 10:22:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:22:13] [INFO ] Removed a total of 51 redundant transitions.
[2026-05-25 10:22:13] [INFO ] Flatten gal took : 46 ms
[2026-05-25 10:22:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2026-05-25 10:22:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5087847135823633059.gal : 1 ms
[2026-05-25 10:22:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13854650519808239221.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/ReachabilityCardinality5087847135823633059.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13854650519808239221.prop' '--nowitness'
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 ...308
Loading property file /tmp/ReachabilityCardinality13854650519808239221.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :69 after 759
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30350 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 10:22:28] [INFO ] Flatten gal took : 128 ms
[2026-05-25 10:22:28] [INFO ] Applying decomposition
[2026-05-25 10:22:28] [INFO ] Flatten gal took : 134 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/graph2849256998211316134.txt' '-o' '/tmp/graph2849256998211316134.bin' '-w' '/tmp/graph2849256998211316134.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2849256998211316134.bin' '-l' '-1' '-v' '-w' '/tmp/graph2849256998211316134.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:22:29] [INFO ] Decomposing Gal with order
[2026-05-25 10:22:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:22:30] [INFO ] Removed a total of 7050 redundant transitions.
[2026-05-25 10:22:30] [INFO ] Flatten gal took : 1150 ms
[2026-05-25 10:22:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 3796 labels/synchronizations in 358 ms.
[2026-05-25 10:22:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8876323489836993964.gal : 35 ms
[2026-05-25 10:22:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7250170639648588189.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/ReachabilityCardinality8876323489836993964.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7250170639648588189.prop' '--nowitness'
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 ...307
Loading property file /tmp/ReachabilityCardinality7250170639648588189.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 30
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :30 after 72
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :72 after 176
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :176 after 420
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :420 after 877
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :877 after 1866
Detected timeout of ITS tools.
[2026-05-25 10:52:31] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4585921843159702211
[2026-05-25 10:52:31] [INFO ] Computing symmetric may disable matrix : 1242 transitions.
[2026-05-25 10:52:31] [INFO ] Applying decomposition
[2026-05-25 10:52:31] [INFO ] Flatten gal took : 18 ms
[2026-05-25 10:52:31] [INFO ] Computation of Complete disable matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:52:31] [INFO ] Computing symmetric may enable matrix : 1242 transitions.
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/graph10286577650981036279.txt' '-o' '/tmp/graph10286577650981036279.bin' '-w' '/tmp/graph10286577650981036279.weights'
[2026-05-25 10:52:31] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10286577650981036279.bin' '-l' '-1' '-v' '-w' '/tmp/graph10286577650981036279.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:52:31] [INFO ] Decomposing Gal with order
[2026-05-25 10:52:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:52:31] [INFO ] Removed a total of 2121 redundant transitions.
[2026-05-25 10:52:31] [INFO ] Flatten gal took : 89 ms
[2026-05-25 10:52:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 857 labels/synchronizations in 38 ms.
[2026-05-25 10:52:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9387240798157221969.gal : 6 ms
[2026-05-25 10:52:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5372841868573724046.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/ReachabilityCardinality9387240798157221969.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5372841868573724046.prop' '--nowitness'
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 ...307
Loading property file /tmp/ReachabilityCardinality5372841868573724046.prop.
[2026-05-25 10:52:31] [INFO ] Computing Do-Not-Accords matrix : 1242 transitions.
[2026-05-25 10:52:31] [INFO ] Computation of Completed DNA matrix. took 99 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:52:31] [INFO ] Built C files in 720ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4585921843159702211
Running compilation step : cd /tmp/ltsmin4585921843159702211;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' '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'
Compilation finished in 5016 ms.
Running link step : cd /tmp/ltsmin4585921843159702211;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin4585921843159702211;'/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' 'FunctionPointerPTc128ReachabilityCardinality202400==true'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin4585921843159702211;'/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' 'FunctionPointerPTc128ReachabilityCardinality202400==true'
Running LTSmin : cd /tmp/ltsmin4585921843159702211;'/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' 'FunctionPointerPTc128ReachabilityCardinality202409==true'
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-c128"
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-c128, 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-177961074000166"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c128.tgz
mv FunctionPointer-PT-c128 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 '
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 ;