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-178021499300442.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-N03I10B10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499300442
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 832K
-rw-r--r-- 1 mcc users 7.2K May 27 10:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 27 10:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 27 10:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 27 10:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 49K May 27 10:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 165K May 27 10:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 27 10:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 9.8K May 27 10:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K May 27 10:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 27 10:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K May 27 10:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 11K May 27 10:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 26K May 27 10:49 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 236K 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-N03I10B10-CTLFireability-2024-00
FORMULA_NAME FileSystem-PT-N03I10B10-CTLFireability-2024-01
FORMULA_NAME FileSystem-PT-N03I10B10-CTLFireability-2024-02
FORMULA_NAME FileSystem-PT-N03I10B10-CTLFireability-2024-03
FORMULA_NAME FileSystem-PT-N03I10B10-CTLFireability-2024-04
FORMULA_NAME FileSystem-PT-N03I10B10-CTLFireability-2024-05
FORMULA_NAME FileSystem-PT-N03I10B10-CTLFireability-2024-06
FORMULA_NAME FileSystem-PT-N03I10B10-CTLFireability-2024-07
FORMULA_NAME FileSystem-PT-N03I10B10-CTLFireability-2024-08
FORMULA_NAME FileSystem-PT-N03I10B10-CTLFireability-2024-09
FORMULA_NAME FileSystem-PT-N03I10B10-CTLFireability-2024-10
FORMULA_NAME FileSystem-PT-N03I10B10-CTLFireability-2024-11
FORMULA_NAME FileSystem-PT-N03I10B10-CTLFireability-2024-12
FORMULA_NAME FileSystem-PT-N03I10B10-CTLFireability-2024-13
FORMULA_NAME FileSystem-PT-N03I10B10-CTLFireability-2024-14
FORMULA_NAME FileSystem-PT-N03I10B10-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1781107626344

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FileSystem-PT-N03I10B10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-06-10 16:07:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-10 16:07:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-10 16:07:09] [INFO ] Load time of PNML (sax parser for PT used): 225 ms
[2026-06-10 16:07:09] [INFO ] Transformed 561 places.
[2026-06-10 16:07:09] [INFO ] Transformed 520 transitions.
[2026-06-10 16:07:09] [INFO ] Parsed PT model containing 561 places and 520 transitions and 1850 arcs in 452 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 29 ms.
Reduce places removed 10 places and 0 transitions.
Support contains 116 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 520/520 transitions.
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 451 transition count 520
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 175 place count 376 transition count 445
Iterating global reduction 1 with 75 rules applied. Total rules applied 250 place count 376 transition count 445
Applied a total of 250 rules in 155 ms. Remains 376 /551 variables (removed 175) and now considering 445/520 (removed 75) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11177815258074129269.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16741485249182216641.kers'
[2026-06-10 16:07:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11177815258074129269.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16741485249182216641.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 445 rows 366 cols 1225 entries
Finished phase 1 with 354 SingleSign rule and 0 generalized
[2026-06-10 16:07:09] [INFO ] Computed 22 invariants in 7 ms
Computed 22 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-16741485249182216641.kers
Total runtime 10 ms.
[2026-06-10 16:07:10] [INFO ] Implicit Places using invariants in 922 ms returned []
[2026-06-10 16:07:10] [INFO ] Invariant cache hit.
[2026-06-10 16:07:11] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 16:07:12] [INFO ] Implicit Places using invariants and state equation in 1623 ms returned []
Implicit Place search using SMT with State Equation took 2618 ms to find 0 implicit places.
Running 435 sub problems to find dead transitions.
[2026-06-10 16:07:12] [INFO ] Invariant cache hit.
[2026-06-10 16:07:12] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 2 (OVERLAPS) 11/376 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 435 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 435 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 376/821 variables, and 42 constraints, problems are : Problem set: 0 solved, 435 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/376 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 435/435 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 435 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 3 (OVERLAPS) 11/376 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 12/42 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 8/70 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 435 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/821 variables, and 73 constraints, problems are : Problem set: 0 solved, 435 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/376 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 0/435 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60421ms problems are : Problem set: 0 solved, 435 unsolved
Search for dead transitions found 0 dead transitions in 60457ms
Starting structural reductions in LTL mode, iteration 1 : 376/551 places, 445/520 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63310 ms. Remains : 376/551 places, 445/520 transitions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 445/445 transitions.
Applied a total of 0 rules in 9 ms. Remains 376 /376 variables (removed 0) and now considering 445/445 (removed 0) transitions.
[2026-06-10 16:08:12] [INFO ] Invariant cache hit.
[2026-06-10 16:08:13] [INFO ] Implicit Places using invariants in 211 ms returned []
[2026-06-10 16:08:13] [INFO ] Invariant cache hit.
[2026-06-10 16:08:13] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 16:08:14] [INFO ] Implicit Places using invariants and state equation in 1317 ms returned []
Implicit Place search using SMT with State Equation took 1531 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1541 ms. Remains : 376/376 places, 445/445 transitions.
Support contains 116 out of 376 places after structural reductions.
[2026-06-10 16:08:14] [INFO ] Flatten gal took : 127 ms
[2026-06-10 16:08:15] [INFO ] Flatten gal took : 71 ms
[2026-06-10 16:08:15] [INFO ] Input system was already deterministic with 445 transitions.
Support contains 113 out of 376 places (down from 116) after GAL structural reductions.
RANDOM walk for 40000 steps (604 resets) in 2780 ms. (14 steps per ms) remains 61/77 properties
BEST_FIRST walk for 4004 steps (12 resets) in 45 ms. (87 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (12 resets) in 37 ms. (105 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (12 resets) in 37 ms. (105 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (12 resets) in 42 ms. (93 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (12 resets) in 32 ms. (121 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (12 resets) in 42 ms. (93 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (12 resets) in 49 ms. (80 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (12 resets) in 37 ms. (105 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (12 resets) in 36 ms. (108 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (12 resets) in 36 ms. (108 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (12 resets) in 58 ms. (67 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (12 resets) in 20 ms. (190 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 4003 steps (12 resets) in 21 ms. (181 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (12 resets) in 30 ms. (129 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 4004 steps (12 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (12 resets) in 21 ms. (181 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (12 resets) in 33 ms. (117 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 (12 resets) in 25 ms. (153 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (12 resets) in 27 ms. (143 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (12 resets) in 36 ms. (108 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 4004 steps (12 resets) in 29 ms. (133 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (12 resets) in 23 ms. (166 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (12 resets) in 22 ms. (174 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (12 resets) in 27 ms. (142 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (13 resets) in 28 ms. (137 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (12 resets) in 25 ms. (153 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 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 (12 resets) in 22 ms. (174 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 4002 steps (12 resets) in 23 ms. (166 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (12 resets) in 30 ms. (129 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (12 resets) in 25 ms. (153 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (12 resets) in 28 ms. (138 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (12 resets) in 23 ms. (166 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (12 resets) in 60 ms. (65 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (12 resets) in 22 ms. (174 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (12 resets) in 29 ms. (133 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (12 resets) in 27 ms. (142 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (12 resets) in 30 ms. (129 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (12 resets) in 30 ms. (129 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (12 resets) in 28 ms. (138 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (12 resets) in 28 ms. (138 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 4002 steps (13 resets) in 31 ms. (125 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (12 resets) in 25 ms. (153 steps per ms) remains 61/61 properties
[2026-06-10 16:08:16] [INFO ] Invariant cache hit.
[2026-06-10 16:08:16] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 283/376 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 61 unsolved
SMT process timed out in 5055ms, After SMT, problems are : Problem set: 0 solved, 61 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 93 out of 376 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 376/376 places, 445/445 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 376 transition count 436
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 367 transition count 436
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 23 place count 362 transition count 431
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 362 transition count 431
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 37 place count 362 transition count 431
Applied a total of 37 rules in 120 ms. Remains 362 /376 variables (removed 14) and now considering 431/445 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 362/376 places, 431/445 transitions.
RANDOM walk for 40000 steps (832 resets) in 1277 ms. (31 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (16 resets) in 31 ms. (125 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (16 resets) in 33 ms. (117 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (16 resets) in 34 ms. (114 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (16 resets) in 45 ms. (87 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (16 resets) in 33 ms. (117 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (16 resets) in 43 ms. (91 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (16 resets) in 38 ms. (102 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (16 resets) in 32 ms. (121 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (16 resets) in 34 ms. (114 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (16 resets) in 29 ms. (133 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (16 resets) in 28 ms. (138 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (16 resets) in 30 ms. (129 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (16 resets) in 35 ms. (111 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (16 resets) in 67 ms. (58 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (16 resets) in 40 ms. (97 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (16 resets) in 35 ms. (111 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (16 resets) in 34 ms. (114 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (16 resets) in 32 ms. (121 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (16 resets) in 38 ms. (102 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (16 resets) in 33 ms. (117 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (16 resets) in 35 ms. (111 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (16 resets) in 41 ms. (95 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (16 resets) in 33 ms. (117 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (16 resets) in 40 ms. (97 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (19 resets) in 33 ms. (117 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (19 resets) in 33 ms. (117 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (16 resets) in 33 ms. (117 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (16 resets) in 25 ms. (154 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (19 resets) in 35 ms. (111 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (16 resets) in 30 ms. (129 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (16 resets) in 30 ms. (129 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (16 resets) in 29 ms. (133 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (16 resets) in 32 ms. (121 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (16 resets) in 38 ms. (102 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (16 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (16 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (16 resets) in 39 ms. (100 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (16 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (16 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (16 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (16 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (16 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (16 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (16 resets) in 22 ms. (174 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (16 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (16 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (16 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (16 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (20 resets) in 21 ms. (182 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (16 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
Interrupted probabilistic random walk after 235243 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 61
Probabilistic random walk after 235243 steps, saw 56464 distinct states, run finished after 3007 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-10275096070453726427.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9579188688004122224.kers'
[2026-06-10 16:08:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10275096070453726427.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9579188688004122224.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 431 rows 352 cols 1201 entries
Finished phase 1 with 340 SingleSign rule and 0 generalized
[2026-06-10 16:08:25] [INFO ] Computed 22 invariants in 3 ms
Computed 22 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9579188688004122224.kers
Total runtime 5 ms.
[2026-06-10 16:08:25] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 269/362 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 431/793 variables, 362/433 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/793 variables, 100/533 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/793 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 13 (OVERLAPS) 0/793 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 793/793 variables, and 533 constraints, problems are : Problem set: 0 solved, 61 unsolved in 34981 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 362/362 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 269/362 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 49/71 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/362 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 12 (OVERLAPS) 431/793 variables, 362/447 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp76 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/793 variables, 100/547 constraints. Problems are: Problem set: 51 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/793 variables, 10/557 constraints. Problems are: Problem set: 51 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/793 variables, 0/557 constraints. Problems are: Problem set: 51 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 0/793 variables, 0/557 constraints. Problems are: Problem set: 51 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 793/793 variables, and 557 constraints, problems are : Problem set: 51 solved, 10 unsolved in 18448 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 362/362 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 10/61 constraints, Known Traps: 63/63 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53491ms problems are : Problem set: 51 solved, 10 unsolved
Parikh walk visited 0 properties in 4082 ms.
Support contains 12 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 431/431 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 1 place count 362 transition count 430
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 361 transition count 430
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 360 transition count 429
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 360 transition count 429
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 198 place count 263 transition count 332
Free-agglomeration rule (complex) applied 90 times.
Iterating global reduction 2 with 90 rules applied. Total rules applied 288 place count 263 transition count 251
Reduce places removed 93 places and 0 transitions.
Iterating post reduction 2 with 93 rules applied. Total rules applied 381 place count 170 transition count 251
Applied a total of 381 rules in 92 ms. Remains 170 /362 variables (removed 192) and now considering 251/431 (removed 180) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 170/362 places, 251/431 transitions.
RANDOM walk for 40000 steps (2104 resets) in 268 ms. (148 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (389 resets) in 84 ms. (470 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (388 resets) in 81 ms. (487 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (389 resets) in 86 ms. (459 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (391 resets) in 61 ms. (645 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (389 resets) in 73 ms. (540 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (390 resets) in 69 ms. (571 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (388 resets) in 83 ms. (476 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (388 resets) in 55 ms. (714 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (390 resets) in 78 ms. (506 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (387 resets) in 60 ms. (655 steps per ms) remains 10/10 properties
Probably explored full state space saw : 13184 states, properties seen :0
Probabilistic random walk after 73472 steps, saw 13184 distinct states, run finished after 537 ms. (steps per millisecond=136 ) properties seen :0
Explored full state space saw : 13184 states, properties seen :0
Exhaustive walk after 73472 steps, saw 13184 distinct states, run finished after 376 ms. (steps per millisecond=195 ) properties seen :0
Successfully simplified 61 atomic propositions for a total of 16 simplifications.
FORMULA FileSystem-PT-N03I10B10-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B10-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B10-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B10-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B10-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 16:09:24] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2026-06-10 16:09:24] [INFO ] Flatten gal took : 37 ms
[2026-06-10 16:09:24] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2026-06-10 16:09:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FileSystem-PT-N03I10B10-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B10-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B10-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B10-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B10-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 16:09:25] [INFO ] Flatten gal took : 32 ms
[2026-06-10 16:09:25] [INFO ] Input system was already deterministic with 445 transitions.
Support contains 12 out of 376 places (down from 23) after GAL structural reductions.
FORMULA FileSystem-PT-N03I10B10-CTLFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 66 stabilizing places and 145 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 445/445 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 361 transition count 430
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 361 transition count 430
Applied a total of 30 rules in 15 ms. Remains 361 /376 variables (removed 15) and now considering 430/445 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11382504058676647187.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1833095781955152477.kers'
[2026-06-10 16:09:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11382504058676647187.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1833095781955152477.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 430 rows 351 cols 1180 entries
Finished phase 1 with 339 SingleSign rule and 0 generalized
[2026-06-10 16:09:25] [INFO ] Computed 22 invariants in 4 ms
Computed 22 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1833095781955152477.kers
Total runtime 5 ms.
[2026-06-10 16:09:25] [INFO ] Implicit Places using invariants in 272 ms returned []
[2026-06-10 16:09:25] [INFO ] Invariant cache hit.
[2026-06-10 16:09:25] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 16:09:26] [INFO ] Implicit Places using invariants and state equation in 1335 ms returned []
Implicit Place search using SMT with State Equation took 1610 ms to find 0 implicit places.
Running 420 sub problems to find dead transitions.
[2026-06-10 16:09:26] [INFO ] Invariant cache hit.
[2026-06-10 16:09:26] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (OVERLAPS) 11/361 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/791 variables, and 43 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/361 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 11/361 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/791 variables, and 64 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/361 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 0/420 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 60123ms
Starting structural reductions in LTL mode, iteration 1 : 361/376 places, 430/445 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61752 ms. Remains : 361/376 places, 430/445 transitions.
[2026-06-10 16:10:26] [INFO ] Flatten gal took : 38 ms
[2026-06-10 16:10:26] [INFO ] Flatten gal took : 37 ms
[2026-06-10 16:10:27] [INFO ] Input system was already deterministic with 430 transitions.
[2026-06-10 16:10:27] [INFO ] Flatten gal took : 31 ms
[2026-06-10 16:10:27] [INFO ] Flatten gal took : 30 ms
[2026-06-10 16:10:27] [INFO ] Time to serialize gal into /tmp/CTLFireability17703754790196832389.gal : 21 ms
[2026-06-10 16:10:27] [INFO ] Time to serialize properties into /tmp/CTLFireability15006299056811067938.ctl : 5 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/CTLFireability17703754790196832389.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15006299056811067938.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,2.12982e+06,0.789669,19000,2,11811,5,50520,6,0,1837,31328,0


Converting to forward existential form...Done !
original formula: (AG(AX(AX(FALSE))) * EF(EX(AX(((beginloop_3_15>=1)&&(lockb_15>=1))))))
=> equivalent forward existential formula: ([(EY(EY(FwdU(Init,TRUE))) * !(FALSE))] = FALSE * [(Init * !(E(TRUE U EX(!(EX(!(((beginloop_3_15>=1)&&(lockb_15>...176
Reverse transition relation is NOT exact ! Due to transitions t221, t226, t242, t247, t263, t268, t284, t289, t300, t305, t420, t421, t422, t423, t424, t42...283
(forward)formula 0,0,18.59,454476,1,0,233,2.4096e+06,542,129,7833,1.5582e+06,608
FORMULA FileSystem-PT-N03I10B10-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 445/445 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 361 transition count 430
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 361 transition count 430
Applied a total of 30 rules in 13 ms. Remains 361 /376 variables (removed 15) and now considering 430/445 (removed 15) transitions.
[2026-06-10 16:10:45] [INFO ] Invariant cache hit.
[2026-06-10 16:10:46] [INFO ] Implicit Places using invariants in 387 ms returned []
[2026-06-10 16:10:46] [INFO ] Invariant cache hit.
[2026-06-10 16:10:46] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 16:10:48] [INFO ] Implicit Places using invariants and state equation in 2008 ms returned []
Implicit Place search using SMT with State Equation took 2398 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 361/376 places, 430/445 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2411 ms. Remains : 361/376 places, 430/445 transitions.
[2026-06-10 16:10:48] [INFO ] Flatten gal took : 18 ms
[2026-06-10 16:10:48] [INFO ] Flatten gal took : 17 ms
[2026-06-10 16:10:48] [INFO ] Input system was already deterministic with 430 transitions.
[2026-06-10 16:10:48] [INFO ] Flatten gal took : 16 ms
[2026-06-10 16:10:48] [INFO ] Flatten gal took : 16 ms
[2026-06-10 16:10:48] [INFO ] Time to serialize gal into /tmp/CTLFireability4175494142402527796.gal : 9 ms
[2026-06-10 16:10:48] [INFO ] Time to serialize properties into /tmp/CTLFireability5519841734891899058.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/CTLFireability4175494142402527796.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5519841734891899058.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,2.12982e+06,0.729926,19020,2,11811,5,50520,6,0,1837,31328,0


Converting to forward existential form...Done !
original formula: EX(E(!(EF((loop_4_17>=1))) U !(AF(EX(((busy_17_21>=1)&&(testbusy_9_17>=1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(EY(Init),!(E(TRUE U (loop_4_17>=1)))),!(EX(((busy_17_21>=1)&&(testbusy_9_17>=1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t221, t226, t242, t247, t263, t268, t284, t289, t300, t305, t420, t421, t422, t423, t424, t42...283
Detected timeout of ITS tools.
[2026-06-10 16:11:18] [INFO ] Flatten gal took : 14 ms
[2026-06-10 16:11:18] [INFO ] Applying decomposition
[2026-06-10 16:11:18] [INFO ] Flatten gal took : 15 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/graph10370851203820860078.txt' '-o' '/tmp/graph10370851203820860078.bin' '-w' '/tmp/graph10370851203820860078.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10370851203820860078.bin' '-l' '-1' '-v' '-w' '/tmp/graph10370851203820860078.weights' '-q' '0' '-e' '0.001'
[2026-06-10 16:11:18] [INFO ] Decomposing Gal with order
[2026-06-10 16:11:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 16:11:18] [INFO ] Removed a total of 429 redundant transitions.
[2026-06-10 16:11:18] [INFO ] Flatten gal took : 122 ms
[2026-06-10 16:11:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 25 ms.
[2026-06-10 16:11:19] [INFO ] Time to serialize gal into /tmp/CTLFireability9049744515294307652.gal : 22 ms
[2026-06-10 16:11:19] [INFO ] Time to serialize properties into /tmp/CTLFireability10322872194415617344.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/CTLFireability9049744515294307652.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10322872194415617344.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,2.12982e+06,0.868922,24692,2360,25,45008,360,942,74102,30,672,0


Converting to forward existential form...Done !
original formula: EX(E(!(EF((i1.u98.loop_4_17>=1))) U !(AF(EX(((i1.u68.busy_17_21>=1)&&(i1.u140.testbusy_9_17>=1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(EY(Init),!(E(TRUE U (i1.u98.loop_4_17>=1)))),!(EX(((i1.u68.busy_17_21>=1)&&(i1.u140.testbusy_9_17>=1)...169
Reverse transition relation is NOT exact ! Due to transitions t420, t421, t422, t423, t424, t425, t426, t427, t428, t429, i0.t247, i0.t242, i1.t289, i1.t28...313
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
Using saturation style SCC detection
(forward)formula 0,1,16.0136,433304,1,0,911457,898,3880,1.81675e+06,140,3206,1797442
FORMULA FileSystem-PT-N03I10B10-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 445/445 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 362 transition count 431
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 362 transition count 431
Applied a total of 28 rules in 13 ms. Remains 362 /376 variables (removed 14) and now considering 431/445 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1622450568953260029.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2022637672774100138.kers'
[2026-06-10 16:11:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1622450568953260029.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2022637672774100138.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 431 rows 352 cols 1183 entries
Finished phase 1 with 340 SingleSign rule and 0 generalized
[2026-06-10 16:11:35] [INFO ] Computed 22 invariants in 4 ms
Computed 22 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-2022637672774100138.kers
Total runtime 5 ms.
[2026-06-10 16:11:35] [INFO ] Implicit Places using invariants in 288 ms returned []
[2026-06-10 16:11:35] [INFO ] Invariant cache hit.
[2026-06-10 16:11:35] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 16:11:37] [INFO ] Implicit Places using invariants and state equation in 1955 ms returned []
Implicit Place search using SMT with State Equation took 2245 ms to find 0 implicit places.
Running 421 sub problems to find dead transitions.
[2026-06-10 16:11:37] [INFO ] Invariant cache hit.
[2026-06-10 16:11:37] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (OVERLAPS) 11/362 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 362/793 variables, and 44 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/362 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 421 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 11/362 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 16/44 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/793 variables, and 68 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/362 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 0/421 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 421 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Starting structural reductions in LTL mode, iteration 1 : 362/376 places, 431/445 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62372 ms. Remains : 362/376 places, 431/445 transitions.
[2026-06-10 16:12:37] [INFO ] Flatten gal took : 18 ms
[2026-06-10 16:12:37] [INFO ] Flatten gal took : 21 ms
[2026-06-10 16:12:37] [INFO ] Input system was already deterministic with 431 transitions.
[2026-06-10 16:12:37] [INFO ] Flatten gal took : 34 ms
[2026-06-10 16:12:37] [INFO ] Flatten gal took : 20 ms
[2026-06-10 16:12:37] [INFO ] Time to serialize gal into /tmp/CTLFireability11012396098020918300.gal : 7 ms
[2026-06-10 16:12:37] [INFO ] Time to serialize properties into /tmp/CTLFireability1788408958456094369.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/CTLFireability11012396098020918300.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1788408958456094369.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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,2.18086e+06,0.871095,19984,2,13424,5,50633,6,0,1842,31607,0


Converting to forward existential form...Done !
original formula: A(AG(!(EX(((endloop_6_12>=1)||((beginloop_4_16>=1)&&(lockb_16>=1)))))) U AG(!(AX(AX(FALSE)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(!(!(EX(!(!(EX(!(FALSE)))))))))))))) * !(E(!(!(E(TRUE U !(!(!(EX(!(!(EX(!(FALSE))))...313
Reverse transition relation is NOT exact ! Due to transitions t221, t226, t242, t247, t263, t268, t284, t289, t300, t305, t420, t421, t422, t423, t424, t42...289
Detected timeout of ITS tools.
[2026-06-10 16:13:07] [INFO ] Flatten gal took : 12 ms
[2026-06-10 16:13:07] [INFO ] Applying decomposition
[2026-06-10 16:13:07] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph423917043535643744.txt' '-o' '/tmp/graph423917043535643744.bin' '-w' '/tmp/graph423917043535643744.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph423917043535643744.bin' '-l' '-1' '-v' '-w' '/tmp/graph423917043535643744.weights' '-q' '0' '-e' '0.001'
[2026-06-10 16:13:07] [INFO ] Decomposing Gal with order
[2026-06-10 16:13:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 16:13:07] [INFO ] Removed a total of 434 redundant transitions.
[2026-06-10 16:13:07] [INFO ] Flatten gal took : 40 ms
[2026-06-10 16:13:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 21 ms.
[2026-06-10 16:13:08] [INFO ] Time to serialize gal into /tmp/CTLFireability15254071782915589858.gal : 7 ms
[2026-06-10 16:13:08] [INFO ] Time to serialize properties into /tmp/CTLFireability8443123229073601614.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/CTLFireability15254071782915589858.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8443123229073601614.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,2.18086e+06,0.678904,23880,1851,22,39221,252,1072,71479,27,537,0


Converting to forward existential form...Done !
original formula: A(AG(!(EX(((i2.u79.endloop_6_12>=1)||((i3.i1.u103.beginloop_4_16>=1)&&(i1.i0.u104.lockb_16>=1)))))) U AG(!(AX(AX(FALSE)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(!(!(EX(!(!(EX(!(FALSE)))))))))))))) * !(E(!(!(E(TRUE U !(!(!(EX(!(!(EX(!(FALSE))))...342
Reverse transition relation is NOT exact ! Due to transitions t420, t421, t422, t423, t424, t425, t426, t427, t428, t429, t430, i0.i1.t300, i0.i1.t305, i1....343
(forward)formula 0,0,11.5907,285688,1,0,534747,252,4422,1.5585e+06,115,599,833708
FORMULA FileSystem-PT-N03I10B10-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 445/445 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 362 transition count 431
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 362 transition count 431
Applied a total of 28 rules in 11 ms. Remains 362 /376 variables (removed 14) and now considering 431/445 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-995957642479620474.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5965421121060431095.kers'
[2026-06-10 16:13:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-995957642479620474.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5965421121060431095.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 431 rows 352 cols 1183 entries
Finished phase 1 with 340 SingleSign rule and 0 generalized
[2026-06-10 16:13:19] [INFO ] Computed 22 invariants in 4 ms
Computed 22 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-5965421121060431095.kers
Total runtime 5 ms.
[2026-06-10 16:13:20] [INFO ] Implicit Places using invariants in 327 ms returned []
[2026-06-10 16:13:20] [INFO ] Invariant cache hit.
[2026-06-10 16:13:20] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 16:13:22] [INFO ] Implicit Places using invariants and state equation in 2113 ms returned []
Implicit Place search using SMT with State Equation took 2442 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 362/376 places, 431/445 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2453 ms. Remains : 362/376 places, 431/445 transitions.
[2026-06-10 16:13:22] [INFO ] Flatten gal took : 10 ms
[2026-06-10 16:13:22] [INFO ] Flatten gal took : 11 ms
[2026-06-10 16:13:22] [INFO ] Input system was already deterministic with 431 transitions.
[2026-06-10 16:13:22] [INFO ] Flatten gal took : 11 ms
[2026-06-10 16:13:22] [INFO ] Flatten gal took : 12 ms
[2026-06-10 16:13:22] [INFO ] Time to serialize gal into /tmp/CTLFireability6554923052196030823.gal : 5 ms
[2026-06-10 16:13:22] [INFO ] Time to serialize properties into /tmp/CTLFireability5194135687259242863.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/CTLFireability6554923052196030823.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5194135687259242863.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,2.12982e+06,0.76293,20960,2,10521,5,61000,6,0,1842,36587,0


Converting to forward existential form...Done !
original formula: AF(((endloop_9_17>=1) + EX((loop_2_13>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(((endloop_9_17>=1) + EX((loop_2_13>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t221, t226, t242, t247, t263, t268, t300, t305, t420, t421, t422, t423, t424, t425, t426, t42...277
(forward)formula 0,0,29.0856,727392,1,0,426,2.87679e+06,544,231,7725,2.62422e+06,730
FORMULA FileSystem-PT-N03I10B10-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 376/376 places, 445/445 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 376 transition count 436
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 367 transition count 436
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 33 place count 352 transition count 421
Iterating global reduction 2 with 15 rules applied. Total rules applied 48 place count 352 transition count 421
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 244 place count 254 transition count 323
Applied a total of 244 rules in 58 ms. Remains 254 /376 variables (removed 122) and now considering 323/445 (removed 122) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1019471297999770490.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15399294895940168567.kers'
[2026-06-10 16:13:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1019471297999770490.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15399294895940168567.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 323 rows 244 cols 1047 entries
Finished phase 1 with 232 SingleSign rule and 0 generalized
[2026-06-10 16:13:51] [INFO ] Computed 22 invariants in 2 ms
Computed 22 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15399294895940168567.kers
Total runtime 3 ms.
[2026-06-10 16:13:52] [INFO ] Implicit Places using invariants in 652 ms returned []
[2026-06-10 16:13:52] [INFO ] Invariant cache hit.
[2026-06-10 16:13:52] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 16:13:54] [INFO ] Implicit Places using invariants and state equation in 1647 ms returned []
Implicit Place search using SMT with State Equation took 2301 ms to find 0 implicit places.
[2026-06-10 16:13:54] [INFO ] Redundant transitions in 21 ms returned []
Running 313 sub problems to find dead transitions.
[2026-06-10 16:13:54] [INFO ] Invariant cache hit.
[2026-06-10 16:13:54] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 11/254 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 323/577 variables, 254/288 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Problem TDEAD111 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD318 is UNSAT
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 100/388 constraints. Problems are: Problem set: 21 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 577/577 variables, and 388 constraints, problems are : Problem set: 21 solved, 292 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 254/254 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 21 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 19/19 constraints. Problems are: Problem set: 21 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 2/21 constraints. Problems are: Problem set: 21 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 0/21 constraints. Problems are: Problem set: 21 solved, 292 unsolved
At refinement iteration 3 (OVERLAPS) 12/254 variables, 3/24 constraints. Problems are: Problem set: 21 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 10/34 constraints. Problems are: Problem set: 21 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 0/34 constraints. Problems are: Problem set: 21 solved, 292 unsolved
At refinement iteration 6 (OVERLAPS) 323/577 variables, 254/288 constraints. Problems are: Problem set: 21 solved, 292 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 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 TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 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 TDEAD62 is UNSAT
Problem TDEAD63 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 TDEAD70 is UNSAT
Problem TDEAD71 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 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 TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 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 TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 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 TDEAD242 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 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 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 TDEAD271 is UNSAT
Problem TDEAD272 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 TDEAD286 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 TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 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 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 TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 100/388 constraints. Problems are: Problem set: 259 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 54/442 constraints. Problems are: Problem set: 259 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/577 variables, 0/442 constraints. Problems are: Problem set: 259 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 0/577 variables, 0/442 constraints. Problems are: Problem set: 259 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 577/577 variables, and 442 constraints, problems are : Problem set: 259 solved, 54 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 254/254 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 54/313 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60078ms problems are : Problem set: 259 solved, 54 unsolved
Search for dead transitions found 259 dead transitions in 60080ms
Found 259 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 259 transitions
Dead transitions reduction (with SMT) removed 259 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 254/376 places, 64/445 transitions.
Graph (complete) has 183 edges and 254 vertex of which 80 are kept as prefixes of interest. Removing 174 places using SCC suffix rule.2 ms
Discarding 174 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 75 transition count 59
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 75 transition count 59
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 16 place count 70 transition count 54
Iterating global reduction 0 with 5 rules applied. Total rules applied 21 place count 70 transition count 54
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 21 place count 70 transition count 49
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 15 rules applied. Total rules applied 36 place count 60 transition count 49
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 55 transition count 40
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 55 transition count 40
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 50 transition count 34
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 50 transition count 34
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 56 place count 50 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 68 place count 42 transition count 30
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 72 place count 38 transition count 26
Iterating global reduction 0 with 4 rules applied. Total rules applied 76 place count 38 transition count 26
Applied a total of 76 rules in 27 ms. Remains 38 /254 variables (removed 216) and now considering 26/64 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2326423555219369744.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14474324848446692196.kers'
[2026-06-10 16:14:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2326423555219369744.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14474324848446692196.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 26 rows 33 cols 72 entries
Finished phase 1 with 20 SingleSign rule and 6 generalized
[2026-06-10 16:14:54] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14474324848446692196.kers
Total runtime 0 ms.
[2026-06-10 16:14:54] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-06-10 16:14:54] [INFO ] Invariant cache hit.
[2026-06-10 16:14:54] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-06-10 16:14:54] [INFO ] Implicit Places using invariants and state equation in 67 ms returned [13, 16, 19, 22, 25]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 123 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 33/376 places, 26/445 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 29 transition count 22
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 29 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 28 transition count 21
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 27 transition count 20
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 27 transition count 20
Applied a total of 12 rules in 4 ms. Remains 27 /33 variables (removed 6) and now considering 20/26 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4255671744740802771.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17209856035017260491.kers'
[2026-06-10 16:14:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4255671744740802771.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17209856035017260491.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 20 rows 22 cols 54 entries
Finished phase 1 with 20 SingleSign rule and 0 generalized
[2026-06-10 16:14:54] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17209856035017260491.kers
Total runtime 0 ms.
[2026-06-10 16:14:54] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-06-10 16:14:54] [INFO ] Invariant cache hit.
[2026-06-10 16:14:54] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-06-10 16:14:54] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 27/376 places, 20/445 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 62705 ms. Remains : 27/376 places, 20/445 transitions.
[2026-06-10 16:14:54] [INFO ] Flatten gal took : 1 ms
[2026-06-10 16:14:54] [INFO ] Flatten gal took : 1 ms
[2026-06-10 16:14:54] [INFO ] Input system was already deterministic with 20 transitions.
[2026-06-10 16:14:54] [INFO ] Flatten gal took : 0 ms
[2026-06-10 16:14:54] [INFO ] Flatten gal took : 0 ms
[2026-06-10 16:14:54] [INFO ] Time to serialize gal into /tmp/CTLFireability3912998337701491139.gal : 0 ms
[2026-06-10 16:14:54] [INFO ] Time to serialize properties into /tmp/CTLFireability12130022137237996585.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/CTLFireability3912998337701491139.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12130022137237996585.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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,13560,0.023123,4564,2,526,5,4218,6,0,110,3515,0


Converting to forward existential form...Done !
original formula: EG(AG(EF(((beginloop_2_13>=1)&&(lockb_13>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(TRUE U ((beginloop_2_13>=1)&&(lockb_13>=1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, Intersection with reachable at...221
dead was empty
(forward)formula 0,0,0.478404,15584,1,0,111,74858,63,37,696,72536,107
FORMULA FileSystem-PT-N03I10B10-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-06-10 16:14:54] [INFO ] Flatten gal took : 17 ms
[2026-06-10 16:14:54] [INFO ] Flatten gal took : 17 ms
Total runtime 466056 ms.

BK_STOP 1781108094973

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

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