About the Execution of ITS-Tools for BugTracking-PT-q3m032
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16210.464 | 3600000.00 | 3379573.00 | 262836.90 | ?FTTTTT??FTTTT?? | 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-177946841900353.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-q3m032, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946841900353
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.1K Mar 5 17:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Mar 5 17:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 5 17:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 5 17:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K Mar 15 07:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 07:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Mar 5 17:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Mar 5 17:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 5 17:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 5 17:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 07:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:39 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-q3m032-CTLCardinality-2024-00
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-2024-01
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-2024-02
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-2024-03
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-2024-04
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-2024-05
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-2024-06
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-2024-07
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-2024-08
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-2024-09
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-2024-10
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-2024-11
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-2024-12
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-2024-13
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-2024-14
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1779586256555
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-q3m032
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-24 01:30:57] [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 01:30:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 01:30:58] [INFO ] Load time of PNML (sax parser for PT used): 736 ms
[2026-05-24 01:30:58] [INFO ] Transformed 754 places.
[2026-05-24 01:30:58] [INFO ] Transformed 27370 transitions.
[2026-05-24 01:30:58] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 907 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Deduced a syphon composed of 514 places in 138 ms
Reduce places removed 514 places and 24601 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q3m032-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 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
Applied a total of 2 rules in 49 ms. Remains 238 /240 variables (removed 2) and now considering 2769/2769 (removed 0) transitions.
[2026-05-24 01:30:58] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12284752983777365410.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11388946999159742935.kers'
[2026-05-24 01:30:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12284752983777365410.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11388946999159742935.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2642 rows 238 cols 12461 entries
Finished phase 1 with 230 SingleSign rule and 0 generalized
[2026-05-24 01:30:59] [INFO ] Computed 8 invariants in 8 ms
Computed 8 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-11388946999159742935.kers
Total runtime 11 ms.
[2026-05-24 01:30:59] [INFO ] Implicit Places using invariants in 562 ms returned []
[2026-05-24 01:30:59] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
[2026-05-24 01:30:59] [INFO ] Invariant cache hit.
[2026-05-24 01:31:00] [INFO ] State equation strengthened by 255 read => feed constraints.
[2026-05-24 01:31:02] [INFO ] Implicit Places using invariants and state equation in 2896 ms returned []
Implicit Place search using SMT with State Equation took 3489 ms to find 0 implicit places.
Running 2767 sub problems to find dead transitions.
[2026-05-24 01:31:02] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
[2026-05-24 01:31:02] [INFO ] Invariant cache hit.
[2026-05-24 01:31:02] [INFO ] State equation strengthened by 255 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2767 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 237/2880 variables, and 12 constraints, problems are : Problem set: 14 solved, 2753 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/238 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 2767/1238 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 14 solved, 2753 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 8/8 constraints. Problems are: Problem set: 14 solved, 2753 unsolved
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 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
Problem TDEAD2674 is UNSAT
Problem TDEAD2675 is UNSAT
Problem TDEAD2676 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 TDEAD2712 is UNSAT
Problem TDEAD2713 is UNSAT
Problem TDEAD2714 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 TDEAD2750 is UNSAT
Problem TDEAD2751 is UNSAT
Problem TDEAD2752 is UNSAT
Problem TDEAD2756 is UNSAT
Problem TDEAD2757 is UNSAT
Problem TDEAD2758 is UNSAT
Problem TDEAD2759 is UNSAT
Problem TDEAD2760 is UNSAT
Problem TDEAD2761 is UNSAT
Problem TDEAD2762 is UNSAT
Problem TDEAD2763 is UNSAT
Problem TDEAD2764 is UNSAT
Problem TDEAD2767 is UNSAT
Problem TDEAD2768 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 4/12 constraints. Problems are: Problem set: 74 solved, 2693 unsolved
Problem TDEAD2310 is UNSAT
Problem TDEAD2318 is UNSAT
Problem TDEAD2319 is UNSAT
Problem TDEAD2329 is UNSAT
Problem TDEAD2330 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 TDEAD2356 is UNSAT
Problem TDEAD2364 is UNSAT
Problem TDEAD2365 is UNSAT
Problem TDEAD2375 is UNSAT
Problem TDEAD2376 is UNSAT
Problem TDEAD2379 is UNSAT
Problem TDEAD2387 is UNSAT
Problem TDEAD2677 is UNSAT
Problem TDEAD2678 is UNSAT
Problem TDEAD2679 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 TDEAD2715 is UNSAT
Problem TDEAD2716 is UNSAT
Problem TDEAD2717 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
Problem TDEAD2753 is UNSAT
Problem TDEAD2765 is UNSAT
Problem TDEAD2766 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 10/22 constraints. Problems are: Problem set: 149 solved, 2618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 237/2880 variables, and 22 constraints, problems are : Problem set: 149 solved, 2618 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/238 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 1529/1238 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64804ms problems are : Problem set: 149 solved, 2618 unsolved
Search for dead transitions found 149 dead transitions in 64854ms
Found 149 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 149 transitions
Dead transitions reduction (with SMT) removed 149 transitions
Starting structural reductions in LTL mode, iteration 1 : 238/240 places, 2620/2769 transitions.
Reduce places removed 31 places and 829 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 207 transition count 1791
Reduce places removed 23 places and 281 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 54 place count 184 transition count 1510
Reduce places removed 10 places and 167 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 64 place count 174 transition count 1343
Reduce places removed 6 places and 114 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 70 place count 168 transition count 1229
Reduce places removed 1 places and 17 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 71 place count 167 transition count 1212
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 73 place count 165 transition count 1174
Deduced a syphon composed of 25 places in 3 ms
Reduce places removed 15 places and 264 transitions.
Iterating global reduction 5 with 17 rules applied. Total rules applied 90 place count 150 transition count 910
Deduced a syphon composed of 10 places in 2 ms
Applied a total of 90 rules in 28 ms. Remains 150 /238 variables (removed 88) and now considering 910/2620 (removed 1710) transitions.
[2026-05-24 01:32:07] [INFO ] Flow matrix only has 868 transitions (discarded 42 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7157200292719446531.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2117649367173137262.kers'
[2026-05-24 01:32:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7157200292719446531.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2117649367173137262.kers]
Culling trivial invariants: removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 868 rows 140 cols 3978 entries
Finished phase 1 with 132 SingleSign rule and 0 generalized
[2026-05-24 01:32:07] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2117649367173137262.kers
Total runtime 3 ms.
[2026-05-24 01:32:07] [INFO ] Implicit Places using invariants in 191 ms returned []
[2026-05-24 01:32:07] [INFO ] Flow matrix only has 868 transitions (discarded 42 similar events)
[2026-05-24 01:32:07] [INFO ] Invariant cache hit.
[2026-05-24 01:32:07] [INFO ] State equation strengthened by 115 read => feed constraints.
[2026-05-24 01:32:08] [INFO ] Implicit Places using invariants and state equation in 816 ms returned []
Implicit Place search using SMT with State Equation took 1013 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 150/240 places, 910/2769 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69496 ms. Remains : 150/240 places, 910/2769 transitions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 910/910 transitions.
Deduced a syphon composed of 10 places in 1 ms
Applied a total of 0 rules in 8 ms. Remains 150 /150 variables (removed 0) and now considering 910/910 (removed 0) transitions.
[2026-05-24 01:32:08] [INFO ] Flow matrix only has 868 transitions (discarded 42 similar events)
[2026-05-24 01:32:08] [INFO ] Invariant cache hit.
[2026-05-24 01:32:08] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-24 01:32:08] [INFO ] Flow matrix only has 868 transitions (discarded 42 similar events)
[2026-05-24 01:32:08] [INFO ] Invariant cache hit.
[2026-05-24 01:32:08] [INFO ] State equation strengthened by 115 read => feed constraints.
[2026-05-24 01:32:09] [INFO ] Implicit Places using invariants and state equation in 789 ms returned []
Implicit Place search using SMT with State Equation took 905 ms to find 0 implicit places.
Running 908 sub problems to find dead transitions.
[2026-05-24 01:32:09] [INFO ] Flow matrix only has 868 transitions (discarded 42 similar events)
[2026-05-24 01:32:09] [INFO ] Invariant cache hit.
[2026-05-24 01:32:09] [INFO ] State equation strengthened by 115 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 908 unsolved
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 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 TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 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 TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 2/10 constraints. Problems are: Problem set: 147 solved, 761 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/10 constraints. Problems are: Problem set: 147 solved, 761 unsolved
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
At refinement iteration 3 (OVERLAPS) 868/1007 variables, 139/149 constraints. Problems are: Problem set: 151 solved, 757 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1007 variables, 115/264 constraints. Problems are: Problem set: 151 solved, 757 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1007 variables, 0/264 constraints. Problems are: Problem set: 151 solved, 757 unsolved
At refinement iteration 6 (OVERLAPS) 1/1008 variables, 1/265 constraints. Problems are: Problem set: 151 solved, 757 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1008/1018 variables, and 265 constraints, problems are : Problem set: 151 solved, 757 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 8/18 constraints, State Equation: 140/150 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 908/908 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 151 solved, 757 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 8/8 constraints. Problems are: Problem set: 151 solved, 757 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 2/10 constraints. Problems are: Problem set: 151 solved, 757 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/10 constraints. Problems are: Problem set: 151 solved, 757 unsolved
At refinement iteration 3 (OVERLAPS) 868/1007 variables, 139/149 constraints. Problems are: Problem set: 151 solved, 757 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1007 variables, 115/264 constraints. Problems are: Problem set: 151 solved, 757 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 5 (INCLUDED_ONLY) 0/1007 variables, 660/924 constraints. Problems are: Problem set: 190 solved, 718 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1018 variables, and 929 constraints, problems are : Problem set: 215 solved, 693 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 8/18 constraints, State Equation: 139/150 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 660/908 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60910ms problems are : Problem set: 215 solved, 693 unsolved
Search for dead transitions found 215 dead transitions in 60913ms
Found 215 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 215 transitions
Dead transitions reduction (with SMT) removed 215 transitions
Starting structural reductions in LTL mode, iteration 1 : 150/150 places, 695/910 transitions.
Reduce places removed 12 places and 211 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 138 transition count 484
Reduce places removed 11 places and 71 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 127 transition count 413
Reduce places removed 2 places and 18 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 25 place count 125 transition count 395
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 27 place count 123 transition count 379
Reduce places removed 1 places and 14 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 28 place count 122 transition count 365
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 30 place count 120 transition count 347
Deduced a syphon composed of 19 places in 1 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 32 place count 120 transition count 347
Deduced a syphon composed of 19 places in 1 ms
Applied a total of 32 rules in 9 ms. Remains 120 /150 variables (removed 30) and now considering 347/695 (removed 348) transitions.
[2026-05-24 01:33:10] [INFO ] Flow matrix only has 331 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3043828332144541615.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16533270536955181008.kers'
[2026-05-24 01:33:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3043828332144541615.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16533270536955181008.kers]
Culling trivial invariants: removing 19 columns.
Culled 19 columns in 0 ms.
// Phase 1: matrix 331 rows 101 cols 1473 entries
Finished phase 1 with 89 SingleSign rule and 3 generalized
[2026-05-24 01:33:10] [INFO ] Computed 28 invariants in 2 ms
Computed 28 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16533270536955181008.kers
Total runtime 3 ms.
[2026-05-24 01:33:10] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-24 01:33:10] [INFO ] Flow matrix only has 331 transitions (discarded 16 similar events)
[2026-05-24 01:33:10] [INFO ] Invariant cache hit.
[2026-05-24 01:33:10] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-24 01:33:10] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 120/150 places, 347/910 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62164 ms. Remains : 120/150 places, 347/910 transitions.
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Support contains 9 out of 101 places after structural reductions.
FORMULA BugTracking-PT-q3m032-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 01:33:10] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2026-05-24 01:33:10] [INFO ] Flatten gal took : 65 ms
[2026-05-24 01:33:10] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BugTracking-PT-q3m032-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 01:33:10] [INFO ] Flatten gal took : 36 ms
[2026-05-24 01:33:10] [INFO ] Input system was already deterministic with 347 transitions.
Support contains 5 out of 101 places (down from 9) after GAL structural reductions.
RANDOM walk for 40018 steps (72 resets) in 785 ms. (50 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (10 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (13 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
[2026-05-24 01:33:11] [INFO ] Flow matrix only has 331 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3592424209710844947.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9381300313904623708.kers'
[2026-05-24 01:33:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3592424209710844947.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9381300313904623708.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 331 rows 101 cols 1473 entries
Finished phase 1 with 89 SingleSign rule and 3 generalized
[2026-05-24 01:33:11] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9381300313904623708.kers
Total runtime 1 ms.
[2026-05-24 01:33:11] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 3 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/24 variables, 10/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 3/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 154/178 variables, 7/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 13/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/333 variables, 45/81 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/333 variables, 2/83 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/333 variables, 20/103 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/333 variables, 0/103 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/339 variables, 2/105 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/339 variables, 4/109 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/339 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Real declared 410/432 variables, and 128 constraints, problems are : Problem set: 2 solved, 0 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 6/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/101 constraints, ReadFeed: 36/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 118ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 3 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q3m032-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 01:33:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-24 01:33:11] [INFO ] Flatten gal took : 29 ms
FORMULA BugTracking-PT-q3m032-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 01:33:11] [INFO ] Flatten gal took : 26 ms
[2026-05-24 01:33:11] [INFO ] Input system was already deterministic with 347 transitions.
Support contains 2 out of 101 places (down from 3) after GAL structural reductions.
Computed a total of 4 stabilizing places and 21 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 347/347 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 341
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 341
Applied a total of 2 rules in 2 ms. Remains 100 /101 variables (removed 1) and now considering 341/347 (removed 6) transitions.
[2026-05-24 01:33:11] [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-8104060830968297090.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4063300657234221923.kers'
[2026-05-24 01:33:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8104060830968297090.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4063300657234221923.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 01:33:11] [INFO ] Computed 9 invariants in 3 ms
Computed 9 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4063300657234221923.kers
Total runtime 4 ms.
[2026-05-24 01:33:11] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-24 01:33:11] [INFO ] Flow matrix only has 326 transitions (discarded 15 similar events)
[2026-05-24 01:33:11] [INFO ] Invariant cache hit.
[2026-05-24 01:33:11] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-24 01:33:11] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Running 339 sub problems to find dead transitions.
[2026-05-24 01:33:11] [INFO ] Flow matrix only has 326 transitions (discarded 15 similar events)
[2026-05-24 01:33:11] [INFO ] Invariant cache hit.
[2026-05-24 01:33:11] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
At refinement iteration 4 (OVERLAPS) 326/425 variables, 99/109 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 57/166 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 3/169 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 0/169 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 1/426 variables, 1/170 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 0/170 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 10 (OVERLAPS) 0/426 variables, 0/170 constraints. Problems are: Problem set: 56 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 170 constraints, problems are : Problem set: 56 solved, 283 unsolved in 20812 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 56 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 1/8 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 4/12 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/12 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 3/99 variables, 1/13 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/13 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 6 (OVERLAPS) 326/425 variables, 99/112 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 57/169 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 225/394 constraints. Problems are: Problem set: 56 solved, 283 unsolved
Problem TDEAD283 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 2/396 constraints. Problems are: Problem set: 57 solved, 282 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD105 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 1/397 constraints. Problems are: Problem set: 62 solved, 277 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 5/402 constraints. Problems are: Problem set: 62 solved, 277 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/426 variables, and 408 constraints, problems are : Problem set: 62 solved, 277 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/100 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 225/339 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 51033ms problems are : Problem set: 62 solved, 277 unsolved
Search for dead transitions found 62 dead transitions in 51037ms
Found 62 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 62 transitions
Dead transitions reduction (with SMT) removed 62 transitions
Starting structural reductions in LTL mode, iteration 1 : 100/101 places, 279/347 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 97 transition count 279
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 95 transition count 265
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 95 transition count 265
Applied a total of 7 rules in 5 ms. Remains 95 /100 variables (removed 5) and now considering 265/279 (removed 14) transitions.
[2026-05-24 01:34:02] [INFO ] Flow matrix only has 248 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-406489137031543249.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4736800612135071263.kers'
[2026-05-24 01:34:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-406489137031543249.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4736800612135071263.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 95 cols 1069 entries
Finished phase 1 with 84 SingleSign rule and 3 generalized
[2026-05-24 01:34:02] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4736800612135071263.kers
Total runtime 2 ms.
[2026-05-24 01:34:02] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-24 01:34:02] [INFO ] Flow matrix only has 248 transitions (discarded 17 similar events)
[2026-05-24 01:34:02] [INFO ] Invariant cache hit.
[2026-05-24 01:34:03] [INFO ] State equation strengthened by 48 read => feed constraints.
[2026-05-24 01:34:03] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 95/101 places, 265/347 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51681 ms. Remains : 95/101 places, 265/347 transitions.
[2026-05-24 01:34:03] [INFO ] Flatten gal took : 17 ms
[2026-05-24 01:34:03] [INFO ] Flatten gal took : 13 ms
[2026-05-24 01:34:03] [INFO ] Input system was already deterministic with 265 transitions.
[2026-05-24 01:34:03] [INFO ] Flatten gal took : 13 ms
[2026-05-24 01:34:03] [INFO ] Flatten gal took : 13 ms
[2026-05-24 01:34:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality1827229903485295091.gal : 9 ms
[2026-05-24 01:34:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality15910337564299799034.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/CTLCardinality1827229903485295091.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15910337564299799034.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 01:34:33] [INFO ] Flatten gal took : 15 ms
[2026-05-24 01:34:33] [INFO ] Applying decomposition
[2026-05-24 01:34:33] [INFO ] Flatten gal took : 10 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/graph17035371721228592078.txt' '-o' '/tmp/graph17035371721228592078.bin' '-w' '/tmp/graph17035371721228592078.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17035371721228592078.bin' '-l' '-1' '-v' '-w' '/tmp/graph17035371721228592078.weights' '-q' '0' '-e' '0.001'
[2026-05-24 01:34:33] [INFO ] Decomposing Gal with order
[2026-05-24 01:34:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 01:34:33] [INFO ] Removed a total of 31 redundant transitions.
[2026-05-24 01:34:33] [INFO ] Flatten gal took : 63 ms
[2026-05-24 01:34:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 4 ms.
[2026-05-24 01:34:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality15113113042982623477.gal : 4 ms
[2026-05-24 01:34:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality1056352517687634791.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/CTLCardinality15113113042982623477.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1056352517687634791.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 : 101/101 places, 347/347 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 341
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 341
Applied a total of 2 rules in 4 ms. Remains 100 /101 variables (removed 1) and now considering 341/347 (removed 6) transitions.
[2026-05-24 01:35: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-7629877150706260234.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14733111661455730832.kers'
[2026-05-24 01:35:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7629877150706260234.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14733111661455730832.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 01:35:03] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14733111661455730832.kers
Total runtime 1 ms.
[2026-05-24 01:35:03] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-05-24 01:35:03] [INFO ] Flow matrix only has 326 transitions (discarded 15 similar events)
[2026-05-24 01:35:03] [INFO ] Invariant cache hit.
[2026-05-24 01:35:03] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-24 01:35:04] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Running 339 sub problems to find dead transitions.
[2026-05-24 01:35:04] [INFO ] Flow matrix only has 326 transitions (discarded 15 similar events)
[2026-05-24 01:35:04] [INFO ] Invariant cache hit.
[2026-05-24 01:35:04] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
At refinement iteration 4 (OVERLAPS) 326/425 variables, 99/109 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 57/166 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 3/169 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 0/169 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 1/426 variables, 1/170 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 0/170 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 10 (OVERLAPS) 0/426 variables, 0/170 constraints. Problems are: Problem set: 56 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 170 constraints, problems are : Problem set: 56 solved, 283 unsolved in 20469 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 56 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 1/8 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 4/12 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/12 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 3/99 variables, 1/13 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/13 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 6 (OVERLAPS) 326/425 variables, 99/112 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 57/169 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 225/394 constraints. Problems are: Problem set: 56 solved, 283 unsolved
Problem TDEAD283 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 2/396 constraints. Problems are: Problem set: 57 solved, 282 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD105 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 1/397 constraints. Problems are: Problem set: 62 solved, 277 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 5/402 constraints. Problems are: Problem set: 62 solved, 277 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/426 variables, and 408 constraints, problems are : Problem set: 62 solved, 277 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/100 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 225/339 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 50594ms problems are : Problem set: 62 solved, 277 unsolved
Search for dead transitions found 62 dead transitions in 50595ms
Found 62 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 62 transitions
Dead transitions reduction (with SMT) removed 62 transitions
Starting structural reductions in LTL mode, iteration 1 : 100/101 places, 279/347 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 97 transition count 279
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 95 transition count 265
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 95 transition count 265
Applied a total of 7 rules in 12 ms. Remains 95 /100 variables (removed 5) and now considering 265/279 (removed 14) transitions.
[2026-05-24 01:35:54] [INFO ] Flow matrix only has 248 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11145896999983989885.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8414207379979752761.kers'
[2026-05-24 01:35:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11145896999983989885.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8414207379979752761.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 95 cols 1069 entries
Finished phase 1 with 84 SingleSign rule and 3 generalized
[2026-05-24 01:35:54] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8414207379979752761.kers
Total runtime 1 ms.
[2026-05-24 01:35:54] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-24 01:35:54] [INFO ] Flow matrix only has 248 transitions (discarded 17 similar events)
[2026-05-24 01:35:54] [INFO ] Invariant cache hit.
[2026-05-24 01:35:54] [INFO ] State equation strengthened by 48 read => feed constraints.
[2026-05-24 01:35:55] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 95/101 places, 265/347 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51328 ms. Remains : 95/101 places, 265/347 transitions.
[2026-05-24 01:35:55] [INFO ] Flatten gal took : 10 ms
[2026-05-24 01:35:55] [INFO ] Flatten gal took : 20 ms
[2026-05-24 01:35:55] [INFO ] Input system was already deterministic with 265 transitions.
[2026-05-24 01:35:55] [INFO ] Flatten gal took : 9 ms
[2026-05-24 01:35:55] [INFO ] Flatten gal took : 9 ms
[2026-05-24 01:35:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality6103231089891762499.gal : 2 ms
[2026-05-24 01:35:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality6601245777277872771.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/CTLCardinality6103231089891762499.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6601245777277872771.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 01:36:25] [INFO ] Flatten gal took : 9 ms
[2026-05-24 01:36:25] [INFO ] Applying decomposition
[2026-05-24 01:36:25] [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/graph5647238201536305397.txt' '-o' '/tmp/graph5647238201536305397.bin' '-w' '/tmp/graph5647238201536305397.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5647238201536305397.bin' '-l' '-1' '-v' '-w' '/tmp/graph5647238201536305397.weights' '-q' '0' '-e' '0.001'
[2026-05-24 01:36:25] [INFO ] Decomposing Gal with order
[2026-05-24 01:36:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 01:36:25] [INFO ] Removed a total of 31 redundant transitions.
[2026-05-24 01:36:25] [INFO ] Flatten gal took : 14 ms
[2026-05-24 01:36:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 2 ms.
[2026-05-24 01:36:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality993682899218922921.gal : 5 ms
[2026-05-24 01:36:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality7636067769837867911.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/CTLCardinality993682899218922921.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7636067769837867911.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 -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 101/101 places, 347/347 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 341
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 341
Applied a total of 2 rules in 26 ms. Remains 100 /101 variables (removed 1) and now considering 341/347 (removed 6) transitions.
[2026-05-24 01:36:55] [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-5680661575422974474.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14795967794684967955.kers'
[2026-05-24 01:36:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5680661575422974474.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14795967794684967955.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 01:36:55] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14795967794684967955.kers
Total runtime 1 ms.
[2026-05-24 01:36:55] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-24 01:36:55] [INFO ] Flow matrix only has 326 transitions (discarded 15 similar events)
[2026-05-24 01:36:55] [INFO ] Invariant cache hit.
[2026-05-24 01:36:55] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-24 01:36:55] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2026-05-24 01:36:55] [INFO ] Redundant transitions in 21 ms returned []
Running 339 sub problems to find dead transitions.
[2026-05-24 01:36:55] [INFO ] Flow matrix only has 326 transitions (discarded 15 similar events)
[2026-05-24 01:36:55] [INFO ] Invariant cache hit.
[2026-05-24 01:36:55] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
At refinement iteration 4 (OVERLAPS) 326/425 variables, 99/109 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 57/166 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 3/169 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 0/169 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 1/426 variables, 1/170 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 0/170 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 10 (OVERLAPS) 0/426 variables, 0/170 constraints. Problems are: Problem set: 56 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 170 constraints, problems are : Problem set: 56 solved, 283 unsolved in 20353 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 56 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 1/8 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 4/12 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/12 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 3/99 variables, 1/13 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/13 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 6 (OVERLAPS) 326/425 variables, 99/112 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 57/169 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 225/394 constraints. Problems are: Problem set: 56 solved, 283 unsolved
Problem TDEAD283 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 2/396 constraints. Problems are: Problem set: 57 solved, 282 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD105 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 1/397 constraints. Problems are: Problem set: 62 solved, 277 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 5/402 constraints. Problems are: Problem set: 62 solved, 277 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/426 variables, and 408 constraints, problems are : Problem set: 62 solved, 277 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/100 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 225/339 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 50479ms problems are : Problem set: 62 solved, 277 unsolved
Search for dead transitions found 62 dead transitions in 50482ms
Found 62 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 62 transitions
Dead transitions reduction (with SMT) removed 62 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 100/101 places, 279/347 transitions.
Graph (complete) has 573 edges and 100 vertex of which 97 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 95 transition count 265
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 95 transition count 265
Applied a total of 5 rules in 14 ms. Remains 95 /100 variables (removed 5) and now considering 265/279 (removed 14) transitions.
[2026-05-24 01:37:46] [INFO ] Flow matrix only has 248 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5427459230943700444.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13405209036932097727.kers'
[2026-05-24 01:37:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5427459230943700444.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13405209036932097727.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 95 cols 1069 entries
Finished phase 1 with 84 SingleSign rule and 3 generalized
[2026-05-24 01:37:46] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13405209036932097727.kers
Total runtime 1 ms.
[2026-05-24 01:37:46] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-24 01:37:46] [INFO ] Flow matrix only has 248 transitions (discarded 17 similar events)
[2026-05-24 01:37:46] [INFO ] Invariant cache hit.
[2026-05-24 01:37:46] [INFO ] State equation strengthened by 48 read => feed constraints.
[2026-05-24 01:37:46] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 95/101 places, 265/347 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 51247 ms. Remains : 95/101 places, 265/347 transitions.
[2026-05-24 01:37:46] [INFO ] Flatten gal took : 8 ms
[2026-05-24 01:37:46] [INFO ] Flatten gal took : 8 ms
[2026-05-24 01:37:46] [INFO ] Input system was already deterministic with 265 transitions.
[2026-05-24 01:37:46] [INFO ] Flatten gal took : 7 ms
[2026-05-24 01:37:46] [INFO ] Flatten gal took : 8 ms
[2026-05-24 01:37:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality9028474076387200732.gal : 2 ms
[2026-05-24 01:37:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality1987613574585951230.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/CTLCardinality9028474076387200732.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1987613574585951230.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 01:38:16] [INFO ] Flatten gal took : 10 ms
[2026-05-24 01:38:16] [INFO ] Applying decomposition
[2026-05-24 01:38:16] [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/graph8472231063150473254.txt' '-o' '/tmp/graph8472231063150473254.bin' '-w' '/tmp/graph8472231063150473254.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8472231063150473254.bin' '-l' '-1' '-v' '-w' '/tmp/graph8472231063150473254.weights' '-q' '0' '-e' '0.001'
[2026-05-24 01:38:16] [INFO ] Decomposing Gal with order
[2026-05-24 01:38:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 01:38:16] [INFO ] Removed a total of 37 redundant transitions.
[2026-05-24 01:38:16] [INFO ] Flatten gal took : 15 ms
[2026-05-24 01:38:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 2 ms.
[2026-05-24 01:38:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality3259008665808755341.gal : 3 ms
[2026-05-24 01:38:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality3478216343284767463.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/CTLCardinality3259008665808755341.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3478216343284767463.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 : 101/101 places, 347/347 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 341
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 341
Applied a total of 2 rules in 9 ms. Remains 100 /101 variables (removed 1) and now considering 341/347 (removed 6) transitions.
[2026-05-24 01:38:46] [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-10235445117756852544.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8381745550101821665.kers'
[2026-05-24 01:38:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10235445117756852544.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8381745550101821665.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 01:38:46] [INFO ] Computed 9 invariants in 3 ms
Computed 9 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-8381745550101821665.kers
Total runtime 5 ms.
[2026-05-24 01:38:47] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-24 01:38:47] [INFO ] Flow matrix only has 326 transitions (discarded 15 similar events)
[2026-05-24 01:38:47] [INFO ] Invariant cache hit.
[2026-05-24 01:38:47] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-24 01:38:47] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 339 sub problems to find dead transitions.
[2026-05-24 01:38:47] [INFO ] Flow matrix only has 326 transitions (discarded 15 similar events)
[2026-05-24 01:38:47] [INFO ] Invariant cache hit.
[2026-05-24 01:38:47] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
At refinement iteration 4 (OVERLAPS) 326/425 variables, 99/109 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 57/166 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 3/169 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 0/169 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 1/426 variables, 1/170 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 0/170 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 10 (OVERLAPS) 0/426 variables, 0/170 constraints. Problems are: Problem set: 56 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 170 constraints, problems are : Problem set: 56 solved, 283 unsolved in 20817 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 56 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 1/8 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 4/12 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/12 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 3/99 variables, 1/13 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/13 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 6 (OVERLAPS) 326/425 variables, 99/112 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 57/169 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 225/394 constraints. Problems are: Problem set: 56 solved, 283 unsolved
Problem TDEAD283 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 2/396 constraints. Problems are: Problem set: 57 solved, 282 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD105 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 1/397 constraints. Problems are: Problem set: 62 solved, 277 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 5/402 constraints. Problems are: Problem set: 62 solved, 277 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/426 variables, and 408 constraints, problems are : Problem set: 62 solved, 277 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/100 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 225/339 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 50950ms problems are : Problem set: 62 solved, 277 unsolved
Search for dead transitions found 62 dead transitions in 50952ms
Found 62 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 62 transitions
Dead transitions reduction (with SMT) removed 62 transitions
Starting structural reductions in LTL mode, iteration 1 : 100/101 places, 279/347 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 97 transition count 279
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 95 transition count 265
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 95 transition count 265
Applied a total of 7 rules in 3 ms. Remains 95 /100 variables (removed 5) and now considering 265/279 (removed 14) transitions.
[2026-05-24 01:39:38] [INFO ] Flow matrix only has 248 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6754959796134285891.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17091368404896040529.kers'
[2026-05-24 01:39:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6754959796134285891.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17091368404896040529.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 95 cols 1069 entries
Finished phase 1 with 84 SingleSign rule and 3 generalized
[2026-05-24 01:39:38] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17091368404896040529.kers
Total runtime 3 ms.
[2026-05-24 01:39:38] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-24 01:39:38] [INFO ] Flow matrix only has 248 transitions (discarded 17 similar events)
[2026-05-24 01:39:38] [INFO ] Invariant cache hit.
[2026-05-24 01:39:38] [INFO ] State equation strengthened by 48 read => feed constraints.
[2026-05-24 01:39:38] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 95/101 places, 265/347 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51579 ms. Remains : 95/101 places, 265/347 transitions.
[2026-05-24 01:39:38] [INFO ] Flatten gal took : 9 ms
[2026-05-24 01:39:38] [INFO ] Flatten gal took : 7 ms
[2026-05-24 01:39:38] [INFO ] Input system was already deterministic with 265 transitions.
[2026-05-24 01:39:38] [INFO ] Flatten gal took : 6 ms
[2026-05-24 01:39:38] [INFO ] Flatten gal took : 6 ms
[2026-05-24 01:39:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality8989706262231248563.gal : 2 ms
[2026-05-24 01:39:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality7251005050574787933.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/CTLCardinality8989706262231248563.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7251005050574787933.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 01:40:08] [INFO ] Flatten gal took : 9 ms
[2026-05-24 01:40:08] [INFO ] Applying decomposition
[2026-05-24 01:40:08] [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/graph12460762645867699744.txt' '-o' '/tmp/graph12460762645867699744.bin' '-w' '/tmp/graph12460762645867699744.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12460762645867699744.bin' '-l' '-1' '-v' '-w' '/tmp/graph12460762645867699744.weights' '-q' '0' '-e' '0.001'
[2026-05-24 01:40:08] [INFO ] Decomposing Gal with order
[2026-05-24 01:40:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 01:40:08] [INFO ] Removed a total of 31 redundant transitions.
[2026-05-24 01:40:08] [INFO ] Flatten gal took : 12 ms
[2026-05-24 01:40:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 1 ms.
[2026-05-24 01:40:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality5612192360353420551.gal : 3 ms
[2026-05-24 01:40:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality11243011859075070916.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/CTLCardinality5612192360353420551.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11243011859075070916.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 : 101/101 places, 347/347 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 341
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 341
Applied a total of 2 rules in 3 ms. Remains 100 /101 variables (removed 1) and now considering 341/347 (removed 6) transitions.
[2026-05-24 01:40:38] [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-120212701927670668.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13223393768668018640.kers'
[2026-05-24 01:40:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-120212701927670668.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13223393768668018640.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 01:40:38] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13223393768668018640.kers
Total runtime 2 ms.
[2026-05-24 01:40:38] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-24 01:40:38] [INFO ] Flow matrix only has 326 transitions (discarded 15 similar events)
[2026-05-24 01:40:38] [INFO ] Invariant cache hit.
[2026-05-24 01:40:38] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-24 01:40:39] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Running 339 sub problems to find dead transitions.
[2026-05-24 01:40:39] [INFO ] Flow matrix only has 326 transitions (discarded 15 similar events)
[2026-05-24 01:40:39] [INFO ] Invariant cache hit.
[2026-05-24 01:40:39] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
At refinement iteration 4 (OVERLAPS) 326/425 variables, 99/109 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 57/166 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 3/169 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 0/169 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 1/426 variables, 1/170 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 0/170 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 10 (OVERLAPS) 0/426 variables, 0/170 constraints. Problems are: Problem set: 56 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 170 constraints, problems are : Problem set: 56 solved, 283 unsolved in 20700 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 56 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 1/8 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 4/12 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/12 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 3/99 variables, 1/13 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/13 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 6 (OVERLAPS) 326/425 variables, 99/112 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 57/169 constraints. Problems are: Problem set: 56 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 225/394 constraints. Problems are: Problem set: 56 solved, 283 unsolved
Problem TDEAD283 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 2/396 constraints. Problems are: Problem set: 57 solved, 282 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD105 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 1/397 constraints. Problems are: Problem set: 62 solved, 277 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 5/402 constraints. Problems are: Problem set: 62 solved, 277 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/426 variables, and 408 constraints, problems are : Problem set: 62 solved, 277 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/100 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 225/339 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 50839ms problems are : Problem set: 62 solved, 277 unsolved
Search for dead transitions found 62 dead transitions in 50841ms
Found 62 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 62 transitions
Dead transitions reduction (with SMT) removed 62 transitions
Starting structural reductions in LTL mode, iteration 1 : 100/101 places, 279/347 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 97 transition count 279
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 95 transition count 265
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 95 transition count 265
Applied a total of 7 rules in 3 ms. Remains 95 /100 variables (removed 5) and now considering 265/279 (removed 14) transitions.
[2026-05-24 01:41:29] [INFO ] Flow matrix only has 248 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3937434371161619873.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2109351059709626985.kers'
[2026-05-24 01:41:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3937434371161619873.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2109351059709626985.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 95 cols 1069 entries
Finished phase 1 with 84 SingleSign rule and 3 generalized
[2026-05-24 01:41:29] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2109351059709626985.kers
Total runtime 1 ms.
[2026-05-24 01:41:30] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-24 01:41:30] [INFO ] Flow matrix only has 248 transitions (discarded 17 similar events)
[2026-05-24 01:41:30] [INFO ] Invariant cache hit.
[2026-05-24 01:41:30] [INFO ] State equation strengthened by 48 read => feed constraints.
[2026-05-24 01:41:30] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 95/101 places, 265/347 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51479 ms. Remains : 95/101 places, 265/347 transitions.
[2026-05-24 01:41:30] [INFO ] Flatten gal took : 6 ms
[2026-05-24 01:41:30] [INFO ] Flatten gal took : 6 ms
[2026-05-24 01:41:30] [INFO ] Input system was already deterministic with 265 transitions.
[2026-05-24 01:41:30] [INFO ] Flatten gal took : 6 ms
[2026-05-24 01:41:30] [INFO ] Flatten gal took : 6 ms
[2026-05-24 01:41:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality802156713201287485.gal : 2 ms
[2026-05-24 01:41:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality10072554495938114220.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/CTLCardinality802156713201287485.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10072554495938114220.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 01:42:00] [INFO ] Flatten gal took : 6 ms
[2026-05-24 01:42:00] [INFO ] Applying decomposition
[2026-05-24 01:42:00] [INFO ] Flatten gal took : 5 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/graph13709702841129836302.txt' '-o' '/tmp/graph13709702841129836302.bin' '-w' '/tmp/graph13709702841129836302.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13709702841129836302.bin' '-l' '-1' '-v' '-w' '/tmp/graph13709702841129836302.weights' '-q' '0' '-e' '0.001'
[2026-05-24 01:42:00] [INFO ] Decomposing Gal with order
[2026-05-24 01:42:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 01:42:00] [INFO ] Removed a total of 31 redundant transitions.
[2026-05-24 01:42:00] [INFO ] Flatten gal took : 16 ms
[2026-05-24 01:42:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 2 ms.
[2026-05-24 01:42:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality9300900132418166942.gal : 2 ms
[2026-05-24 01:42:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality9108474846647703882.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/CTLCardinality9300900132418166942.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9108474846647703882.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 01:42:30] [INFO ] Flatten gal took : 7 ms
[2026-05-24 01:42:30] [INFO ] Flatten gal took : 8 ms
[2026-05-24 01:42:30] [INFO ] Applying decomposition
[2026-05-24 01:42:30] [INFO ] Flatten gal took : 7 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/graph9016133134328505510.txt' '-o' '/tmp/graph9016133134328505510.bin' '-w' '/tmp/graph9016133134328505510.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9016133134328505510.bin' '-l' '-1' '-v' '-w' '/tmp/graph9016133134328505510.weights' '-q' '0' '-e' '0.001'
[2026-05-24 01:42:30] [INFO ] Decomposing Gal with order
[2026-05-24 01:42:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 01:42:30] [INFO ] Removed a total of 22 redundant transitions.
[2026-05-24 01:42:30] [INFO ] Flatten gal took : 14 ms
[2026-05-24 01:42:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 0 ms.
[2026-05-24 01:42:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality11652920114895921000.gal : 2 ms
[2026-05-24 01:42:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality13345539652996088556.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/CTLCardinality11652920114895921000.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13345539652996088556.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 5 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 02:06:23] [INFO ] Flatten gal took : 108 ms
[2026-05-24 02:06:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality10361924854575563923.gal : 18 ms
[2026-05-24 02:06:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality4870048653463235952.ctl : 4 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/CTLCardinality10361924854575563923.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4870048653463235952.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.
Detected timeout of ITS tools.
[2026-05-24 02:30:14] [INFO ] Flatten gal took : 51 ms
[2026-05-24 02:30:14] [INFO ] Input system was already deterministic with 347 transitions.
[2026-05-24 02:30:15] [INFO ] Transformed 101 places.
[2026-05-24 02:30:15] [INFO ] Transformed 347 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-24 02:30:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality14709304579097955993.gal : 9 ms
[2026-05-24 02:30:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality4512444616459438007.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/CTLCardinality14709304579097955993.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4512444616459438007.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...329
Successfully loaded order from file /home/mcc/execution/model.ord
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-q3m032"
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-q3m032, 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-177946841900353"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m032.tgz
mv BugTracking-PT-q3m032 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 ;