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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 852K
-rw-r--r-- 1 mcc users 11K May 27 10:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 27 10:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 27 10:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 27 10:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 45K May 27 10:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 161K May 27 10:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 27 10:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 27 10:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 12K May 27 10:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 27 10:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 27 10:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 35K May 27 10:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.2K May 27 10:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 22K May 27 10:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 10 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 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-N02I10B10-CTLCardinality-2024-00
FORMULA_NAME FileSystem-PT-N02I10B10-CTLCardinality-2024-01
FORMULA_NAME FileSystem-PT-N02I10B10-CTLCardinality-2024-02
FORMULA_NAME FileSystem-PT-N02I10B10-CTLCardinality-2024-03
FORMULA_NAME FileSystem-PT-N02I10B10-CTLCardinality-2024-04
FORMULA_NAME FileSystem-PT-N02I10B10-CTLCardinality-2024-05
FORMULA_NAME FileSystem-PT-N02I10B10-CTLCardinality-2024-06
FORMULA_NAME FileSystem-PT-N02I10B10-CTLCardinality-2024-07
FORMULA_NAME FileSystem-PT-N02I10B10-CTLCardinality-2024-08
FORMULA_NAME FileSystem-PT-N02I10B10-CTLCardinality-2024-09
FORMULA_NAME FileSystem-PT-N02I10B10-CTLCardinality-2024-10
FORMULA_NAME FileSystem-PT-N02I10B10-CTLCardinality-2024-11
FORMULA_NAME FileSystem-PT-N02I10B10-CTLCardinality-2024-12
FORMULA_NAME FileSystem-PT-N02I10B10-CTLCardinality-2024-13
FORMULA_NAME FileSystem-PT-N02I10B10-CTLCardinality-2024-14
FORMULA_NAME FileSystem-PT-N02I10B10-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1781103322341

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FileSystem-PT-N02I10B10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-06-10 14:55:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-10 14:55:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-10 14:55:25] [INFO ] Load time of PNML (sax parser for PT used): 216 ms
[2026-06-10 14:55:25] [INFO ] Transformed 561 places.
[2026-06-10 14:55:25] [INFO ] Transformed 520 transitions.
[2026-06-10 14:55:25] [INFO ] Parsed PT model containing 561 places and 520 transitions and 1850 arcs in 443 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 39 ms.
Reduce places removed 10 places and 0 transitions.
Support contains 171 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 520/520 transitions.
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 484 transition count 520
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 101 place count 450 transition count 486
Iterating global reduction 1 with 34 rules applied. Total rules applied 135 place count 450 transition count 486
Applied a total of 135 rules in 154 ms. Remains 450 /551 variables (removed 101) and now considering 486/520 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5958116399502538917.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11919968871329764717.kers'
[2026-06-10 14:55:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5958116399502538917.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11919968871329764717.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 1 ms.
// Phase 1: matrix 486 rows 440 cols 1381 entries
Finished phase 1 with 428 SingleSign rule and 0 generalized
[2026-06-10 14:55:25] [INFO ] Computed 22 invariants in 10 ms
Computed 22 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-11919968871329764717.kers
Total runtime 13 ms.
[2026-06-10 14:55:26] [INFO ] Implicit Places using invariants in 917 ms returned []
[2026-06-10 14:55:26] [INFO ] Invariant cache hit.
[2026-06-10 14:55:27] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 14:55:30] [INFO ] Implicit Places using invariants and state equation in 4034 ms returned []
Implicit Place search using SMT with State Equation took 5019 ms to find 0 implicit places.
Running 476 sub problems to find dead transitions.
[2026-06-10 14:55:30] [INFO ] Invariant cache hit.
[2026-06-10 14:55:30] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 2 (OVERLAPS) 11/417 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/417 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 476 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 417/936 variables, and 42 constraints, problems are : Problem set: 0 solved, 476 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/450 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 476/476 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 476 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 3 (OVERLAPS) 11/417 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 16/42 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 476 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 417/936 variables, and 74 constraints, problems are : Problem set: 0 solved, 476 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/450 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 0/476 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60457ms problems are : Problem set: 0 solved, 476 unsolved
Search for dead transitions found 0 dead transitions in 60482ms
Starting structural reductions in LTL mode, iteration 1 : 450/551 places, 486/520 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65718 ms. Remains : 450/551 places, 486/520 transitions.
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 486/486 transitions.
Applied a total of 0 rules in 15 ms. Remains 450 /450 variables (removed 0) and now considering 486/486 (removed 0) transitions.
[2026-06-10 14:56:31] [INFO ] Invariant cache hit.
[2026-06-10 14:56:31] [INFO ] Implicit Places using invariants in 407 ms returned []
[2026-06-10 14:56:31] [INFO ] Invariant cache hit.
[2026-06-10 14:56:31] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 14:56:34] [INFO ] Implicit Places using invariants and state equation in 3262 ms returned []
Implicit Place search using SMT with State Equation took 3672 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3688 ms. Remains : 450/450 places, 486/486 transitions.
Support contains 171 out of 450 places after structural reductions.
[2026-06-10 14:56:35] [INFO ] Flatten gal took : 93 ms
[2026-06-10 14:56:35] [INFO ] Flatten gal took : 75 ms
[2026-06-10 14:56:35] [INFO ] Input system was already deterministic with 486 transitions.
RANDOM walk for 40000 steps (604 resets) in 2979 ms. (13 steps per ms) remains 97/116 properties
BEST_FIRST walk for 4003 steps (16 resets) in 51 ms. (76 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4001 steps (16 resets) in 46 ms. (85 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4004 steps (16 resets) in 45 ms. (87 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4002 steps (16 resets) in 73 ms. (54 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (16 resets) in 65 ms. (60 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4004 steps (16 resets) in 35 ms. (111 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4002 steps (16 resets) in 35 ms. (111 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (16 resets) in 37 ms. (105 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4004 steps (16 resets) in 30 ms. (129 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (16 resets) in 26 ms. (148 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4002 steps (16 resets) in 20 ms. (190 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4002 steps (16 resets) in 20 ms. (190 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (16 resets) in 21 ms. (181 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4004 steps (16 resets) in 21 ms. (182 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4002 steps (16 resets) in 33 ms. (117 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4004 steps (16 resets) in 31 ms. (125 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (16 resets) in 24 ms. (160 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (16 resets) in 33 ms. (117 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4004 steps (16 resets) in 20 ms. (190 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (16 resets) in 28 ms. (138 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (16 resets) in 50 ms. (78 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (16 resets) in 39 ms. (100 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (16 resets) in 26 ms. (148 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4002 steps (16 resets) in 27 ms. (142 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4004 steps (16 resets) in 29 ms. (133 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (16 resets) in 74 ms. (53 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (16 resets) in 46 ms. (85 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4002 steps (16 resets) in 43 ms. (90 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4004 steps (16 resets) in 46 ms. (85 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (16 resets) in 47 ms. (83 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4004 steps (16 resets) in 49 ms. (80 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4004 steps (16 resets) in 40 ms. (97 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (16 resets) in 67 ms. (58 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4004 steps (16 resets) in 70 ms. (56 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4004 steps (16 resets) in 43 ms. (91 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (16 resets) in 41 ms. (95 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (16 resets) in 40 ms. (97 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4004 steps (16 resets) in 33 ms. (117 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (16 resets) in 43 ms. (90 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (16 resets) in 37 ms. (105 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4004 steps (16 resets) in 41 ms. (95 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4004 steps (16 resets) in 55 ms. (71 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4002 steps (16 resets) in 38 ms. (102 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4002 steps (16 resets) in 41 ms. (95 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4001 steps (16 resets) in 39 ms. (100 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4004 steps (16 resets) in 41 ms. (95 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (16 resets) in 50 ms. (78 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4004 steps (16 resets) in 41 ms. (95 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4004 steps (16 resets) in 41 ms. (95 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (16 resets) in 39 ms. (100 steps per ms) remains 97/97 properties
[2026-06-10 14:56:37] [INFO ] Invariant cache hit.
[2026-06-10 14:56:37] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp108 is UNSAT
Problem AtomicPropp113 is UNSAT
At refinement iteration 1 (OVERLAPS) 294/443 variables, 18/18 constraints. Problems are: Problem set: 19 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 0/18 constraints. Problems are: Problem set: 19 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 4/447 variables, 4/22 constraints. Problems are: Problem set: 19 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 0/22 constraints. Problems are: Problem set: 19 solved, 78 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp87 is UNSAT
Problem AtomicPropp89 is UNSAT
Problem AtomicPropp90 is UNSAT
Problem AtomicPropp96 is UNSAT
Problem AtomicPropp98 is UNSAT
Problem AtomicPropp100 is UNSAT
Problem AtomicPropp102 is UNSAT
Problem AtomicPropp103 is UNSAT
Problem AtomicPropp110 is UNSAT
Problem AtomicPropp112 is UNSAT
Problem AtomicPropp115 is UNSAT
At refinement iteration 5 (OVERLAPS) 486/933 variables, 447/469 constraints. Problems are: Problem set: 41 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/933 variables, 100/569 constraints. Problems are: Problem set: 41 solved, 56 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 933/936 variables, and 569 constraints, problems are : Problem set: 41 solved, 56 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 447/450 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 41 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 41 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 329/433 variables, 17/17 constraints. Problems are: Problem set: 41 solved, 56 unsolved
SMT process timed out in 10243ms, After SMT, problems are : Problem set: 41 solved, 56 unsolved
Fused 56 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 104 out of 450 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 450/450 places, 486/486 transitions.
Graph (complete) has 1071 edges and 450 vertex of which 438 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.5 ms
Discarding 12 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 438 transition count 480
Reduce places removed 6 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 9 rules applied. Total rules applied 16 place count 432 transition count 477
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 19 place count 429 transition count 477
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 37 place count 411 transition count 459
Iterating global reduction 3 with 18 rules applied. Total rules applied 55 place count 411 transition count 459
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 2 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 221 place count 328 transition count 376
Free-agglomeration rule (complex) applied 66 times.
Iterating global reduction 3 with 66 rules applied. Total rules applied 287 place count 328 transition count 310
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 3 with 66 rules applied. Total rules applied 353 place count 262 transition count 310
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 354 place count 262 transition count 310
Applied a total of 354 rules in 224 ms. Remains 262 /450 variables (removed 188) and now considering 310/486 (removed 176) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 262/450 places, 310/486 transitions.
RANDOM walk for 40000 steps (1192 resets) in 1205 ms. (33 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (27 resets) in 32 ms. (121 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (27 resets) in 35 ms. (111 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (27 resets) in 32 ms. (121 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (26 resets) in 33 ms. (117 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (26 resets) in 33 ms. (117 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (28 resets) in 28 ms. (138 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (28 resets) in 25 ms. (153 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (28 resets) in 33 ms. (117 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (28 resets) in 40 ms. (97 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (27 resets) in 55 ms. (71 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (27 resets) in 33 ms. (117 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (27 resets) in 41 ms. (95 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (28 resets) in 31 ms. (125 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (28 resets) in 34 ms. (114 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (26 resets) in 33 ms. (117 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (27 resets) in 30 ms. (129 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (28 resets) in 29 ms. (133 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (28 resets) in 28 ms. (138 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (26 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (28 resets) in 19 ms. (200 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (25 resets) in 14 ms. (266 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (28 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (26 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (27 resets) in 14 ms. (266 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (27 resets) in 21 ms. (181 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (28 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (26 resets) in 17 ms. (222 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (26 resets) in 21 ms. (181 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (26 resets) in 19 ms. (200 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (27 resets) in 14 ms. (266 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4001 steps (25 resets) in 56 ms. (70 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (28 resets) in 24 ms. (160 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (27 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (26 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (28 resets) in 36 ms. (108 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (27 resets) in 19 ms. (200 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4000 steps (27 resets) in 23 ms. (166 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (26 resets) in 36 ms. (108 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (26 resets) in 17 ms. (222 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (25 resets) in 24 ms. (160 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (27 resets) in 17 ms. (222 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (26 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (28 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (27 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (28 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (27 resets) in 12 ms. (307 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (27 resets) in 13 ms. (285 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (28 resets) in 12 ms. (307 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (28 resets) in 13 ms. (286 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (28 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
Interrupted probabilistic random walk after 232529 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 56
Probabilistic random walk after 232529 steps, saw 66616 distinct states, run finished after 3007 ms. (steps per millisecond=77 ) 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-12530272862664273778.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6609110851539158422.kers'
[2026-06-10 14:56:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12530272862664273778.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6609110851539158422.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 310 rows 252 cols 942 entries
Finished phase 1 with 240 SingleSign rule and 0 generalized
[2026-06-10 14:56:51] [INFO ] Computed 22 invariants in 2 ms
Computed 22 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6609110851539158422.kers
Total runtime 3 ms.
[2026-06-10 14:56:51] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 153/257 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (OVERLAPS) 5/262 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 310/572 variables, 262/284 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 100/384 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/572 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 384 constraints, problems are : Problem set: 0 solved, 56 unsolved in 15234 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 262/262 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 153/257 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 5/262 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 310/572 variables, 262/336 constraints. Problems are: Problem set: 0 solved, 56 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp92 is UNSAT
Problem AtomicPropp95 is UNSAT
Problem AtomicPropp104 is UNSAT
Problem AtomicPropp107 is UNSAT
Problem AtomicPropp111 is UNSAT
Problem AtomicPropp114 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 100/436 constraints. Problems are: Problem set: 32 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 24/460 constraints. Problems are: Problem set: 32 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/572 variables, 0/460 constraints. Problems are: Problem set: 32 solved, 24 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 460 constraints, problems are : Problem set: 32 solved, 24 unsolved in 45012 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 262/262 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 24/56 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60269ms problems are : Problem set: 32 solved, 24 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 262 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 262/262 places, 310/310 transitions.
Graph (complete) has 856 edges and 262 vertex of which 256 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 256 transition count 309
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 255 transition count 309
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 7 place count 251 transition count 305
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 251 transition count 305
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 73 place count 220 transition count 274
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 2 with 28 rules applied. Total rules applied 101 place count 220 transition count 246
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 129 place count 192 transition count 246
Applied a total of 129 rules in 102 ms. Remains 192 /262 variables (removed 70) and now considering 246/310 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 192/262 places, 246/310 transitions.
RANDOM walk for 40000 steps (1422 resets) in 788 ms. (50 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (31 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (32 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (30 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (32 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (29 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (29 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (32 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (31 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (30 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (28 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (30 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (30 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (30 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (30 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (28 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (28 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (30 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (28 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (30 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (31 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (28 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (32 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (31 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (29 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
Probably explored full state space saw : 47680 states, properties seen :0
Probabilistic random walk after 178944 steps, saw 47680 distinct states, run finished after 1499 ms. (steps per millisecond=119 ) properties seen :0
Explored full state space saw : 47680 states, properties seen :0
Exhaustive walk after 178944 steps, saw 47680 distinct states, run finished after 1537 ms. (steps per millisecond=116 ) properties seen :0
Successfully simplified 97 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA FileSystem-PT-N02I10B10-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I10B10-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I10B10-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I10B10-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I10B10-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 14:57:55] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2026-06-10 14:57:55] [INFO ] Flatten gal took : 36 ms
[2026-06-10 14:57:55] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FileSystem-PT-N02I10B10-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I10B10-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I10B10-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I10B10-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 14:57:55] [INFO ] Flatten gal took : 34 ms
[2026-06-10 14:57:55] [INFO ] Input system was already deterministic with 486 transitions.
Support contains 11 out of 450 places (down from 13) after GAL structural reductions.
FORMULA FileSystem-PT-N02I10B10-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 140 stabilizing places and 186 stable transitions
Graph (complete) has 1081 edges and 450 vertex of which 417 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 486/486 transitions.
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 418 transition count 486
Discarding 55 places :
Symmetric choice reduction at 1 with 55 rule applications. Total rules 87 place count 363 transition count 431
Iterating global reduction 1 with 55 rules applied. Total rules applied 142 place count 363 transition count 431
Applied a total of 142 rules in 22 ms. Remains 363 /450 variables (removed 87) and now considering 431/486 (removed 55) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4596994558551161985.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17005407295014069990.kers'
[2026-06-10 14:57:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4596994558551161985.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17005407295014069990.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 431 rows 353 cols 1184 entries
Finished phase 1 with 341 SingleSign rule and 0 generalized
[2026-06-10 14:57:55] [INFO ] Computed 22 invariants in 5 ms
Computed 22 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-17005407295014069990.kers
Total runtime 6 ms.
[2026-06-10 14:57:55] [INFO ] Implicit Places using invariants in 260 ms returned []
[2026-06-10 14:57:55] [INFO ] Invariant cache hit.
[2026-06-10 14:57:55] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 14:57:58] [INFO ] Implicit Places using invariants and state equation in 2784 ms returned []
Implicit Place search using SMT with State Equation took 3051 ms to find 0 implicit places.
Running 421 sub problems to find dead transitions.
[2026-06-10 14:57:58] [INFO ] Invariant cache hit.
[2026-06-10 14:57:58] [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
SMT process timed out in 30293ms, After SMT, problems are : Problem set: 0 solved, 421 unsolved
Search for dead transitions found 0 dead transitions in 30295ms
Starting structural reductions in LTL mode, iteration 1 : 363/450 places, 431/486 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33371 ms. Remains : 363/450 places, 431/486 transitions.
[2026-06-10 14:58:28] [INFO ] Flatten gal took : 37 ms
[2026-06-10 14:58:28] [INFO ] Flatten gal took : 41 ms
[2026-06-10 14:58:28] [INFO ] Input system was already deterministic with 431 transitions.
[2026-06-10 14:58:28] [INFO ] Flatten gal took : 35 ms
[2026-06-10 14:58:28] [INFO ] Flatten gal took : 29 ms
[2026-06-10 14:58:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality1727588873460310220.gal : 29 ms
[2026-06-10 14:58:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality10347304653459597297.ctl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1727588873460310220.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10347304653459597297.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,382176,0.72559,16832,2,11188,5,39478,6,0,1843,23372,0


Converting to forward existential form...Done !
original formula: (AG(AX(FALSE)) + (AX((inode_7_13<=testbusy_3_14)) * EF(AX(FALSE))))
=> equivalent forward existential formula: ([(EY((Init * !(!(E(TRUE U !(!(EX(!(FALSE))))))))) * !((inode_7_13<=testbusy_3_14)))] = FALSE * [((Init * !(!(E(...226
Reverse transition relation is NOT exact ! Due to transitions t221, t226, t252, t257, t263, t268, t284, t289, t300, t305, t420, t421, t422, t423, t424, t42...289
(forward)formula 0,1,14.3064,374700,1,0,237,1.80034e+06,544,131,7908,1.10648e+06,614
FORMULA FileSystem-PT-N02I10B10-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 486/486 transitions.
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 418 transition count 486
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 86 place count 364 transition count 432
Iterating global reduction 1 with 54 rules applied. Total rules applied 140 place count 364 transition count 432
Applied a total of 140 rules in 19 ms. Remains 364 /450 variables (removed 86) and now considering 432/486 (removed 54) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15915921535650671351.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9540910943420702375.kers'
[2026-06-10 14:58:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15915921535650671351.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9540910943420702375.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 432 rows 354 cols 1187 entries
Finished phase 1 with 342 SingleSign rule and 0 generalized
[2026-06-10 14:58:43] [INFO ] Computed 22 invariants in 4 ms
Computed 22 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9540910943420702375.kers
Total runtime 5 ms.
[2026-06-10 14:58:43] [INFO ] Implicit Places using invariants in 319 ms returned []
[2026-06-10 14:58:43] [INFO ] Invariant cache hit.
[2026-06-10 14:58:44] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 14:58:45] [INFO ] Implicit Places using invariants and state equation in 1956 ms returned []
Implicit Place search using SMT with State Equation took 2280 ms to find 0 implicit places.
Running 422 sub problems to find dead transitions.
[2026-06-10 14:58:45] [INFO ] Invariant cache hit.
[2026-06-10 14:58:45] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (OVERLAPS) 11/363 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 363/796 variables, and 44 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/364 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 422 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (OVERLAPS) 11/363 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 422 unsolved
SMT process timed out in 60278ms, After SMT, problems are : Problem set: 0 solved, 422 unsolved
Search for dead transitions found 0 dead transitions in 60280ms
Starting structural reductions in LTL mode, iteration 1 : 364/450 places, 432/486 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62583 ms. Remains : 364/450 places, 432/486 transitions.
[2026-06-10 14:59:46] [INFO ] Flatten gal took : 31 ms
[2026-06-10 14:59:46] [INFO ] Flatten gal took : 27 ms
[2026-06-10 14:59:46] [INFO ] Input system was already deterministic with 432 transitions.
[2026-06-10 14:59:46] [INFO ] Flatten gal took : 27 ms
[2026-06-10 14:59:46] [INFO ] Flatten gal took : 27 ms
[2026-06-10 14:59:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality4635074874317285690.gal : 12 ms
[2026-06-10 14:59:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality3540117243036210882.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/CTLCardinality4635074874317285690.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3540117243036210882.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,382176,0.652459,18148,2,11750,5,44784,6,0,1848,27164,0


Converting to forward existential form...Done !
original formula: EX((EF((busy_12_21>loop_2_12)) * ((inode_10_20<1)||(endloop_8_11>=1))))
=> equivalent forward existential formula: [(FwdU((EY(Init) * ((inode_10_20<1)||(endloop_8_11>=1))),TRUE) * (busy_12_21>loop_2_12))] != FALSE
(forward)formula 0,1,1.04132,21848,1,0,10,56001,10,2,3335,37570,5
FORMULA FileSystem-PT-N02I10B10-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 450/450 places, 486/486 transitions.
Graph (complete) has 1081 edges and 450 vertex of which 417 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.3 ms
Discarding 33 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 417 transition count 476
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 407 transition count 476
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 77 place count 351 transition count 420
Iterating global reduction 2 with 56 rules applied. Total rules applied 133 place count 351 transition count 420
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 353 place count 241 transition count 310
Applied a total of 353 rules in 56 ms. Remains 241 /450 variables (removed 209) and now considering 310/486 (removed 176) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7639281655345839576.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13131774313876336758.kers'
[2026-06-10 14:59:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7639281655345839576.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13131774313876336758.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 310 rows 231 cols 1030 entries
Finished phase 1 with 219 SingleSign rule and 0 generalized
[2026-06-10 14:59:47] [INFO ] Computed 22 invariants in 2 ms
Computed 22 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13131774313876336758.kers
Total runtime 3 ms.
[2026-06-10 14:59:47] [INFO ] Implicit Places using invariants in 568 ms returned []
[2026-06-10 14:59:47] [INFO ] Invariant cache hit.
[2026-06-10 14:59:48] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 14:59:50] [INFO ] Implicit Places using invariants and state equation in 2728 ms returned []
Implicit Place search using SMT with State Equation took 3300 ms to find 0 implicit places.
[2026-06-10 14:59:50] [INFO ] Redundant transitions in 27 ms returned []
Running 300 sub problems to find dead transitions.
[2026-06-10 14:59:50] [INFO ] Invariant cache hit.
[2026-06-10 14:59:50] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 11/241 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 300 unsolved
SMT process timed out in 30130ms, After SMT, problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 30132ms
Starting structural reductions in SI_CTL mode, iteration 1 : 241/450 places, 310/486 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33522 ms. Remains : 241/450 places, 310/486 transitions.
[2026-06-10 15:00:20] [INFO ] Flatten gal took : 28 ms
[2026-06-10 15:00:20] [INFO ] Flatten gal took : 19 ms
[2026-06-10 15:00:20] [INFO ] Input system was already deterministic with 310 transitions.
[2026-06-10 15:00:20] [INFO ] Flatten gal took : 18 ms
[2026-06-10 15:00:20] [INFO ] Flatten gal took : 16 ms
[2026-06-10 15:00:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality7853356928482741282.gal : 6 ms
[2026-06-10 15:00:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality5843675093432513353.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/CTLCardinality7853356928482741282.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5843675093432513353.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,112384,0.489247,13472,2,3670,5,21034,6,0,1237,11811,0


Converting to forward existential form...Done !
original formula: AF(EG((testbusy_4_17<=0)))
=> equivalent forward existential formula: [FwdG(Init,!(EG((testbusy_4_17<=0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t111, t116, t132, t137, t153, t158, t174, t179, t190, t195, Intersection with reachable at e...223
dead was empty
(forward)formula 0,1,5.36897,162824,1,0,367,636627,391,175,6166,525552,644
FORMULA FileSystem-PT-N02I10B10-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 486/486 transitions.
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 418 transition count 486
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 86 place count 364 transition count 432
Iterating global reduction 1 with 54 rules applied. Total rules applied 140 place count 364 transition count 432
Applied a total of 140 rules in 13 ms. Remains 364 /450 variables (removed 86) and now considering 432/486 (removed 54) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1437454101997345049.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16353960466354575402.kers'
[2026-06-10 15:00:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1437454101997345049.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16353960466354575402.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 432 rows 354 cols 1187 entries
Finished phase 1 with 342 SingleSign rule and 0 generalized
[2026-06-10 15:00:26] [INFO ] Computed 22 invariants in 3 ms
Computed 22 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16353960466354575402.kers
Total runtime 4 ms.
[2026-06-10 15:00:26] [INFO ] Implicit Places using invariants in 331 ms returned []
[2026-06-10 15:00:26] [INFO ] Invariant cache hit.
[2026-06-10 15:00:27] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 15:00:29] [INFO ] Implicit Places using invariants and state equation in 2254 ms returned []
Implicit Place search using SMT with State Equation took 2588 ms to find 0 implicit places.
Running 422 sub problems to find dead transitions.
[2026-06-10 15:00:29] [INFO ] Invariant cache hit.
[2026-06-10 15:00:29] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (OVERLAPS) 11/363 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 363/796 variables, and 45 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/364 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 422 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (OVERLAPS) 11/363 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 422 unsolved
SMT process timed out in 60223ms, After SMT, problems are : Problem set: 0 solved, 422 unsolved
Search for dead transitions found 0 dead transitions in 60225ms
Starting structural reductions in LTL mode, iteration 1 : 364/450 places, 432/486 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62827 ms. Remains : 364/450 places, 432/486 transitions.
[2026-06-10 15:01:29] [INFO ] Flatten gal took : 20 ms
[2026-06-10 15:01:29] [INFO ] Flatten gal took : 20 ms
[2026-06-10 15:01:29] [INFO ] Input system was already deterministic with 432 transitions.
[2026-06-10 15:01:29] [INFO ] Flatten gal took : 21 ms
[2026-06-10 15:01:29] [INFO ] Flatten gal took : 20 ms
[2026-06-10 15:01:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality6783193457822694657.gal : 6 ms
[2026-06-10 15:01:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality6136016970828007173.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/CTLCardinality6783193457822694657.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6136016970828007173.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,382176,0.805131,17048,2,10853,5,39129,6,0,1848,24464,0


Converting to forward existential form...Done !
original formula: AG(EX((EX(TRUE) + ((inode_2_14<=testbusy_9_15)&&(endloop_6_15<=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((EX(TRUE) + ((inode_2_14<=testbusy_9_15)&&(endloop_6_15<=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
(forward)formula 0,0,10.5341,259648,1,0,175,740655,539,99,7494,474558,534
FORMULA FileSystem-PT-N02I10B10-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 486/486 transitions.
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 417 transition count 486
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 89 place count 361 transition count 430
Iterating global reduction 1 with 56 rules applied. Total rules applied 145 place count 361 transition count 430
Applied a total of 145 rules in 13 ms. Remains 361 /450 variables (removed 89) and now considering 430/486 (removed 56) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-290277797743141370.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12666163119192647030.kers'
[2026-06-10 15:01:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-290277797743141370.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12666163119192647030.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 15:01:40] [INFO ] Computed 22 invariants in 4 ms
Computed 22 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-12666163119192647030.kers
Total runtime 5 ms.
[2026-06-10 15:01:40] [INFO ] Implicit Places using invariants in 443 ms returned []
[2026-06-10 15:01:40] [INFO ] Invariant cache hit.
[2026-06-10 15:01:40] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 15:01:42] [INFO ] Implicit Places using invariants and state equation in 2106 ms returned []
Implicit Place search using SMT with State Equation took 2552 ms to find 0 implicit places.
Running 420 sub problems to find dead transitions.
[2026-06-10 15:01:42] [INFO ] Invariant cache hit.
[2026-06-10 15:01:42] [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
SMT process timed out in 30245ms, After SMT, problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 30246ms
Starting structural reductions in LTL mode, iteration 1 : 361/450 places, 430/486 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32813 ms. Remains : 361/450 places, 430/486 transitions.
[2026-06-10 15:02:12] [INFO ] Flatten gal took : 17 ms
[2026-06-10 15:02:12] [INFO ] Flatten gal took : 18 ms
[2026-06-10 15:02:12] [INFO ] Input system was already deterministic with 430 transitions.
[2026-06-10 15:02:13] [INFO ] Flatten gal took : 18 ms
[2026-06-10 15:02:13] [INFO ] Flatten gal took : 17 ms
[2026-06-10 15:02:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality2001626215244463993.gal : 8 ms
[2026-06-10 15:02:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality669373192129343452.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/CTLCardinality2001626215244463993.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality669373192129343452.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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,325504,0.718533,16252,2,9961,5,37580,6,0,1837,23490,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.779127,16252,1,0,6,37580,7,1,2613,23490,1
FORMULA FileSystem-PT-N02I10B10-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 486/486 transitions.
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 417 transition count 486
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 89 place count 361 transition count 430
Iterating global reduction 1 with 56 rules applied. Total rules applied 145 place count 361 transition count 430
Applied a total of 145 rules in 12 ms. Remains 361 /450 variables (removed 89) and now considering 430/486 (removed 56) transitions.
[2026-06-10 15:02:13] [INFO ] Invariant cache hit.
[2026-06-10 15:02:14] [INFO ] Implicit Places using invariants in 294 ms returned []
[2026-06-10 15:02:14] [INFO ] Invariant cache hit.
[2026-06-10 15:02:14] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 15:02:19] [INFO ] Implicit Places using invariants and state equation in 5709 ms returned []
Implicit Place search using SMT with State Equation took 6006 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 361/450 places, 430/486 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6018 ms. Remains : 361/450 places, 430/486 transitions.
[2026-06-10 15:02:19] [INFO ] Flatten gal took : 11 ms
[2026-06-10 15:02:19] [INFO ] Flatten gal took : 12 ms
[2026-06-10 15:02:19] [INFO ] Input system was already deterministic with 430 transitions.
[2026-06-10 15:02:19] [INFO ] Flatten gal took : 11 ms
[2026-06-10 15:02:19] [INFO ] Flatten gal took : 12 ms
[2026-06-10 15:02:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality16361259624466252256.gal : 4 ms
[2026-06-10 15:02:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality14575147715869256547.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/CTLCardinality16361259624466252256.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14575147715869256547.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,325504,0.551601,16268,2,9961,5,37580,6,0,1837,23490,0


Converting to forward existential form...Done !
original formula: EX(EG((beginloop_3_16<=0)))
=> equivalent forward existential formula: [FwdG(EY(Init),(beginloop_3_16<=0))] != FALSE
Hit Full ! (commute/partial/dont) 428/0/2
(forward)formula 0,1,12.2432,298000,1,0,74,864347,18,4,5787,493985,73
FORMULA FileSystem-PT-N02I10B10-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-06-10 15:02:32] [INFO ] Flatten gal took : 15 ms
[2026-06-10 15:02:32] [INFO ] Flatten gal took : 13 ms
Total runtime 427620 ms.

BK_STOP 1781103752416

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FileSystem-PT-N02I10B10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is FileSystem-PT-N02I10B10, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r338-smll-178021499300417"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FileSystem-PT-N02I10B10.tgz
mv FileSystem-PT-N02I10B10 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;