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.r338-smll-178021499300425.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 FileSystem-PT-N02I15B15, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499300425
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K May 27 10:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 27 10:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 27 10:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 27 10:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 45K May 27 10:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 157K May 27 10:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 27 10:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 27 10:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 4.5K May 27 10:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K May 27 10:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 27 10:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K May 27 10:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 17K May 27 10:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 39K May 27 10:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 10 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 524K Jun 10 11:57 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 FileSystem-PT-N02I15B15-CTLCardinality-2024-00
FORMULA_NAME FileSystem-PT-N02I15B15-CTLCardinality-2024-01
FORMULA_NAME FileSystem-PT-N02I15B15-CTLCardinality-2024-02
FORMULA_NAME FileSystem-PT-N02I15B15-CTLCardinality-2024-03
FORMULA_NAME FileSystem-PT-N02I15B15-CTLCardinality-2024-04
FORMULA_NAME FileSystem-PT-N02I15B15-CTLCardinality-2024-05
FORMULA_NAME FileSystem-PT-N02I15B15-CTLCardinality-2024-06
FORMULA_NAME FileSystem-PT-N02I15B15-CTLCardinality-2024-07
FORMULA_NAME FileSystem-PT-N02I15B15-CTLCardinality-2024-08
FORMULA_NAME FileSystem-PT-N02I15B15-CTLCardinality-2024-09
FORMULA_NAME FileSystem-PT-N02I15B15-CTLCardinality-2024-10
FORMULA_NAME FileSystem-PT-N02I15B15-CTLCardinality-2024-11
FORMULA_NAME FileSystem-PT-N02I15B15-CTLCardinality-2024-12
FORMULA_NAME FileSystem-PT-N02I15B15-CTLCardinality-2024-13
FORMULA_NAME FileSystem-PT-N02I15B15-CTLCardinality-2024-14
FORMULA_NAME FileSystem-PT-N02I15B15-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1781104150959

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FileSystem-PT-N02I15B15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-06-10 15:09:13] [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-06-10 15:09:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-10 15:09:14] [INFO ] Load time of PNML (sax parser for PT used): 329 ms
[2026-06-10 15:09:14] [INFO ] Transformed 1216 places.
[2026-06-10 15:09:14] [INFO ] Transformed 1155 transitions.
[2026-06-10 15:09:14] [INFO ] Parsed PT model containing 1216 places and 1155 transitions and 4125 arcs in 598 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 26 ms.
Reduce places removed 15 places and 0 transitions.
Support contains 101 out of 1201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1201/1201 places, 1155/1155 transitions.
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 991 transition count 1155
Discarding 178 places :
Symmetric choice reduction at 1 with 178 rule applications. Total rules 388 place count 813 transition count 977
Iterating global reduction 1 with 178 rules applied. Total rules applied 566 place count 813 transition count 977
Applied a total of 566 rules in 278 ms. Remains 813 /1201 variables (removed 388) and now considering 977/1155 (removed 178) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11393372221919569758.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9838682591553330073.kers'
[2026-06-10 15:09:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11393372221919569758.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9838682591553330073.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 1 ms.
// Phase 1: matrix 977 rows 798 cols 2706 entries
Finished phase 1 with 781 SingleSign rule and 0 generalized
[2026-06-10 15:09:14] [INFO ] Computed 32 invariants in 18 ms
Computed 32 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-9838682591553330073.kers
Total runtime 22 ms.
[2026-06-10 15:09:16] [INFO ] Implicit Places using invariants in 1835 ms returned []
[2026-06-10 15:09:16] [INFO ] Invariant cache hit.
[2026-06-10 15:09:17] [INFO ] State equation strengthened by 225 read => feed constraints.
[2026-06-10 15:09:27] [INFO ] Implicit Places using invariants and state equation in 10672 ms returned []
Implicit Place search using SMT with State Equation took 12579 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2026-06-10 15:09:27] [INFO ] Invariant cache hit.
[2026-06-10 15:09:27] [INFO ] State equation strengthened by 225 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/782 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 782/1790 variables, and 30 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 30/32 constraints, State Equation: 0/813 constraints, ReadFeed: 0/225 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/782 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 782/1790 variables, and 30 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 30/32 constraints, State Equation: 0/813 constraints, ReadFeed: 0/225 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60804ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60845ms
Starting structural reductions in LTL mode, iteration 1 : 813/1201 places, 977/1155 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73783 ms. Remains : 813/1201 places, 977/1155 transitions.
Starting structural reductions in LTL mode, iteration 0 : 813/813 places, 977/977 transitions.
Applied a total of 0 rules in 31 ms. Remains 813 /813 variables (removed 0) and now considering 977/977 (removed 0) transitions.
[2026-06-10 15:10:28] [INFO ] Invariant cache hit.
[2026-06-10 15:10:29] [INFO ] Implicit Places using invariants in 981 ms returned []
[2026-06-10 15:10:29] [INFO ] Invariant cache hit.
[2026-06-10 15:10:29] [INFO ] State equation strengthened by 225 read => feed constraints.
[2026-06-10 15:10:39] [INFO ] Implicit Places using invariants and state equation in 9980 ms returned []
Implicit Place search using SMT with State Equation took 10968 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 11002 ms. Remains : 813/813 places, 977/977 transitions.
Support contains 101 out of 813 places after structural reductions.
[2026-06-10 15:10:39] [INFO ] Flatten gal took : 169 ms
[2026-06-10 15:10:39] [INFO ] Flatten gal took : 105 ms
[2026-06-10 15:10:39] [INFO ] Input system was already deterministic with 977 transitions.
Support contains 98 out of 813 places (down from 101) after GAL structural reductions.
RANDOM walk for 40000 steps (524 resets) in 2592 ms. (15 steps per ms) remains 61/64 properties
BEST_FIRST walk for 4003 steps (11 resets) in 44 ms. (88 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (10 resets) in 33 ms. (117 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (11 resets) in 25 ms. (153 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (11 resets) in 75 ms. (52 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (12 resets) in 61 ms. (64 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (9 resets) in 41 ms. (95 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (11 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (12 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (10 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (11 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (10 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (10 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (10 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (12 resets) in 39 ms. (100 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (10 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (11 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (11 resets) in 26 ms. (148 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (11 resets) in 23 ms. (166 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (12 resets) in 56 ms. (70 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (11 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (11 resets) in 31 ms. (125 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (10 resets) in 32 ms. (121 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (10 resets) in 31 ms. (125 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (12 resets) in 31 ms. (125 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (10 resets) in 21 ms. (181 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (11 resets) in 22 ms. (174 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (11 resets) in 36 ms. (108 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (10 resets) in 33 ms. (117 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (12 resets) in 35 ms. (111 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (11 resets) in 26 ms. (148 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (12 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (11 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (12 resets) in 32 ms. (121 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (10 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (12 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (11 resets) in 59 ms. (66 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (11 resets) in 26 ms. (148 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (11 resets) in 36 ms. (108 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (11 resets) in 36 ms. (108 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (11 resets) in 22 ms. (174 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (11 resets) in 30 ms. (129 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (12 resets) in 22 ms. (174 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (10 resets) in 34 ms. (114 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (11 resets) in 33 ms. (117 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (10 resets) in 26 ms. (148 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (12 resets) in 26 ms. (148 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (11 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
Interrupted probabilistic random walk after 125015 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 61
Probabilistic random walk after 125015 steps, saw 38621 distinct states, run finished after 3011 ms. (steps per millisecond=41 ) properties seen :0
[2026-06-10 15:10:44] [INFO ] Invariant cache hit.
[2026-06-10 15:10:44] [INFO ] State equation strengthened by 225 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp61 is UNSAT
At refinement iteration 1 (OVERLAPS) 704/798 variables, 18/18 constraints. Problems are: Problem set: 24 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/798 variables, 0/18 constraints. Problems are: Problem set: 24 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 14/812 variables, 14/32 constraints. Problems are: Problem set: 24 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/812 variables, 0/32 constraints. Problems are: Problem set: 24 solved, 37 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp57 is UNSAT
At refinement iteration 5 (OVERLAPS) 977/1789 variables, 812/844 constraints. Problems are: Problem set: 29 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1789 variables, 225/1069 constraints. Problems are: Problem set: 29 solved, 32 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1789/1790 variables, and 1069 constraints, problems are : Problem set: 29 solved, 32 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 812/813 constraints, ReadFeed: 225/225 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 29 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 29 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 733/795 variables, 17/17 constraints. Problems are: Problem set: 29 solved, 32 unsolved
SMT process timed out in 10106ms, After SMT, problems are : Problem set: 29 solved, 32 unsolved
Fused 32 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 62 out of 813 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 813/813 places, 977/977 transitions.
Graph (complete) has 2016 edges and 813 vertex of which 810 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 810 transition count 964
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 797 transition count 964
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 40 place count 784 transition count 951
Iterating global reduction 2 with 13 rules applied. Total rules applied 53 place count 784 transition count 951
Performed 217 Post agglomeration using F-continuation condition.Transition count delta: 217
Deduced a syphon composed of 217 places in 2 ms
Reduce places removed 217 places and 0 transitions.
Iterating global reduction 2 with 434 rules applied. Total rules applied 487 place count 567 transition count 734
Free-agglomeration rule (complex) applied 199 times.
Iterating global reduction 2 with 199 rules applied. Total rules applied 686 place count 567 transition count 535
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 2 with 199 rules applied. Total rules applied 885 place count 368 transition count 535
Applied a total of 885 rules in 369 ms. Remains 368 /813 variables (removed 445) and now considering 535/977 (removed 442) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 370 ms. Remains : 368/813 places, 535/977 transitions.
RANDOM walk for 40000 steps (1212 resets) in 1153 ms. (34 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (17 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (17 resets) in 77 ms. (51 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (17 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (17 resets) in 25 ms. (153 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (16 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (16 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (16 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (16 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (16 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (16 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (16 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (16 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (16 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (16 resets) in 24 ms. (160 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (16 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (16 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (16 resets) in 26 ms. (148 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (17 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (16 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (16 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (16 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (17 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (16 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (16 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (16 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (16 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (16 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (16 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (16 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (16 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (16 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (16 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
Interrupted probabilistic random walk after 236974 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 32
Probabilistic random walk after 236974 steps, saw 60620 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9588936168474812958.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11259087371990128285.kers'
[2026-06-10 15:10:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9588936168474812958.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11259087371990128285.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 0 ms.
// Phase 1: matrix 535 rows 353 cols 1483 entries
Finished phase 1 with 336 SingleSign rule and 0 generalized
[2026-06-10 15:10:58] [INFO ] Computed 32 invariants in 4 ms
Computed 32 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11259087371990128285.kers
Total runtime 5 ms.
[2026-06-10 15:10:58] [INFO ] State equation strengthened by 225 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 291/353 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 15/368 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 535/903 variables, 368/400 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/903 variables, 225/625 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/903 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/903 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 903/903 variables, and 625 constraints, problems are : Problem set: 0 solved, 32 unsolved in 9211 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 368/368 constraints, ReadFeed: 225/225 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 291/353 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 20/37 constraints. Problems are: Problem set: 19 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 12/49 constraints. Problems are: Problem set: 19 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 20/69 constraints. Problems are: Problem set: 19 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 20/89 constraints. Problems are: Problem set: 19 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/89 constraints. Problems are: Problem set: 19 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 15/368 variables, 15/104 constraints. Problems are: Problem set: 19 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 1/105 constraints. Problems are: Problem set: 19 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 4/109 constraints. Problems are: Problem set: 19 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 9/118 constraints. Problems are: Problem set: 19 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 2/120 constraints. Problems are: Problem set: 19 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/368 variables, 2/122 constraints. Problems are: Problem set: 19 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/368 variables, 0/122 constraints. Problems are: Problem set: 19 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 535/903 variables, 368/490 constraints. Problems are: Problem set: 19 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/903 variables, 225/715 constraints. Problems are: Problem set: 19 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/903 variables, 13/728 constraints. Problems are: Problem set: 19 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/903 variables, 0/728 constraints. Problems are: Problem set: 19 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 0/903 variables, 0/728 constraints. Problems are: Problem set: 19 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 903/903 variables, and 728 constraints, problems are : Problem set: 19 solved, 13 unsolved in 45009 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 368/368 constraints, ReadFeed: 225/225 constraints, PredecessorRefiner: 13/32 constraints, Known Traps: 90/90 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54247ms problems are : Problem set: 19 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 27 out of 368 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 368/368 places, 535/535 transitions.
Graph (complete) has 1431 edges and 368 vertex of which 364 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 364 transition count 534
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 363 transition count 534
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 362 transition count 533
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 362 transition count 533
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 43 place count 343 transition count 514
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 2 with 18 rules applied. Total rules applied 61 place count 343 transition count 496
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 81 place count 323 transition count 496
Applied a total of 81 rules in 104 ms. Remains 323 /368 variables (removed 45) and now considering 496/535 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 323/368 places, 496/535 transitions.
RANDOM walk for 40000 steps (1248 resets) in 397 ms. (100 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (196 resets) in 106 ms. (373 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (195 resets) in 90 ms. (439 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (196 resets) in 98 ms. (404 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (196 resets) in 109 ms. (363 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (196 resets) in 85 ms. (465 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (195 resets) in 159 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (196 resets) in 163 ms. (243 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (196 resets) in 137 ms. (289 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (196 resets) in 164 ms. (242 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (196 resets) in 157 ms. (253 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (197 resets) in 154 ms. (258 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (196 resets) in 157 ms. (253 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (196 resets) in 229 ms. (173 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 336567 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 13
Probabilistic random walk after 336567 steps, saw 84722 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1651034727314462777.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12266991781996191297.kers'
[2026-06-10 15:11:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1651034727314462777.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12266991781996191297.kers]
Culling duplicate invariants (modulo rational): removing 19 columns.
Culled 19 columns in 0 ms.
// Phase 1: matrix 496 rows 304 cols 1303 entries
Finished phase 1 with 292 SingleSign rule and 1 generalized
[2026-06-10 15:11:56] [INFO ] Computed 30 invariants in 3 ms
Computed 30 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12266991781996191297.kers
Total runtime 5 ms.
[2026-06-10 15:11:56] [INFO ] State equation strengthened by 225 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 23/50 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 255/305 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 18/323 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 496/819 variables, 323/353 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/819 variables, 225/578 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/819 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 0/819 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 819/819 variables, and 578 constraints, problems are : Problem set: 0 solved, 13 unsolved in 3334 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 323/323 constraints, ReadFeed: 225/225 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 23/50 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 255/305 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 11/43 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 18/323 variables, 18/69 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/323 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 496/819 variables, 323/392 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/819 variables, 225/617 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/819 variables, 13/630 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/819 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 0/819 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 819/819 variables, and 630 constraints, problems are : Problem set: 0 solved, 13 unsolved in 22834 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 323/323 constraints, ReadFeed: 225/225 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26205ms problems are : Problem set: 0 solved, 13 unsolved
Parikh walk visited 0 properties in 4086 ms.
Support contains 27 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 496/496 transitions.
Applied a total of 0 rules in 22 ms. Remains 323 /323 variables (removed 0) and now considering 496/496 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 323/323 places, 496/496 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 496/496 transitions.
Applied a total of 0 rules in 32 ms. Remains 323 /323 variables (removed 0) and now considering 496/496 (removed 0) transitions.
[2026-06-10 15:12:26] [INFO ] Invariant cache hit.
[2026-06-10 15:12:27] [INFO ] Implicit Places using invariants in 873 ms returned []
[2026-06-10 15:12:27] [INFO ] Invariant cache hit.
[2026-06-10 15:12:28] [INFO ] State equation strengthened by 225 read => feed constraints.
[2026-06-10 15:12:32] [INFO ] Implicit Places using invariants and state equation in 4873 ms returned []
Implicit Place search using SMT with State Equation took 5748 ms to find 0 implicit places.
[2026-06-10 15:12:32] [INFO ] Redundant transitions in 42 ms returned []
Running 481 sub problems to find dead transitions.
[2026-06-10 15:12:32] [INFO ] Invariant cache hit.
[2026-06-10 15:12:32] [INFO ] State equation strengthened by 225 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/299 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 16/315 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 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 TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 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 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
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 TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 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 TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 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
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 16/46 constraints. Problems are: Problem set: 450 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 20/66 constraints. Problems are: Problem set: 450 solved, 31 unsolved
SMT process timed out in 30424ms, After SMT, problems are : Problem set: 450 solved, 31 unsolved
Search for dead transitions found 450 dead transitions in 30430ms
Found 450 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 450 transitions
Dead transitions reduction (with SMT) removed 450 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 323/323 places, 46/496 transitions.
Graph (complete) has 156 edges and 323 vertex of which 93 are kept as prefixes of interest. Removing 230 places using SCC suffix rule.1 ms
Discarding 230 places :
Also discarding 0 output transitions
Reduce places removed 9 places and 15 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 84 transition count 31
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 74 transition count 31
Deduced a syphon composed of 26 places in 0 ms
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 2 with 14 rules applied. Total rules applied 34 place count 74 transition count 17
Ensure Unique test removed 14 places
Reduce places removed 28 places and 0 transitions.
Graph (complete) has 8 edges and 46 vertex of which 32 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 29 rules applied. Total rules applied 63 place count 32 transition count 17
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 77 place count 32 transition count 3
Deduced a syphon composed of 26 places in 0 ms
Applied a total of 77 rules in 26 ms. Remains 32 /323 variables (removed 291) and now considering 3/46 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15132135088708843598.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2306426719779209439.kers'
[2026-06-10 15:13:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15132135088708843598.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2306426719779209439.kers]
Culling trivial invariants: removing 26 columns.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 27 columns in 0 ms.
// Phase 1: matrix 3 rows 5 cols 8 entries
Finished phase 1 with 2 SingleSign rule and 1 generalized
[2026-06-10 15:13:03] [INFO ] Computed 29 invariants in 0 ms
Computed 29 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2306426719779209439.kers
Total runtime 0 ms.
[2026-06-10 15:13:03] [INFO ] Implicit Places using invariants in 61 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 31/323 places, 3/496 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 2
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 29 transition count 2
Deduced a syphon composed of 26 places in 0 ms
Applied a total of 3 rules in 3 ms. Remains 29 /31 variables (removed 2) and now considering 2/3 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15762268927284334837.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2672562188206256125.kers'
[2026-06-10 15:13:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15762268927284334837.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2672562188206256125.kers]
Culling trivial invariants: removing 26 columns.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 27 columns in 0 ms.
// Phase 1: matrix 2 rows 2 cols 3 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-06-10 15:13:03] [INFO ] Computed 27 invariants in 0 ms
Computed 27 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2672562188206256125.kers
Total runtime 0 ms.
[2026-06-10 15:13:03] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-06-10 15:13:03] [INFO ] Invariant cache hit.
[2026-06-10 15:13:03] [INFO ] Implicit Places using invariants and state equation in 51 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 98 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 28/323 places, 2/496 transitions.
Deduced a syphon composed of 26 places in 0 ms
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 36467 ms. Remains : 28/323 places, 2/496 transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Successfully simplified 61 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA FileSystem-PT-N02I15B15-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I15B15-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I15B15-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I15B15-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I15B15-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I15B15-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I15B15-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 15:13:03] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2026-06-10 15:13:03] [INFO ] Flatten gal took : 108 ms
[2026-06-10 15:13:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FileSystem-PT-N02I15B15-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I15B15-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I15B15-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I15B15-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I15B15-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I15B15-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I15B15-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 15:13:03] [INFO ] Flatten gal took : 90 ms
[2026-06-10 15:13:03] [INFO ] Input system was already deterministic with 977 transitions.
Support contains 0 out of 813 places (down from 2) after GAL structural reductions.
Computed a total of 123 stabilizing places and 302 stable transitions
Graph (complete) has 2031 edges and 813 vertex of which 798 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.14 ms
Starting structural reductions in LTL mode, iteration 0 : 813/813 places, 977/977 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 798 transition count 977
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 47 place count 766 transition count 945
Iterating global reduction 1 with 32 rules applied. Total rules applied 79 place count 766 transition count 945
Applied a total of 79 rules in 58 ms. Remains 766 /813 variables (removed 47) and now considering 945/977 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17232504245422571235.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15425949896898186498.kers'
[2026-06-10 15:13:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17232504245422571235.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15425949896898186498.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 2 ms.
// Phase 1: matrix 945 rows 751 cols 2595 entries
Finished phase 1 with 734 SingleSign rule and 0 generalized
[2026-06-10 15:13:03] [INFO ] Computed 32 invariants in 24 ms
Computed 32 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-15425949896898186498.kers
Total runtime 27 ms.
[2026-06-10 15:13:04] [INFO ] Implicit Places using invariants in 869 ms returned []
[2026-06-10 15:13:04] [INFO ] Invariant cache hit.
[2026-06-10 15:13:05] [INFO ] State equation strengthened by 225 read => feed constraints.
[2026-06-10 15:13:13] [INFO ] Implicit Places using invariants and state equation in 8733 ms returned []
Implicit Place search using SMT with State Equation took 9606 ms to find 0 implicit places.
Running 930 sub problems to find dead transitions.
[2026-06-10 15:13:13] [INFO ] Invariant cache hit.
[2026-06-10 15:13:13] [INFO ] State equation strengthened by 225 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/750 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 750/1711 variables, and 30 constraints, problems are : Problem set: 0 solved, 930 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 30/32 constraints, State Equation: 0/766 constraints, ReadFeed: 0/225 constraints, PredecessorRefiner: 930/930 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 930 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/750 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 930 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 750/1711 variables, and 30 constraints, problems are : Problem set: 0 solved, 930 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 30/32 constraints, State Equation: 0/766 constraints, ReadFeed: 0/225 constraints, PredecessorRefiner: 0/930 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60284ms problems are : Problem set: 0 solved, 930 unsolved
Search for dead transitions found 0 dead transitions in 60288ms
Starting structural reductions in LTL mode, iteration 1 : 766/813 places, 945/977 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69959 ms. Remains : 766/813 places, 945/977 transitions.
[2026-06-10 15:14:13] [INFO ] Flatten gal took : 57 ms
[2026-06-10 15:14:13] [INFO ] Flatten gal took : 60 ms
[2026-06-10 15:14:14] [INFO ] Input system was already deterministic with 945 transitions.
[2026-06-10 15:14:14] [INFO ] Flatten gal took : 49 ms
[2026-06-10 15:14:14] [INFO ] Flatten gal took : 43 ms
[2026-06-10 15:14:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality6894180478798181856.gal : 53 ms
[2026-06-10 15:14:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality5327344964671087224.ctl : 6 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/CTLCardinality6894180478798181856.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5327344964671087224.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.47784e+07,4.07832,89772,2,57031,5,248512,6,0,3952,107427,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,4.43385,89800,1,0,6,248512,7,1,5645,107427,1
FORMULA FileSystem-PT-N02I15B15-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 813/813 places, 977/977 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 798 transition count 977
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 47 place count 766 transition count 945
Iterating global reduction 1 with 32 rules applied. Total rules applied 79 place count 766 transition count 945
Applied a total of 79 rules in 41 ms. Remains 766 /813 variables (removed 47) and now considering 945/977 (removed 32) transitions.
[2026-06-10 15:14:18] [INFO ] Invariant cache hit.
[2026-06-10 15:14:19] [INFO ] Implicit Places using invariants in 1058 ms returned []
[2026-06-10 15:14:19] [INFO ] Invariant cache hit.
[2026-06-10 15:14:20] [INFO ] State equation strengthened by 225 read => feed constraints.
[2026-06-10 15:14:28] [INFO ] Implicit Places using invariants and state equation in 8395 ms returned []
Implicit Place search using SMT with State Equation took 9455 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 766/813 places, 945/977 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9497 ms. Remains : 766/813 places, 945/977 transitions.
[2026-06-10 15:14:28] [INFO ] Flatten gal took : 29 ms
[2026-06-10 15:14:28] [INFO ] Flatten gal took : 27 ms
[2026-06-10 15:14:28] [INFO ] Input system was already deterministic with 945 transitions.
[2026-06-10 15:14:28] [INFO ] Flatten gal took : 26 ms
[2026-06-10 15:14:28] [INFO ] Flatten gal took : 28 ms
[2026-06-10 15:14:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality11695716011780019266.gal : 14 ms
[2026-06-10 15:14:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality11064023386646440969.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/CTLCardinality11695716011780019266.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11064023386646440969.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.47784e+07,3.93927,89952,2,57031,5,248512,6,0,3952,107427,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-06-10 15:14:58] [INFO ] Flatten gal took : 28 ms
[2026-06-10 15:14:58] [INFO ] Applying decomposition
[2026-06-10 15:14:58] [INFO ] Flatten gal took : 25 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/graph2639859204358878465.txt' '-o' '/tmp/graph2639859204358878465.bin' '-w' '/tmp/graph2639859204358878465.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2639859204358878465.bin' '-l' '-1' '-v' '-w' '/tmp/graph2639859204358878465.weights' '-q' '0' '-e' '0.001'
[2026-06-10 15:14:58] [INFO ] Decomposing Gal with order
[2026-06-10 15:14:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 15:14:59] [INFO ] Removed a total of 995 redundant transitions.
[2026-06-10 15:14:59] [INFO ] Flatten gal took : 181 ms
[2026-06-10 15:14:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 101 labels/synchronizations in 53 ms.
[2026-06-10 15:14:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality12009142232216052358.gal : 24 ms
[2026-06-10 15:14:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality8408897900698914413.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/CTLCardinality12009142232216052358.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8408897900698914413.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.
[2026-06-10 15:15:29] [INFO ] Flatten gal took : 30 ms
[2026-06-10 15:15:29] [INFO ] Flatten gal took : 30 ms
[2026-06-10 15:15:29] [INFO ] Applying decomposition
[2026-06-10 15:15:29] [INFO ] Flatten gal took : 30 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/graph17797997859766096800.txt' '-o' '/tmp/graph17797997859766096800.bin' '-w' '/tmp/graph17797997859766096800.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17797997859766096800.bin' '-l' '-1' '-v' '-w' '/tmp/graph17797997859766096800.weights' '-q' '0' '-e' '0.001'
[2026-06-10 15:15:29] [INFO ] Decomposing Gal with order
[2026-06-10 15:15:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 15:15:29] [INFO ] Removed a total of 1008 redundant transitions.
[2026-06-10 15:15:30] [INFO ] Flatten gal took : 123 ms
[2026-06-10 15:15:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 216 labels/synchronizations in 78 ms.
[2026-06-10 15:15:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality12530759502485705327.gal : 21 ms
[2026-06-10 15:15:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality7233048202804817279.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/CTLCardinality12530759502485705327.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7233048202804817279.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.47784e+07,2.17762,58132,969,69,110057,3773,2252,115161,123,20052,0


Converting to forward existential form...Done !
original formula: AG(AF(EX(TRUE)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t931, t933, t935, t936, t937, t939, t942, t945, t956, t966, t967, t972, t976, i5.t943, i5.i1....267
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,3.53855,64336,1,0,156744,3773,8203,222059,355,20052,256102
FORMULA FileSystem-PT-N02I15B15-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Total runtime 380272 ms.

BK_STOP 1781104533826

--------------------
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="FileSystem-PT-N02I15B15"
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 FileSystem-PT-N02I15B15, 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 r338-smll-178021499300425"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FileSystem-PT-N02I15B15.tgz
mv FileSystem-PT-N02I15B15 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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;