About the Execution of ITS-Tools for BugTracking-PT-q3m256
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16203.852 | 3600000.00 | 3128699.00 | 347085.90 | ?TTF?FTFT?T?TFT? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).

Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r034-tall-177946841900377.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is BugTracking-PT-q3m256, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946841900377
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.2K Mar 5 17:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 5 17:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 5 17:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 17:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 15 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 5 17:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Mar 5 17:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Mar 5 17:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 5 17:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 15 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 16M Mar 3 18:30 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BugTracking-PT-q3m256-CTLCardinality-2024-00
FORMULA_NAME BugTracking-PT-q3m256-CTLCardinality-2024-01
FORMULA_NAME BugTracking-PT-q3m256-CTLCardinality-2024-02
FORMULA_NAME BugTracking-PT-q3m256-CTLCardinality-2024-03
FORMULA_NAME BugTracking-PT-q3m256-CTLCardinality-2024-04
FORMULA_NAME BugTracking-PT-q3m256-CTLCardinality-2024-05
FORMULA_NAME BugTracking-PT-q3m256-CTLCardinality-2024-06
FORMULA_NAME BugTracking-PT-q3m256-CTLCardinality-2024-07
FORMULA_NAME BugTracking-PT-q3m256-CTLCardinality-2024-08
FORMULA_NAME BugTracking-PT-q3m256-CTLCardinality-2024-09
FORMULA_NAME BugTracking-PT-q3m256-CTLCardinality-2024-10
FORMULA_NAME BugTracking-PT-q3m256-CTLCardinality-2024-11
FORMULA_NAME BugTracking-PT-q3m256-CTLCardinality-2024-12
FORMULA_NAME BugTracking-PT-q3m256-CTLCardinality-2024-13
FORMULA_NAME BugTracking-PT-q3m256-CTLCardinality-2024-14
FORMULA_NAME BugTracking-PT-q3m256-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1779591309931
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m256
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-24 02:55:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 02:55:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 02:55:11] [INFO ] Load time of PNML (sax parser for PT used): 822 ms
[2026-05-24 02:55:11] [INFO ] Transformed 754 places.
[2026-05-24 02:55:12] [INFO ] Transformed 27370 transitions.
[2026-05-24 02:55:12] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1008 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Deduced a syphon composed of 514 places in 118 ms
Reduce places removed 514 places and 24601 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q3m256-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 238 transition count 2769
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 237 transition count 2750
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 237 transition count 2750
Applied a total of 4 rules in 71 ms. Remains 237 /240 variables (removed 3) and now considering 2750/2769 (removed 19) transitions.
[2026-05-24 02:55:12] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12944045312799140126.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15310876805625516885.kers'
[2026-05-24 02:55:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12944045312799140126.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15310876805625516885.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2626 rows 237 cols 12413 entries
Finished phase 1 with 229 SingleSign rule and 0 generalized
[2026-05-24 02:55:12] [INFO ] Computed 8 invariants in 7 ms
Computed 8 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-15310876805625516885.kers
Total runtime 10 ms.
[2026-05-24 02:55:13] [INFO ] Implicit Places using invariants in 613 ms returned []
[2026-05-24 02:55:13] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2026-05-24 02:55:13] [INFO ] Invariant cache hit.
[2026-05-24 02:55:13] [INFO ] State equation strengthened by 240 read => feed constraints.
[2026-05-24 02:55:16] [INFO ] Implicit Places using invariants and state equation in 3355 ms returned []
Implicit Place search using SMT with State Equation took 4004 ms to find 0 implicit places.
Running 2748 sub problems to find dead transitions.
[2026-05-24 02:55:16] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2026-05-24 02:55:16] [INFO ] Invariant cache hit.
[2026-05-24 02:55:16] [INFO ] State equation strengthened by 240 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2748 unsolved
Problem TDEAD1005 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/2863 variables, and 12 constraints, problems are : Problem set: 14 solved, 2734 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/237 constraints, ReadFeed: 0/240 constraints, PredecessorRefiner: 2748/1219 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 14 solved, 2734 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 8/8 constraints. Problems are: Problem set: 14 solved, 2734 unsolved
Problem TDEAD2310 is UNSAT
Problem TDEAD2318 is UNSAT
Problem TDEAD2329 is UNSAT
Problem TDEAD2330 is UNSAT
Problem TDEAD2356 is UNSAT
Problem TDEAD2364 is UNSAT
Problem TDEAD2375 is UNSAT
Problem TDEAD2376 is UNSAT
Problem TDEAD2379 is UNSAT
Problem TDEAD2380 is UNSAT
Problem TDEAD2381 is UNSAT
Problem TDEAD2382 is UNSAT
Problem TDEAD2383 is UNSAT
Problem TDEAD2384 is UNSAT
Problem TDEAD2385 is UNSAT
Problem TDEAD2386 is UNSAT
Problem TDEAD2387 is UNSAT
Problem TDEAD2391 is UNSAT
Problem TDEAD2392 is UNSAT
Problem TDEAD2393 is UNSAT
Problem TDEAD2394 is UNSAT
Problem TDEAD2395 is UNSAT
Problem TDEAD2396 is UNSAT
Problem TDEAD2397 is UNSAT
Problem TDEAD2398 is UNSAT
Problem TDEAD2399 is UNSAT
Problem TDEAD2400 is UNSAT
Problem TDEAD2401 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 4/12 constraints. Problems are: Problem set: 42 solved, 2706 unsolved
Problem TDEAD2319 is UNSAT
Problem TDEAD2333 is UNSAT
Problem TDEAD2334 is UNSAT
Problem TDEAD2335 is UNSAT
Problem TDEAD2336 is UNSAT
Problem TDEAD2337 is UNSAT
Problem TDEAD2338 is UNSAT
Problem TDEAD2339 is UNSAT
Problem TDEAD2340 is UNSAT
Problem TDEAD2341 is UNSAT
Problem TDEAD2342 is UNSAT
Problem TDEAD2343 is UNSAT
Problem TDEAD2344 is UNSAT
Problem TDEAD2345 is UNSAT
Problem TDEAD2346 is UNSAT
Problem TDEAD2347 is UNSAT
Problem TDEAD2348 is UNSAT
Problem TDEAD2349 is UNSAT
Problem TDEAD2350 is UNSAT
Problem TDEAD2351 is UNSAT
Problem TDEAD2352 is UNSAT
Problem TDEAD2365 is UNSAT
Problem TDEAD2674 is UNSAT
Problem TDEAD2675 is UNSAT
Problem TDEAD2676 is UNSAT
Problem TDEAD2677 is UNSAT
Problem TDEAD2678 is UNSAT
Problem TDEAD2679 is UNSAT
Problem TDEAD2680 is UNSAT
Problem TDEAD2681 is UNSAT
Problem TDEAD2682 is UNSAT
Problem TDEAD2683 is UNSAT
Problem TDEAD2684 is UNSAT
Problem TDEAD2685 is UNSAT
Problem TDEAD2686 is UNSAT
Problem TDEAD2687 is UNSAT
Problem TDEAD2688 is UNSAT
Problem TDEAD2691 is UNSAT
Problem TDEAD2692 is UNSAT
Problem TDEAD2693 is UNSAT
Problem TDEAD2694 is UNSAT
Problem TDEAD2695 is UNSAT
Problem TDEAD2696 is UNSAT
Problem TDEAD2697 is UNSAT
Problem TDEAD2698 is UNSAT
Problem TDEAD2699 is UNSAT
Problem TDEAD2700 is UNSAT
Problem TDEAD2701 is UNSAT
Problem TDEAD2702 is UNSAT
Problem TDEAD2703 is UNSAT
Problem TDEAD2704 is UNSAT
Problem TDEAD2705 is UNSAT
Problem TDEAD2708 is UNSAT
Problem TDEAD2709 is UNSAT
Problem TDEAD2710 is UNSAT
Problem TDEAD2711 is UNSAT
Problem TDEAD2712 is UNSAT
Problem TDEAD2713 is UNSAT
Problem TDEAD2714 is UNSAT
Problem TDEAD2715 is UNSAT
Problem TDEAD2718 is UNSAT
Problem TDEAD2719 is UNSAT
Problem TDEAD2720 is UNSAT
Problem TDEAD2721 is UNSAT
Problem TDEAD2722 is UNSAT
Problem TDEAD2723 is UNSAT
Problem TDEAD2724 is UNSAT
Problem TDEAD2725 is UNSAT
Problem TDEAD2726 is UNSAT
Problem TDEAD2729 is UNSAT
Problem TDEAD2730 is UNSAT
Problem TDEAD2731 is UNSAT
Problem TDEAD2732 is UNSAT
Problem TDEAD2733 is UNSAT
Problem TDEAD2734 is UNSAT
Problem TDEAD2735 is UNSAT
Problem TDEAD2736 is UNSAT
Problem TDEAD2737 is UNSAT
Problem TDEAD2738 is UNSAT
Problem TDEAD2739 is UNSAT
Problem TDEAD2740 is UNSAT
Problem TDEAD2741 is UNSAT
Problem TDEAD2742 is UNSAT
Problem TDEAD2743 is UNSAT
Problem TDEAD2744 is UNSAT
Problem TDEAD2745 is UNSAT
Problem TDEAD2746 is UNSAT
Problem TDEAD2747 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 10/22 constraints. Problems are: Problem set: 130 solved, 2618 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 236/2863 variables, and 22 constraints, problems are : Problem set: 130 solved, 2618 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/237 constraints, ReadFeed: 0/240 constraints, PredecessorRefiner: 1529/1219 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64671ms problems are : Problem set: 130 solved, 2618 unsolved
Search for dead transitions found 130 dead transitions in 64705ms
Found 130 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 130 transitions
Dead transitions reduction (with SMT) removed 130 transitions
Starting structural reductions in LTL mode, iteration 1 : 237/240 places, 2620/2769 transitions.
Reduce places removed 32 places and 829 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 205 transition count 1791
Reduce places removed 20 places and 281 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 52 place count 185 transition count 1510
Reduce places removed 12 places and 167 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 64 place count 173 transition count 1343
Reduce places removed 4 places and 114 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 68 place count 169 transition count 1229
Reduce places removed 1 places and 17 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 69 place count 168 transition count 1212
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 70 place count 167 transition count 1193
Deduced a syphon composed of 26 places in 4 ms
Reduce places removed 14 places and 266 transitions.
Iterating global reduction 5 with 15 rules applied. Total rules applied 85 place count 153 transition count 927
Deduced a syphon composed of 12 places in 2 ms
Applied a total of 85 rules in 27 ms. Remains 153 /237 variables (removed 84) and now considering 927/2620 (removed 1693) transitions.
[2026-05-24 02:56:21] [INFO ] Flow matrix only has 883 transitions (discarded 44 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6044180648909025169.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-943276294764061112.kers'
[2026-05-24 02:56:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6044180648909025169.kers, --Pflows, --basisKERS=/tmp/petrispot-output-943276294764061112.kers]
Culling trivial invariants: removing 12 columns.
Culled 12 columns in 1 ms.
// Phase 1: matrix 883 rows 141 cols 4053 entries
Finished phase 1 with 133 SingleSign rule and 0 generalized
[2026-05-24 02:56:21] [INFO ] Computed 20 invariants in 5 ms
Computed 20 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-943276294764061112.kers
Total runtime 6 ms.
[2026-05-24 02:56:21] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-24 02:56:21] [INFO ] Flow matrix only has 883 transitions (discarded 44 similar events)
[2026-05-24 02:56:21] [INFO ] Invariant cache hit.
[2026-05-24 02:56:21] [INFO ] State equation strengthened by 115 read => feed constraints.
[2026-05-24 02:56:22] [INFO ] Implicit Places using invariants and state equation in 648 ms returned []
Implicit Place search using SMT with State Equation took 788 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 153/240 places, 927/2769 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69655 ms. Remains : 153/240 places, 927/2769 transitions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 927/927 transitions.
Deduced a syphon composed of 12 places in 2 ms
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 927/927 (removed 0) transitions.
[2026-05-24 02:56:22] [INFO ] Flow matrix only has 883 transitions (discarded 44 similar events)
[2026-05-24 02:56:22] [INFO ] Invariant cache hit.
[2026-05-24 02:56:22] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-05-24 02:56:22] [INFO ] Flow matrix only has 883 transitions (discarded 44 similar events)
[2026-05-24 02:56:22] [INFO ] Invariant cache hit.
[2026-05-24 02:56:22] [INFO ] State equation strengthened by 115 read => feed constraints.
[2026-05-24 02:56:22] [INFO ] Implicit Places using invariants and state equation in 650 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
Running 925 sub problems to find dead transitions.
[2026-05-24 02:56:22] [INFO ] Flow matrix only has 883 transitions (discarded 44 similar events)
[2026-05-24 02:56:22] [INFO ] Invariant cache hit.
[2026-05-24 02:56:22] [INFO ] State equation strengthened by 115 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 925 unsolved
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 2/10 constraints. Problems are: Problem set: 147 solved, 778 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/10 constraints. Problems are: Problem set: 147 solved, 778 unsolved
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
At refinement iteration 3 (OVERLAPS) 883/1023 variables, 140/150 constraints. Problems are: Problem set: 151 solved, 774 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1023 variables, 115/265 constraints. Problems are: Problem set: 151 solved, 774 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1023 variables, 0/265 constraints. Problems are: Problem set: 151 solved, 774 unsolved
SMT process timed out in 30835ms, After SMT, problems are : Problem set: 151 solved, 774 unsolved
Search for dead transitions found 151 dead transitions in 30840ms
Found 151 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 151 transitions
Dead transitions reduction (with SMT) removed 151 transitions
Starting structural reductions in LTL mode, iteration 1 : 153/153 places, 776/927 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 144 transition count 746
Deduced a syphon composed of 12 places in 1 ms
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 144 transition count 746
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 138 transition count 710
Deduced a syphon composed of 12 places in 1 ms
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 138 transition count 710
Deduced a syphon composed of 12 places in 1 ms
Applied a total of 30 rules in 16 ms. Remains 138 /153 variables (removed 15) and now considering 710/776 (removed 66) transitions.
[2026-05-24 02:56:53] [INFO ] Flow matrix only has 656 transitions (discarded 54 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15145445636472008842.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14200064370835826435.kers'
[2026-05-24 02:56:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15145445636472008842.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14200064370835826435.kers]
Culling trivial invariants: removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 656 rows 126 cols 2995 entries
Finished phase 1 with 114 SingleSign rule and 3 generalized
[2026-05-24 02:56:53] [INFO ] Computed 21 invariants in 2 ms
Computed 21 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14200064370835826435.kers
Total runtime 3 ms.
[2026-05-24 02:56:53] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-24 02:56:53] [INFO ] Flow matrix only has 656 transitions (discarded 54 similar events)
[2026-05-24 02:56:53] [INFO ] Invariant cache hit.
[2026-05-24 02:56:53] [INFO ] State equation strengthened by 89 read => feed constraints.
[2026-05-24 02:56:54] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 138/153 places, 710/927 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32208 ms. Remains : 138/153 places, 710/927 transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Support contains 6 out of 126 places after structural reductions.
FORMULA BugTracking-PT-q3m256-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 02:56:54] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2026-05-24 02:56:54] [INFO ] Flatten gal took : 92 ms
[2026-05-24 02:56:54] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BugTracking-PT-q3m256-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 02:56:54] [INFO ] Flatten gal took : 53 ms
[2026-05-24 02:56:54] [INFO ] Input system was already deterministic with 710 transitions.
Support contains 4 out of 126 places (down from 6) after GAL structural reductions.
FORMULA BugTracking-PT-q3m256-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40196 steps (18 resets) in 875 ms. (45 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 524 ms. (76 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
[2026-05-24 02:56:55] [INFO ] Flow matrix only has 656 transitions (discarded 54 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16146756211903067226.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6725596190879927384.kers'
[2026-05-24 02:56:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16146756211903067226.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6725596190879927384.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 656 rows 126 cols 2995 entries
Finished phase 1 with 114 SingleSign rule and 3 generalized
[2026-05-24 02:56:55] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6725596190879927384.kers
Total runtime 3 ms.
[2026-05-24 02:56:55] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Real declared 25/782 variables, and 2 constraints, problems are : Problem set: 2 solved, 0 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 2/8 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/126 constraints, ReadFeed: 0/89 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 4 simplifications.
[2026-05-24 02:56:55] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-24 02:56:55] [INFO ] Flatten gal took : 39 ms
FORMULA BugTracking-PT-q3m256-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 02:56:55] [INFO ] Flatten gal took : 36 ms
[2026-05-24 02:56:55] [INFO ] Input system was already deterministic with 710 transitions.
Computed a total of 4 stabilizing places and 28 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 710/710 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 123 transition count 681
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 681
Applied a total of 6 rules in 6 ms. Remains 123 /126 variables (removed 3) and now considering 681/710 (removed 29) transitions.
[2026-05-24 02:56:55] [INFO ] Flow matrix only has 625 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15080860736372416811.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3767583590558288451.kers'
[2026-05-24 02:56:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15080860736372416811.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3767583590558288451.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 625 rows 123 cols 2850 entries
Finished phase 1 with 111 SingleSign rule and 3 generalized
[2026-05-24 02:56:55] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3767583590558288451.kers
Total runtime 4 ms.
[2026-05-24 02:56:55] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-05-24 02:56:55] [INFO ] Flow matrix only has 625 transitions (discarded 56 similar events)
[2026-05-24 02:56:55] [INFO ] Invariant cache hit.
[2026-05-24 02:56:55] [INFO ] State equation strengthened by 85 read => feed constraints.
[2026-05-24 02:56:55] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
Running 679 sub problems to find dead transitions.
[2026-05-24 02:56:55] [INFO ] Flow matrix only has 625 transitions (discarded 56 similar events)
[2026-05-24 02:56:55] [INFO ] Invariant cache hit.
[2026-05-24 02:56:55] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 4 (OVERLAPS) 625/747 variables, 122/132 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/747 variables, 85/217 constraints. Problems are: Problem set: 0 solved, 679 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/747 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 7 (OVERLAPS) 1/748 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/748 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 679 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 748/748 variables, and 218 constraints, problems are : Problem set: 0 solved, 679 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 679/679 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 679 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 4 (OVERLAPS) 625/747 variables, 122/132 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/747 variables, 85/217 constraints. Problems are: Problem set: 0 solved, 679 unsolved
Problem TDEAD537 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/747 variables, 582/799 constraints. Problems are: Problem set: 39 solved, 640 unsolved
Problem TDEAD558 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD618 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/747 variables, 7/806 constraints. Problems are: Problem set: 65 solved, 614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 747/748 variables, and 806 constraints, problems are : Problem set: 65 solved, 614 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/123 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 582/679 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60517ms problems are : Problem set: 65 solved, 614 unsolved
Search for dead transitions found 65 dead transitions in 60521ms
Found 65 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 65 transitions
Dead transitions reduction (with SMT) removed 65 transitions
Starting structural reductions in LTL mode, iteration 1 : 123/126 places, 616/710 transitions.
Reduce places removed 10 places and 154 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 113 transition count 462
Reduce places removed 6 places and 55 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 107 transition count 407
Reduce places removed 2 places and 18 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 105 transition count 389
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 20 place count 103 transition count 373
Reduce places removed 1 places and 14 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 21 place count 102 transition count 359
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 23 place count 100 transition count 341
Iterating global reduction 5 with 2 rules applied. Total rules applied 25 place count 100 transition count 341
Applied a total of 25 rules in 12 ms. Remains 100 /123 variables (removed 23) and now considering 341/616 (removed 275) transitions.
[2026-05-24 02:57:56] [INFO ] Flow matrix only has 326 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10715549539901798109.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16320972205595537752.kers'
[2026-05-24 02:57:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10715549539901798109.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16320972205595537752.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 326 rows 100 cols 1448 entries
Finished phase 1 with 88 SingleSign rule and 3 generalized
[2026-05-24 02:57:56] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16320972205595537752.kers
Total runtime 3 ms.
[2026-05-24 02:57:56] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-24 02:57:56] [INFO ] Flow matrix only has 326 transitions (discarded 15 similar events)
[2026-05-24 02:57:56] [INFO ] Invariant cache hit.
[2026-05-24 02:57:56] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-24 02:57:56] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 100/126 places, 341/710 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61470 ms. Remains : 100/126 places, 341/710 transitions.
[2026-05-24 02:57:56] [INFO ] Flatten gal took : 18 ms
[2026-05-24 02:57:56] [INFO ] Flatten gal took : 15 ms
[2026-05-24 02:57:56] [INFO ] Input system was already deterministic with 341 transitions.
[2026-05-24 02:57:56] [INFO ] Flatten gal took : 15 ms
[2026-05-24 02:57:56] [INFO ] Flatten gal took : 14 ms
[2026-05-24 02:57:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality1656243589891380591.gal : 12 ms
[2026-05-24 02:57:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality9751840495827715084.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1656243589891380591.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9751840495827715084.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 02:58:27] [INFO ] Flatten gal took : 12 ms
[2026-05-24 02:58:27] [INFO ] Applying decomposition
[2026-05-24 02:58:27] [INFO ] Flatten gal took : 11 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/graph6797460284626243742.txt' '-o' '/tmp/graph6797460284626243742.bin' '-w' '/tmp/graph6797460284626243742.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6797460284626243742.bin' '-l' '-1' '-v' '-w' '/tmp/graph6797460284626243742.weights' '-q' '0' '-e' '0.001'
[2026-05-24 02:58:27] [INFO ] Decomposing Gal with order
[2026-05-24 02:58:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 02:58:27] [INFO ] Removed a total of 21 redundant transitions.
[2026-05-24 02:58:27] [INFO ] Flatten gal took : 70 ms
[2026-05-24 02:58:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 3 ms.
[2026-05-24 02:58:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality13865246184799868219.gal : 5 ms
[2026-05-24 02:58:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality17785222362869021044.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13865246184799868219.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17785222362869021044.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 710/710 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 123 transition count 681
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 681
Applied a total of 6 rules in 11 ms. Remains 123 /126 variables (removed 3) and now considering 681/710 (removed 29) transitions.
[2026-05-24 02:58:57] [INFO ] Flow matrix only has 625 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10746019256290427076.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-694211521256254234.kers'
[2026-05-24 02:58:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10746019256290427076.kers, --Pflows, --basisKERS=/tmp/petrispot-output-694211521256254234.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 625 rows 123 cols 2850 entries
Finished phase 1 with 111 SingleSign rule and 3 generalized
[2026-05-24 02:58:57] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-694211521256254234.kers
Total runtime 3 ms.
[2026-05-24 02:58:57] [INFO ] Implicit Places using invariants in 125 ms returned []
[2026-05-24 02:58:57] [INFO ] Flow matrix only has 625 transitions (discarded 56 similar events)
[2026-05-24 02:58:57] [INFO ] Invariant cache hit.
[2026-05-24 02:58:57] [INFO ] State equation strengthened by 85 read => feed constraints.
[2026-05-24 02:58:58] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
Running 679 sub problems to find dead transitions.
[2026-05-24 02:58:58] [INFO ] Flow matrix only has 625 transitions (discarded 56 similar events)
[2026-05-24 02:58:58] [INFO ] Invariant cache hit.
[2026-05-24 02:58:58] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 4 (OVERLAPS) 625/747 variables, 122/132 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/747 variables, 85/217 constraints. Problems are: Problem set: 0 solved, 679 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/747 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 7 (OVERLAPS) 1/748 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/748 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 679 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 748/748 variables, and 218 constraints, problems are : Problem set: 0 solved, 679 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 679/679 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 679 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 4 (OVERLAPS) 625/747 variables, 122/132 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/747 variables, 85/217 constraints. Problems are: Problem set: 0 solved, 679 unsolved
Problem TDEAD537 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/747 variables, 582/799 constraints. Problems are: Problem set: 39 solved, 640 unsolved
Problem TDEAD558 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD618 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/747 variables, 7/806 constraints. Problems are: Problem set: 65 solved, 614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 747/748 variables, and 806 constraints, problems are : Problem set: 65 solved, 614 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/123 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 582/679 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60504ms problems are : Problem set: 65 solved, 614 unsolved
Search for dead transitions found 65 dead transitions in 60508ms
Found 65 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 65 transitions
Dead transitions reduction (with SMT) removed 65 transitions
Starting structural reductions in LTL mode, iteration 1 : 123/126 places, 616/710 transitions.
Reduce places removed 10 places and 154 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 113 transition count 462
Reduce places removed 6 places and 55 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 107 transition count 407
Reduce places removed 2 places and 18 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 105 transition count 389
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 20 place count 103 transition count 373
Reduce places removed 1 places and 14 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 21 place count 102 transition count 359
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 23 place count 100 transition count 341
Iterating global reduction 5 with 2 rules applied. Total rules applied 25 place count 100 transition count 341
Applied a total of 25 rules in 5 ms. Remains 100 /123 variables (removed 23) and now considering 341/616 (removed 275) transitions.
[2026-05-24 02:59:58] [INFO ] Flow matrix only has 326 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2545174898238033648.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12245359234956592078.kers'
[2026-05-24 02:59:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2545174898238033648.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12245359234956592078.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 326 rows 100 cols 1448 entries
Finished phase 1 with 88 SingleSign rule and 3 generalized
[2026-05-24 02:59:58] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12245359234956592078.kers
Total runtime 2 ms.
[2026-05-24 02:59:58] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-24 02:59:58] [INFO ] Flow matrix only has 326 transitions (discarded 15 similar events)
[2026-05-24 02:59:58] [INFO ] Invariant cache hit.
[2026-05-24 02:59:58] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-24 02:59:58] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 100/126 places, 341/710 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61439 ms. Remains : 100/126 places, 341/710 transitions.
[2026-05-24 02:59:58] [INFO ] Flatten gal took : 12 ms
[2026-05-24 02:59:58] [INFO ] Flatten gal took : 12 ms
[2026-05-24 02:59:58] [INFO ] Input system was already deterministic with 341 transitions.
[2026-05-24 02:59:58] [INFO ] Flatten gal took : 10 ms
[2026-05-24 02:59:58] [INFO ] Flatten gal took : 10 ms
[2026-05-24 02:59:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality17640236757649134284.gal : 3 ms
[2026-05-24 02:59:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality8218156046395780045.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17640236757649134284.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8218156046395780045.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 03:00:29] [INFO ] Flatten gal took : 9 ms
[2026-05-24 03:00:29] [INFO ] Applying decomposition
[2026-05-24 03:00:29] [INFO ] Flatten gal took : 9 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/graph1507510138670559449.txt' '-o' '/tmp/graph1507510138670559449.bin' '-w' '/tmp/graph1507510138670559449.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1507510138670559449.bin' '-l' '-1' '-v' '-w' '/tmp/graph1507510138670559449.weights' '-q' '0' '-e' '0.001'
[2026-05-24 03:00:29] [INFO ] Decomposing Gal with order
[2026-05-24 03:00:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 03:00:29] [INFO ] Removed a total of 21 redundant transitions.
[2026-05-24 03:00:29] [INFO ] Flatten gal took : 30 ms
[2026-05-24 03:00:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 10 ms.
[2026-05-24 03:00:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality14574626425355038030.gal : 3 ms
[2026-05-24 03:00:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality5272627818962479736.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14574626425355038030.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5272627818962479736.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 710/710 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 123 transition count 681
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 681
Applied a total of 6 rules in 5 ms. Remains 123 /126 variables (removed 3) and now considering 681/710 (removed 29) transitions.
[2026-05-24 03:00:59] [INFO ] Flow matrix only has 625 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-504834354975005214.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-416477366866380386.kers'
[2026-05-24 03:00:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-504834354975005214.kers, --Pflows, --basisKERS=/tmp/petrispot-output-416477366866380386.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 625 rows 123 cols 2850 entries
Finished phase 1 with 111 SingleSign rule and 3 generalized
[2026-05-24 03:00:59] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-416477366866380386.kers
Total runtime 2 ms.
[2026-05-24 03:00:59] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-24 03:00:59] [INFO ] Flow matrix only has 625 transitions (discarded 56 similar events)
[2026-05-24 03:00:59] [INFO ] Invariant cache hit.
[2026-05-24 03:00:59] [INFO ] State equation strengthened by 85 read => feed constraints.
[2026-05-24 03:00:59] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
Running 679 sub problems to find dead transitions.
[2026-05-24 03:00:59] [INFO ] Flow matrix only has 625 transitions (discarded 56 similar events)
[2026-05-24 03:00:59] [INFO ] Invariant cache hit.
[2026-05-24 03:00:59] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 4 (OVERLAPS) 625/747 variables, 122/132 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/747 variables, 85/217 constraints. Problems are: Problem set: 0 solved, 679 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/747 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 7 (OVERLAPS) 1/748 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/748 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 679 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 748/748 variables, and 218 constraints, problems are : Problem set: 0 solved, 679 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 679/679 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 679 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 4 (OVERLAPS) 625/747 variables, 122/132 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/747 variables, 85/217 constraints. Problems are: Problem set: 0 solved, 679 unsolved
Problem TDEAD537 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/747 variables, 582/799 constraints. Problems are: Problem set: 39 solved, 640 unsolved
Problem TDEAD558 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD618 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/747 variables, 7/806 constraints. Problems are: Problem set: 65 solved, 614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 747/748 variables, and 806 constraints, problems are : Problem set: 65 solved, 614 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/123 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 582/679 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60519ms problems are : Problem set: 65 solved, 614 unsolved
Search for dead transitions found 65 dead transitions in 60521ms
Found 65 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 65 transitions
Dead transitions reduction (with SMT) removed 65 transitions
Starting structural reductions in LTL mode, iteration 1 : 123/126 places, 616/710 transitions.
Reduce places removed 10 places and 154 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 113 transition count 462
Reduce places removed 6 places and 55 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 107 transition count 407
Reduce places removed 2 places and 18 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 105 transition count 389
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 20 place count 103 transition count 373
Reduce places removed 1 places and 14 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 21 place count 102 transition count 359
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 23 place count 100 transition count 341
Iterating global reduction 5 with 2 rules applied. Total rules applied 25 place count 100 transition count 341
Applied a total of 25 rules in 4 ms. Remains 100 /123 variables (removed 23) and now considering 341/616 (removed 275) transitions.
[2026-05-24 03:02:00] [INFO ] Flow matrix only has 326 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3826080624964093776.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9476834468964125269.kers'
[2026-05-24 03:02:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3826080624964093776.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9476834468964125269.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 326 rows 100 cols 1448 entries
Finished phase 1 with 88 SingleSign rule and 3 generalized
[2026-05-24 03:02:00] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9476834468964125269.kers
Total runtime 1 ms.
[2026-05-24 03:02:00] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-24 03:02:00] [INFO ] Flow matrix only has 326 transitions (discarded 15 similar events)
[2026-05-24 03:02:00] [INFO ] Invariant cache hit.
[2026-05-24 03:02:00] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-24 03:02:00] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 100/126 places, 341/710 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61390 ms. Remains : 100/126 places, 341/710 transitions.
[2026-05-24 03:02:00] [INFO ] Flatten gal took : 9 ms
[2026-05-24 03:02:00] [INFO ] Flatten gal took : 10 ms
[2026-05-24 03:02:00] [INFO ] Input system was already deterministic with 341 transitions.
[2026-05-24 03:02:00] [INFO ] Flatten gal took : 10 ms
[2026-05-24 03:02:00] [INFO ] Flatten gal took : 23 ms
[2026-05-24 03:02:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality626692883754498099.gal : 3 ms
[2026-05-24 03:02:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality1853053925545328834.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality626692883754498099.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1853053925545328834.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 03:02:30] [INFO ] Flatten gal took : 8 ms
[2026-05-24 03:02:30] [INFO ] Applying decomposition
[2026-05-24 03:02:30] [INFO ] Flatten gal took : 8 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/graph6129889835536956233.txt' '-o' '/tmp/graph6129889835536956233.bin' '-w' '/tmp/graph6129889835536956233.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6129889835536956233.bin' '-l' '-1' '-v' '-w' '/tmp/graph6129889835536956233.weights' '-q' '0' '-e' '0.001'
[2026-05-24 03:02:30] [INFO ] Decomposing Gal with order
[2026-05-24 03:02:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 03:02:30] [INFO ] Removed a total of 21 redundant transitions.
[2026-05-24 03:02:30] [INFO ] Flatten gal took : 15 ms
[2026-05-24 03:02:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 2 ms.
[2026-05-24 03:02:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality9454712175855948858.gal : 3 ms
[2026-05-24 03:02:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality1491970939427424377.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9454712175855948858.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1491970939427424377.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 710/710 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 123 transition count 681
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 681
Applied a total of 6 rules in 4 ms. Remains 123 /126 variables (removed 3) and now considering 681/710 (removed 29) transitions.
[2026-05-24 03:03:00] [INFO ] Flow matrix only has 625 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2640261556339862229.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2316687050407452535.kers'
[2026-05-24 03:03:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2640261556339862229.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2316687050407452535.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 625 rows 123 cols 2850 entries
Finished phase 1 with 111 SingleSign rule and 3 generalized
[2026-05-24 03:03:01] [INFO ] Computed 9 invariants in 5 ms
Computed 9 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-2316687050407452535.kers
Total runtime 6 ms.
[2026-05-24 03:03:01] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-24 03:03:01] [INFO ] Flow matrix only has 625 transitions (discarded 56 similar events)
[2026-05-24 03:03:01] [INFO ] Invariant cache hit.
[2026-05-24 03:03:01] [INFO ] State equation strengthened by 85 read => feed constraints.
[2026-05-24 03:03:01] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
Running 679 sub problems to find dead transitions.
[2026-05-24 03:03:01] [INFO ] Flow matrix only has 625 transitions (discarded 56 similar events)
[2026-05-24 03:03:01] [INFO ] Invariant cache hit.
[2026-05-24 03:03:01] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 4 (OVERLAPS) 625/747 variables, 122/132 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/747 variables, 85/217 constraints. Problems are: Problem set: 0 solved, 679 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/747 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 7 (OVERLAPS) 1/748 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/748 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 679 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 748/748 variables, and 218 constraints, problems are : Problem set: 0 solved, 679 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 679/679 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 679 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 4 (OVERLAPS) 625/747 variables, 122/132 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/747 variables, 85/217 constraints. Problems are: Problem set: 0 solved, 679 unsolved
Problem TDEAD537 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/747 variables, 582/799 constraints. Problems are: Problem set: 39 solved, 640 unsolved
Problem TDEAD558 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD618 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/747 variables, 7/806 constraints. Problems are: Problem set: 65 solved, 614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 747/748 variables, and 806 constraints, problems are : Problem set: 65 solved, 614 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/123 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 582/679 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60535ms problems are : Problem set: 65 solved, 614 unsolved
Search for dead transitions found 65 dead transitions in 60538ms
Found 65 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 65 transitions
Dead transitions reduction (with SMT) removed 65 transitions
Starting structural reductions in LTL mode, iteration 1 : 123/126 places, 616/710 transitions.
Reduce places removed 10 places and 154 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 113 transition count 462
Reduce places removed 6 places and 55 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 107 transition count 407
Reduce places removed 2 places and 18 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 105 transition count 389
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 20 place count 103 transition count 373
Reduce places removed 1 places and 14 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 21 place count 102 transition count 359
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 23 place count 100 transition count 341
Iterating global reduction 5 with 2 rules applied. Total rules applied 25 place count 100 transition count 341
Applied a total of 25 rules in 4 ms. Remains 100 /123 variables (removed 23) and now considering 341/616 (removed 275) transitions.
[2026-05-24 03:04:02] [INFO ] Flow matrix only has 326 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18418488185957202889.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12794723188507627130.kers'
[2026-05-24 03:04:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18418488185957202889.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12794723188507627130.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 326 rows 100 cols 1448 entries
Finished phase 1 with 88 SingleSign rule and 3 generalized
[2026-05-24 03:04:02] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12794723188507627130.kers
Total runtime 1 ms.
[2026-05-24 03:04:02] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-24 03:04:02] [INFO ] Flow matrix only has 326 transitions (discarded 15 similar events)
[2026-05-24 03:04:02] [INFO ] Invariant cache hit.
[2026-05-24 03:04:02] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-24 03:04:02] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 100/126 places, 341/710 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61581 ms. Remains : 100/126 places, 341/710 transitions.
[2026-05-24 03:04:02] [INFO ] Flatten gal took : 10 ms
[2026-05-24 03:04:02] [INFO ] Flatten gal took : 8 ms
[2026-05-24 03:04:02] [INFO ] Input system was already deterministic with 341 transitions.
[2026-05-24 03:04:02] [INFO ] Flatten gal took : 7 ms
[2026-05-24 03:04:02] [INFO ] Flatten gal took : 8 ms
[2026-05-24 03:04:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality9337804278056160847.gal : 3 ms
[2026-05-24 03:04:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality16803283412774676240.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9337804278056160847.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16803283412774676240.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 03:04:32] [INFO ] Flatten gal took : 8 ms
[2026-05-24 03:04:32] [INFO ] Applying decomposition
[2026-05-24 03:04:32] [INFO ] Flatten gal took : 6 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/graph104673321739583222.txt' '-o' '/tmp/graph104673321739583222.bin' '-w' '/tmp/graph104673321739583222.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph104673321739583222.bin' '-l' '-1' '-v' '-w' '/tmp/graph104673321739583222.weights' '-q' '0' '-e' '0.001'
[2026-05-24 03:04:32] [INFO ] Decomposing Gal with order
[2026-05-24 03:04:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 03:04:32] [INFO ] Removed a total of 21 redundant transitions.
[2026-05-24 03:04:32] [INFO ] Flatten gal took : 15 ms
[2026-05-24 03:04:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 1 ms.
[2026-05-24 03:04:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality6171440778015019759.gal : 3 ms
[2026-05-24 03:04:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality8464557426329168359.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6171440778015019759.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8464557426329168359.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 710/710 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 123 transition count 681
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 681
Applied a total of 6 rules in 8 ms. Remains 123 /126 variables (removed 3) and now considering 681/710 (removed 29) transitions.
[2026-05-24 03:05:02] [INFO ] Flow matrix only has 625 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13492424622082993311.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12236175536618073693.kers'
[2026-05-24 03:05:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13492424622082993311.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12236175536618073693.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 625 rows 123 cols 2850 entries
Finished phase 1 with 111 SingleSign rule and 3 generalized
[2026-05-24 03:05:02] [INFO ] Computed 9 invariants in 6 ms
Computed 9 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-12236175536618073693.kers
Total runtime 8 ms.
[2026-05-24 03:05:02] [INFO ] Implicit Places using invariants in 116 ms returned []
[2026-05-24 03:05:02] [INFO ] Flow matrix only has 625 transitions (discarded 56 similar events)
[2026-05-24 03:05:02] [INFO ] Invariant cache hit.
[2026-05-24 03:05:03] [INFO ] State equation strengthened by 85 read => feed constraints.
[2026-05-24 03:05:03] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
Running 679 sub problems to find dead transitions.
[2026-05-24 03:05:03] [INFO ] Flow matrix only has 625 transitions (discarded 56 similar events)
[2026-05-24 03:05:03] [INFO ] Invariant cache hit.
[2026-05-24 03:05:03] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 4 (OVERLAPS) 625/747 variables, 122/132 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/747 variables, 85/217 constraints. Problems are: Problem set: 0 solved, 679 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/747 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 7 (OVERLAPS) 1/748 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/748 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 679 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 748/748 variables, and 218 constraints, problems are : Problem set: 0 solved, 679 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 679/679 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 679 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 4 (OVERLAPS) 625/747 variables, 122/132 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/747 variables, 85/217 constraints. Problems are: Problem set: 0 solved, 679 unsolved
Problem TDEAD537 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/747 variables, 582/799 constraints. Problems are: Problem set: 39 solved, 640 unsolved
Problem TDEAD558 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD618 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/747 variables, 7/806 constraints. Problems are: Problem set: 65 solved, 614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 747/748 variables, and 806 constraints, problems are : Problem set: 65 solved, 614 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/123 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 582/679 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60593ms problems are : Problem set: 65 solved, 614 unsolved
Search for dead transitions found 65 dead transitions in 60596ms
Found 65 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 65 transitions
Dead transitions reduction (with SMT) removed 65 transitions
Starting structural reductions in LTL mode, iteration 1 : 123/126 places, 616/710 transitions.
Reduce places removed 10 places and 154 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 113 transition count 462
Reduce places removed 6 places and 55 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 107 transition count 407
Reduce places removed 2 places and 18 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 105 transition count 389
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 20 place count 103 transition count 373
Reduce places removed 1 places and 14 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 21 place count 102 transition count 359
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 23 place count 100 transition count 341
Iterating global reduction 5 with 2 rules applied. Total rules applied 25 place count 100 transition count 341
Applied a total of 25 rules in 6 ms. Remains 100 /123 variables (removed 23) and now considering 341/616 (removed 275) transitions.
[2026-05-24 03:06:03] [INFO ] Flow matrix only has 326 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3104229129009332482.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16004065047874779147.kers'
[2026-05-24 03:06:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3104229129009332482.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16004065047874779147.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 326 rows 100 cols 1448 entries
Finished phase 1 with 88 SingleSign rule and 3 generalized
[2026-05-24 03:06:03] [INFO ] Computed 9 invariants in 3 ms
Computed 9 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16004065047874779147.kers
Total runtime 8 ms.
[2026-05-24 03:06:04] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-24 03:06:04] [INFO ] Flow matrix only has 326 transitions (discarded 15 similar events)
[2026-05-24 03:06:04] [INFO ] Invariant cache hit.
[2026-05-24 03:06:04] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-24 03:06:04] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 100/126 places, 341/710 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61496 ms. Remains : 100/126 places, 341/710 transitions.
[2026-05-24 03:06:04] [INFO ] Flatten gal took : 10 ms
[2026-05-24 03:06:04] [INFO ] Flatten gal took : 7 ms
[2026-05-24 03:06:04] [INFO ] Input system was already deterministic with 341 transitions.
[2026-05-24 03:06:04] [INFO ] Flatten gal took : 7 ms
[2026-05-24 03:06:04] [INFO ] Flatten gal took : 7 ms
[2026-05-24 03:06:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality15492906955009496590.gal : 2 ms
[2026-05-24 03:06:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality10024105017959614578.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15492906955009496590.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10024105017959614578.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 03:06:34] [INFO ] Flatten gal took : 11 ms
[2026-05-24 03:06:34] [INFO ] Applying decomposition
[2026-05-24 03:06:34] [INFO ] Flatten gal took : 8 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/graph12572271958327192344.txt' '-o' '/tmp/graph12572271958327192344.bin' '-w' '/tmp/graph12572271958327192344.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12572271958327192344.bin' '-l' '-1' '-v' '-w' '/tmp/graph12572271958327192344.weights' '-q' '0' '-e' '0.001'
[2026-05-24 03:06:34] [INFO ] Decomposing Gal with order
[2026-05-24 03:06:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 03:06:34] [INFO ] Removed a total of 21 redundant transitions.
[2026-05-24 03:06:34] [INFO ] Flatten gal took : 14 ms
[2026-05-24 03:06:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 1 ms.
[2026-05-24 03:06:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality9018347118683898921.gal : 2 ms
[2026-05-24 03:06:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality9088083627399962109.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9018347118683898921.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9088083627399962109.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 03:07:04] [INFO ] Flatten gal took : 15 ms
[2026-05-24 03:07:04] [INFO ] Flatten gal took : 20 ms
[2026-05-24 03:07:04] [INFO ] Applying decomposition
[2026-05-24 03:07:04] [INFO ] Flatten gal took : 14 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/graph7323141827202879724.txt' '-o' '/tmp/graph7323141827202879724.bin' '-w' '/tmp/graph7323141827202879724.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7323141827202879724.bin' '-l' '-1' '-v' '-w' '/tmp/graph7323141827202879724.weights' '-q' '0' '-e' '0.001'
[2026-05-24 03:07:04] [INFO ] Decomposing Gal with order
[2026-05-24 03:07:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 03:07:04] [INFO ] Removed a total of 192 redundant transitions.
[2026-05-24 03:07:04] [INFO ] Flatten gal took : 34 ms
[2026-05-24 03:07:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 4 ms.
[2026-05-24 03:07:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality5488050949400616279.gal : 5 ms
[2026-05-24 03:07:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality4638438960504961463.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5488050949400616279.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4638438960504961463.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 5 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 03:31:16] [INFO ] Flatten gal took : 163 ms
[2026-05-24 03:31:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality6590866216161853112.gal : 33 ms
[2026-05-24 03:31:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality17823955827844074718.ctl : 38 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6590866216161853112.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17823955827844074718.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 5 CTL formulae.
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BugTracking-PT-q3m256"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is BugTracking-PT-q3m256, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r034-tall-177946841900377"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m256.tgz
mv BugTracking-PT-q3m256 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;
