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-177946841900331.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-q3m004, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946841900331
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.6K Mar 5 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Mar 5 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 5 16:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 5 16:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Mar 15 07:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 07:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 5 16:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 5 16:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 5 16:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Mar 5 16:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 07:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:38 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-q3m004-LTLCardinality-00
FORMULA_NAME BugTracking-PT-q3m004-LTLCardinality-01
FORMULA_NAME BugTracking-PT-q3m004-LTLCardinality-02
FORMULA_NAME BugTracking-PT-q3m004-LTLCardinality-03
FORMULA_NAME BugTracking-PT-q3m004-LTLCardinality-04
FORMULA_NAME BugTracking-PT-q3m004-LTLCardinality-05
FORMULA_NAME BugTracking-PT-q3m004-LTLCardinality-06
FORMULA_NAME BugTracking-PT-q3m004-LTLCardinality-07
FORMULA_NAME BugTracking-PT-q3m004-LTLCardinality-08
FORMULA_NAME BugTracking-PT-q3m004-LTLCardinality-09
FORMULA_NAME BugTracking-PT-q3m004-LTLCardinality-10
FORMULA_NAME BugTracking-PT-q3m004-LTLCardinality-11
FORMULA_NAME BugTracking-PT-q3m004-LTLCardinality-12
FORMULA_NAME BugTracking-PT-q3m004-LTLCardinality-13
FORMULA_NAME BugTracking-PT-q3m004-LTLCardinality-14
FORMULA_NAME BugTracking-PT-q3m004-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779582033848

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m004
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 00:20:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 00:20:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 00:20:35] [INFO ] Load time of PNML (sax parser for PT used): 869 ms
[2026-05-24 00:20:36] [INFO ] Transformed 754 places.
[2026-05-24 00:20:36] [INFO ] Transformed 27370 transitions.
[2026-05-24 00:20:36] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1131 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 514 places in 115 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m004-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 6 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 238 transition count 2769
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 237 transition count 2750
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 237 transition count 2750
Applied a total of 4 rules in 78 ms. Remains 237 /240 variables (removed 3) and now considering 2750/2769 (removed 19) transitions.
[2026-05-24 00:20:36] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14792898998605256661.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7499272308037747881.kers'
[2026-05-24 00:20:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14792898998605256661.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7499272308037747881.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2626 rows 237 cols 12413 entries
Finished phase 1 with 229 SingleSign rule and 0 generalized
[2026-05-24 00:20:36] [INFO ] Computed 8 invariants in 9 ms
Computed 8 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-7499272308037747881.kers
Total runtime 12 ms.
[2026-05-24 00:20:37] [INFO ] Implicit Places using invariants in 526 ms returned []
[2026-05-24 00:20:37] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2026-05-24 00:20:37] [INFO ] Invariant cache hit.
[2026-05-24 00:20:37] [INFO ] State equation strengthened by 240 read => feed constraints.
[2026-05-24 00:20:40] [INFO ] Implicit Places using invariants and state equation in 3771 ms returned []
Implicit Place search using SMT with State Equation took 4341 ms to find 0 implicit places.
Running 2748 sub problems to find dead transitions.
[2026-05-24 00:20:41] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2026-05-24 00:20:41] [INFO ] Invariant cache hit.
[2026-05-24 00:20:41] [INFO ] State equation strengthened by 240 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2748 unsolved
Problem TDEAD1005 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/2863 variables, and 12 constraints, problems are : Problem set: 14 solved, 2734 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/237 constraints, ReadFeed: 0/240 constraints, PredecessorRefiner: 2748/1219 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 14 solved, 2734 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 8/8 constraints. Problems are: Problem set: 14 solved, 2734 unsolved
Problem TDEAD2310 is UNSAT
Problem TDEAD2318 is UNSAT
Problem TDEAD2329 is UNSAT
Problem TDEAD2330 is UNSAT
Problem TDEAD2356 is UNSAT
Problem TDEAD2364 is UNSAT
Problem TDEAD2375 is UNSAT
Problem TDEAD2376 is UNSAT
Problem TDEAD2379 is UNSAT
Problem TDEAD2380 is UNSAT
Problem TDEAD2381 is UNSAT
Problem TDEAD2382 is UNSAT
Problem TDEAD2383 is UNSAT
Problem TDEAD2384 is UNSAT
Problem TDEAD2385 is UNSAT
Problem TDEAD2386 is UNSAT
Problem TDEAD2387 is UNSAT
Problem TDEAD2391 is UNSAT
Problem TDEAD2392 is UNSAT
Problem TDEAD2393 is UNSAT
Problem TDEAD2394 is UNSAT
Problem TDEAD2395 is UNSAT
Problem TDEAD2396 is UNSAT
Problem TDEAD2397 is UNSAT
Problem TDEAD2398 is UNSAT
Problem TDEAD2399 is UNSAT
Problem TDEAD2400 is UNSAT
Problem TDEAD2401 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 4/12 constraints. Problems are: Problem set: 42 solved, 2706 unsolved
Problem TDEAD2319 is UNSAT
Problem TDEAD2333 is UNSAT
Problem TDEAD2334 is UNSAT
Problem TDEAD2335 is UNSAT
Problem TDEAD2336 is UNSAT
Problem TDEAD2337 is UNSAT
Problem TDEAD2338 is UNSAT
Problem TDEAD2339 is UNSAT
Problem TDEAD2340 is UNSAT
Problem TDEAD2341 is UNSAT
Problem TDEAD2342 is UNSAT
Problem TDEAD2343 is UNSAT
Problem TDEAD2344 is UNSAT
Problem TDEAD2345 is UNSAT
Problem TDEAD2346 is UNSAT
Problem TDEAD2347 is UNSAT
Problem TDEAD2348 is UNSAT
Problem TDEAD2349 is UNSAT
Problem TDEAD2350 is UNSAT
Problem TDEAD2351 is UNSAT
Problem TDEAD2352 is UNSAT
Problem TDEAD2365 is UNSAT
Problem TDEAD2674 is UNSAT
Problem TDEAD2675 is UNSAT
Problem TDEAD2676 is UNSAT
Problem TDEAD2677 is UNSAT
Problem TDEAD2678 is UNSAT
Problem TDEAD2679 is UNSAT
Problem TDEAD2680 is UNSAT
Problem TDEAD2681 is UNSAT
Problem TDEAD2682 is UNSAT
Problem TDEAD2683 is UNSAT
Problem TDEAD2684 is UNSAT
Problem TDEAD2685 is UNSAT
Problem TDEAD2686 is UNSAT
Problem TDEAD2687 is UNSAT
Problem TDEAD2688 is UNSAT
Problem TDEAD2691 is UNSAT
Problem TDEAD2692 is UNSAT
Problem TDEAD2693 is UNSAT
Problem TDEAD2694 is UNSAT
Problem TDEAD2695 is UNSAT
Problem TDEAD2696 is UNSAT
Problem TDEAD2697 is UNSAT
Problem TDEAD2698 is UNSAT
Problem TDEAD2699 is UNSAT
Problem TDEAD2700 is UNSAT
Problem TDEAD2701 is UNSAT
Problem TDEAD2702 is UNSAT
Problem TDEAD2703 is UNSAT
Problem TDEAD2704 is UNSAT
Problem TDEAD2705 is UNSAT
Problem TDEAD2708 is UNSAT
Problem TDEAD2709 is UNSAT
Problem TDEAD2710 is UNSAT
Problem TDEAD2711 is UNSAT
Problem TDEAD2712 is UNSAT
Problem TDEAD2713 is UNSAT
Problem TDEAD2714 is UNSAT
Problem TDEAD2715 is UNSAT
Problem TDEAD2718 is UNSAT
Problem TDEAD2719 is UNSAT
Problem TDEAD2720 is UNSAT
Problem TDEAD2721 is UNSAT
Problem TDEAD2722 is UNSAT
Problem TDEAD2723 is UNSAT
Problem TDEAD2724 is UNSAT
Problem TDEAD2725 is UNSAT
Problem TDEAD2726 is UNSAT
Problem TDEAD2729 is UNSAT
Problem TDEAD2730 is UNSAT
Problem TDEAD2731 is UNSAT
Problem TDEAD2732 is UNSAT
Problem TDEAD2733 is UNSAT
Problem TDEAD2734 is UNSAT
Problem TDEAD2735 is UNSAT
Problem TDEAD2736 is UNSAT
Problem TDEAD2737 is UNSAT
Problem TDEAD2738 is UNSAT
Problem TDEAD2739 is UNSAT
Problem TDEAD2740 is UNSAT
Problem TDEAD2741 is UNSAT
Problem TDEAD2742 is UNSAT
Problem TDEAD2743 is UNSAT
Problem TDEAD2744 is UNSAT
Problem TDEAD2745 is UNSAT
Problem TDEAD2746 is UNSAT
Problem TDEAD2747 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 10/22 constraints. Problems are: Problem set: 130 solved, 2618 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 236/2863 variables, and 22 constraints, problems are : Problem set: 130 solved, 2618 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/237 constraints, ReadFeed: 0/240 constraints, PredecessorRefiner: 1529/1219 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64338ms problems are : Problem set: 130 solved, 2618 unsolved
Search for dead transitions found 130 dead transitions in 64374ms
Found 130 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 130 transitions
Dead transitions reduction (with SMT) removed 130 transitions
Starting structural reductions in LTL mode, iteration 1 : 237/240 places, 2620/2769 transitions.
Reduce places removed 35 places and 829 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 202 transition count 1791
Reduce places removed 23 places and 281 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 58 place count 179 transition count 1510
Reduce places removed 12 places and 167 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 70 place count 167 transition count 1343
Reduce places removed 6 places and 114 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 76 place count 161 transition count 1229
Reduce places removed 1 places and 17 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 77 place count 160 transition count 1212
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 79 place count 158 transition count 1174
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 16 places and 264 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 97 place count 142 transition count 910
Deduced a syphon composed of 2 places in 2 ms
Applied a total of 97 rules in 25 ms. Remains 142 /237 variables (removed 95) and now considering 910/2620 (removed 1710) transitions.
[2026-05-24 00:21:45] [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-9521416383289344450.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6932242436327516380.kers'
[2026-05-24 00:21:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9521416383289344450.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6932242436327516380.kers]
Culling trivial invariants: removing 2 columns.
Culled 2 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 00:21:45] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6932242436327516380.kers
Total runtime 3 ms.
[2026-05-24 00:21:45] [INFO ] Implicit Places using invariants in 274 ms returned []
[2026-05-24 00:21:45] [INFO ] Flow matrix only has 868 transitions (discarded 42 similar events)
[2026-05-24 00:21:45] [INFO ] Invariant cache hit.
[2026-05-24 00:21:45] [INFO ] State equation strengthened by 115 read => feed constraints.
[2026-05-24 00:21:46] [INFO ] Implicit Places using invariants and state equation in 831 ms returned []
Implicit Place search using SMT with State Equation took 1108 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 142/240 places, 910/2769 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69999 ms. Remains : 142/240 places, 910/2769 transitions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 910/910 transitions.
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 0 rules in 5 ms. Remains 142 /142 variables (removed 0) and now considering 910/910 (removed 0) transitions.
[2026-05-24 00:21:46] [INFO ] Flow matrix only has 868 transitions (discarded 42 similar events)
[2026-05-24 00:21:46] [INFO ] Invariant cache hit.
[2026-05-24 00:21:46] [INFO ] Implicit Places using invariants in 170 ms returned []
[2026-05-24 00:21:46] [INFO ] Flow matrix only has 868 transitions (discarded 42 similar events)
[2026-05-24 00:21:46] [INFO ] Invariant cache hit.
[2026-05-24 00:21:46] [INFO ] State equation strengthened by 115 read => feed constraints.
[2026-05-24 00:21:47] [INFO ] Implicit Places using invariants and state equation in 794 ms returned []
Implicit Place search using SMT with State Equation took 970 ms to find 0 implicit places.
Running 908 sub problems to find dead transitions.
[2026-05-24 00:21:47] [INFO ] Flow matrix only has 868 transitions (discarded 42 similar events)
[2026-05-24 00:21:47] [INFO ] Invariant cache hit.
[2026-05-24 00:21:47] [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
Error getting values : (error "Timeout of Z3 solver reached")
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/1010 variables, and 265 constraints, problems are : Problem set: 151 solved, 757 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 8/10 constraints, State Equation: 140/142 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
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1010 variables, and 925 constraints, problems are : Problem set: 190 solved, 718 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 8/10 constraints, State Equation: 139/142 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 660/908 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60791ms problems are : Problem set: 190 solved, 718 unsolved
Search for dead transitions found 190 dead transitions in 60795ms
Found 190 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 190 transitions
Dead transitions reduction (with SMT) removed 190 transitions
Starting structural reductions in LTL mode, iteration 1 : 142/142 places, 720/910 transitions.
Reduce places removed 16 places and 192 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 126 transition count 528
Reduce places removed 14 places and 71 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 30 place count 112 transition count 457
Reduce places removed 2 places and 18 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 110 transition count 439
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 34 place count 108 transition count 423
Reduce places removed 1 places and 16 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 35 place count 107 transition count 407
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 37 place count 105 transition count 389
Deduced a syphon composed of 2 places in 2 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 39 place count 105 transition count 389
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 39 rules in 17 ms. Remains 105 /142 variables (removed 37) and now considering 389/720 (removed 331) transitions.
[2026-05-24 00:22:48] [INFO ] Flow matrix only has 365 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17593092153205187951.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1820461117042868888.kers'
[2026-05-24 00:22:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17593092153205187951.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1820461117042868888.kers]
Culling trivial invariants: removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 365 rows 103 cols 1621 entries
Finished phase 1 with 91 SingleSign rule and 3 generalized
[2026-05-24 00:22:48] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1820461117042868888.kers
Total runtime 1 ms.
[2026-05-24 00:22:48] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-24 00:22:48] [INFO ] Flow matrix only has 365 transitions (discarded 24 similar events)
[2026-05-24 00:22:48] [INFO ] Invariant cache hit.
[2026-05-24 00:22:48] [INFO ] State equation strengthened by 59 read => feed constraints.
[2026-05-24 00:22:48] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 105/142 places, 389/910 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62127 ms. Remains : 105/142 places, 389/910 transitions.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Support contains 3 out of 103 places after structural reductions.
FORMULA BugTracking-PT-q3m004-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 00:22:48] [INFO ] Flatten gal took : 62 ms
[2026-05-24 00:22:48] [INFO ] Flatten gal took : 31 ms
[2026-05-24 00:22:49] [INFO ] Input system was already deterministic with 389 transitions.
RANDOM walk for 40002 steps (446 resets) in 1602 ms. (24 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (100 resets) in 314 ms. (126 steps per ms) remains 1/1 properties
[2026-05-24 00:22:49] [INFO ] Flow matrix only has 365 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9410745897877532444.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16276800736752056987.kers'
[2026-05-24 00:22:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9410745897877532444.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16276800736752056987.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 365 rows 103 cols 1621 entries
Finished phase 1 with 91 SingleSign rule and 3 generalized
[2026-05-24 00:22:49] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16276800736752056987.kers
Total runtime 1 ms.
[2026-05-24 00:22:49] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Real declared 6/468 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 16 ms.
Refiners :[Positive P Invariants (semi-flows): 2/8 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/103 constraints, ReadFeed: 0/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 2 simplifications.
FORMULA BugTracking-PT-q3m004-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 23 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 389/389 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 102 transition count 383
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 102 transition count 383
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 383
Applied a total of 4 rules in 22 ms. Remains 101 /103 variables (removed 2) and now considering 383/389 (removed 6) transitions.
[2026-05-24 00:22:49] [INFO ] Flow matrix only has 359 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13520852321829588355.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7598364071648544640.kers'
[2026-05-24 00:22:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13520852321829588355.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7598364071648544640.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 359 rows 101 cols 1594 entries
Finished phase 1 with 89 SingleSign rule and 3 generalized
[2026-05-24 00:22:49] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7598364071648544640.kers
Total runtime 2 ms.
[2026-05-24 00:22:49] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-24 00:22:49] [INFO ] Flow matrix only has 359 transitions (discarded 24 similar events)
[2026-05-24 00:22:49] [INFO ] Invariant cache hit.
[2026-05-24 00:22:49] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-24 00:22:50] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2026-05-24 00:22:50] [INFO ] Redundant transitions in 25 ms returned []
Running 381 sub problems to find dead transitions.
[2026-05-24 00:22:50] [INFO ] Flow matrix only has 359 transitions (discarded 24 similar events)
[2026-05-24 00:22:50] [INFO ] Invariant cache hit.
[2026-05-24 00:22:50] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 4 (OVERLAPS) 359/459 variables, 100/110 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 60/170 constraints. Problems are: Problem set: 0 solved, 381 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 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
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 5/175 constraints. Problems are: Problem set: 66 solved, 315 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 0/175 constraints. Problems are: Problem set: 66 solved, 315 unsolved
At refinement iteration 8 (OVERLAPS) 1/460 variables, 1/176 constraints. Problems are: Problem set: 66 solved, 315 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 0/176 constraints. Problems are: Problem set: 66 solved, 315 unsolved
At refinement iteration 10 (OVERLAPS) 0/460 variables, 0/176 constraints. Problems are: Problem set: 66 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 176 constraints, problems are : Problem set: 66 solved, 315 unsolved in 24815 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 66 solved, 315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 66 solved, 315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/8 constraints. Problems are: Problem set: 66 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 6/14 constraints. Problems are: Problem set: 66 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/15 constraints. Problems are: Problem set: 66 solved, 315 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/15 constraints. Problems are: Problem set: 66 solved, 315 unsolved
At refinement iteration 5 (OVERLAPS) 3/100 variables, 1/16 constraints. Problems are: Problem set: 66 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/16 constraints. Problems are: Problem set: 66 solved, 315 unsolved
At refinement iteration 7 (OVERLAPS) 359/459 variables, 100/116 constraints. Problems are: Problem set: 66 solved, 315 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 60/176 constraints. Problems are: Problem set: 66 solved, 315 unsolved
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 257/433 constraints. Problems are: Problem set: 70 solved, 311 unsolved
Problem TDEAD321 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 1/434 constraints. Problems are: Problem set: 71 solved, 310 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD105 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/459 variables, 1/435 constraints. Problems are: Problem set: 76 solved, 305 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/459 variables, 10/445 constraints. Problems are: Problem set: 76 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/460 variables, and 445 constraints, problems are : Problem set: 76 solved, 305 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/101 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 257/381 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 55044ms problems are : Problem set: 76 solved, 305 unsolved
Search for dead transitions found 76 dead transitions in 55046ms
Found 76 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 76 transitions
Dead transitions reduction (with SMT) removed 76 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 101/103 places, 307/389 transitions.
Graph (complete) has 598 edges and 101 vertex of which 98 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 4 places and 34 transitions.
Reduce places removed 2 places and 14 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 92 transition count 259
Reduce places removed 2 places and 11 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 90 transition count 248
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 7 place count 88 transition count 234
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 88 transition count 234
Applied a total of 9 rules in 18 ms. Remains 88 /101 variables (removed 13) and now considering 234/307 (removed 73) transitions.
[2026-05-24 00:23:45] [INFO ] Flow matrix only has 218 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-17099164124604426468.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5396897420100507400.kers'
[2026-05-24 00:23:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17099164124604426468.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5396897420100507400.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 218 rows 88 cols 931 entries
Finished phase 1 with 77 SingleSign rule and 3 generalized
[2026-05-24 00:23:45] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5396897420100507400.kers
Total runtime 1 ms.
[2026-05-24 00:23:45] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-24 00:23:45] [INFO ] Flow matrix only has 218 transitions (discarded 16 similar events)
[2026-05-24 00:23:45] [INFO ] Invariant cache hit.
[2026-05-24 00:23:45] [INFO ] State equation strengthened by 48 read => feed constraints.
[2026-05-24 00:23:45] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 88/103 places, 234/389 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 55664 ms. Remains : 88/103 places, 234/389 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BugTracking-PT-q3m004-LTLCardinality-14
Product exploration explored 100000 steps with 2948 reset in 264 ms.
Stack based approach found an accepted trace after 7646 steps with 213 reset with depth 83 and stack size 83 in 17 ms.
FORMULA BugTracking-PT-q3m004-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property BugTracking-PT-q3m004-LTLCardinality-14 finished in 56196 ms.
All properties solved by simple procedures.
Total runtime 190845 ms.

BK_STOP 1779582225946

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

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