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.r098-tall-177955695700697.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 DLCshifumi-PT-3a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695700697
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.1K Mar 6 17:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Mar 6 17:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 6 17:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 6 17:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 09:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 09:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 6 17:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Mar 6 17:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Mar 6 17:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Mar 6 17:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 778K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DLCshifumi-PT-3a-CTLCardinality-2024-00
FORMULA_NAME DLCshifumi-PT-3a-CTLCardinality-2024-01
FORMULA_NAME DLCshifumi-PT-3a-CTLCardinality-2024-02
FORMULA_NAME DLCshifumi-PT-3a-CTLCardinality-2024-03
FORMULA_NAME DLCshifumi-PT-3a-CTLCardinality-2024-04
FORMULA_NAME DLCshifumi-PT-3a-CTLCardinality-2024-05
FORMULA_NAME DLCshifumi-PT-3a-CTLCardinality-2024-06
FORMULA_NAME DLCshifumi-PT-3a-CTLCardinality-2024-07
FORMULA_NAME DLCshifumi-PT-3a-CTLCardinality-2024-08
FORMULA_NAME DLCshifumi-PT-3a-CTLCardinality-2024-09
FORMULA_NAME DLCshifumi-PT-3a-CTLCardinality-2024-10
FORMULA_NAME DLCshifumi-PT-3a-CTLCardinality-2024-11
FORMULA_NAME DLCshifumi-PT-3a-CTLCardinality-2024-12
FORMULA_NAME DLCshifumi-PT-3a-CTLCardinality-2024-13
FORMULA_NAME DLCshifumi-PT-3a-CTLCardinality-2024-14
FORMULA_NAME DLCshifumi-PT-3a-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779653594884

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCshifumi-PT-3a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-24 20:13:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 20:13:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 20:13:16] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2026-05-24 20:13:16] [INFO ] Transformed 544 places.
[2026-05-24 20:13:16] [INFO ] Transformed 3097 transitions.
[2026-05-24 20:13:16] [INFO ] Found NUPN structural information;
[2026-05-24 20:13:16] [INFO ] Parsed PT model containing 544 places and 3097 transitions and 11545 arcs in 275 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Ensure Unique test removed 405 transitions
Reduce redundant transitions removed 405 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA DLCshifumi-PT-3a-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-3a-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 97 out of 544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 2692/2692 transitions.
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 65 place count 479 transition count 2237
Iterating global reduction 0 with 65 rules applied. Total rules applied 130 place count 479 transition count 2237
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 160 place count 479 transition count 2207
Drop transitions (Redundant composition of simpler transitions.) removed 644 transitions
Redundant transition composition rules discarded 644 transitions
Iterating global reduction 1 with 644 rules applied. Total rules applied 804 place count 479 transition count 1563
Applied a total of 804 rules in 142 ms. Remains 479 /544 variables (removed 65) and now considering 1563/2692 (removed 1129) transitions.
[2026-05-24 20:13:16] [INFO ] Flow matrix only has 345 transitions (discarded 1218 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14236161777373440531.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7557998539342910944.kers'
[2026-05-24 20:13:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14236161777373440531.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7557998539342910944.kers]
Normalized transition count is 344 out of 345 initially.
Culling duplicate invariants (modulo rational): removing 240 columns.
Culled 240 columns in 0 ms.
// Phase 1: matrix 344 rows 239 cols 729 entries
Finished phase 1 with 197 SingleSign rule and 0 generalized
[2026-05-24 20:13:16] [INFO ] Computed 282 invariants in 1 ms
Computed 282 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7557998539342910944.kers
Total runtime 3 ms.
[2026-05-24 20:13:17] [INFO ] Implicit Places using invariants in 1119 ms returned [239, 240, 241, 242, 244, 245, 247, 249, 250, 251, 252, 254, 255, 256, 259, 260, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 277, 278, 279, 280, 281, 283, 284, 285, 286, 287, 288, 291, 293, 294, 295, 299, 300, 301, 302, 303, 304, 305, 306, 308, 309, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 327, 328, 329, 330, 331, 332, 333, 336, 337, 338, 339, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 364, 365, 366, 367, 368, 370, 371, 372, 373, 374, 375, 377, 378, 379, 380, 381, 383, 384, 385, 386, 387, 389, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 402, 403, 404, 405, 406, 408, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 433, 435, 436, 437, 438, 439, 441, 442, 444, 445, 446, 447, 448, 450, 452, 453, 455, 456, 457, 459, 460, 461, 462, 463, 464, 465, 467, 468, 469, 470, 472, 473, 474, 475, 478]
Discarding 196 places :
Ensure Unique test removed 873 transitions
Reduce isomorphic transitions removed 873 transitions.
Implicit Place search using SMT only with invariants took 1158 ms to find 196 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 283/544 places, 690/2692 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 229 transitions
Redundant transition composition rules discarded 229 transitions
Iterating global reduction 0 with 229 rules applied. Total rules applied 229 place count 283 transition count 461
Applied a total of 229 rules in 12 ms. Remains 283 /283 variables (removed 0) and now considering 461/690 (removed 229) transitions.
[2026-05-24 20:13:17] [INFO ] Flow matrix only has 345 transitions (discarded 116 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-931879700880124232.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8845029173797496207.kers'
[2026-05-24 20:13:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-931879700880124232.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8845029173797496207.kers]
Normalized transition count is 344 out of 345 initially.
Culling duplicate invariants (modulo rational): removing 44 columns.
Culled 44 columns in 0 ms.
// Phase 1: matrix 344 rows 239 cols 729 entries
Finished phase 1 with 197 SingleSign rule and 0 generalized
[2026-05-24 20:13:17] [INFO ] Computed 86 invariants in 1 ms
Computed 86 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8845029173797496207.kers
Total runtime 1 ms.
[2026-05-24 20:13:17] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-24 20:13:17] [INFO ] Flow matrix only has 345 transitions (discarded 116 similar events)
[2026-05-24 20:13:17] [INFO ] Invariant cache hit.
[2026-05-24 20:13:17] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-24 20:13:18] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 283/544 places, 461/2692 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1539 ms. Remains : 283/544 places, 461/2692 transitions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 461/461 transitions.
Applied a total of 0 rules in 3 ms. Remains 283 /283 variables (removed 0) and now considering 461/461 (removed 0) transitions.
[2026-05-24 20:13:18] [INFO ] Flow matrix only has 345 transitions (discarded 116 similar events)
[2026-05-24 20:13:18] [INFO ] Invariant cache hit.
[2026-05-24 20:13:18] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-24 20:13:18] [INFO ] Flow matrix only has 345 transitions (discarded 116 similar events)
[2026-05-24 20:13:18] [INFO ] Invariant cache hit.
[2026-05-24 20:13:18] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-24 20:13:18] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2026-05-24 20:13:18] [INFO ] Flow matrix only has 345 transitions (discarded 116 similar events)
[2026-05-24 20:13:18] [INFO ] Invariant cache hit.
[2026-05-24 20:13:18] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (OVERLAPS) 38/283 variables, 38/86 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (OVERLAPS) 344/627 variables, 283/369 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/627 variables, 4/373 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/627 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 8 (OVERLAPS) 1/628 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 628/628 variables, and 374 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 283/283 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (OVERLAPS) 38/283 variables, 38/86 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (OVERLAPS) 344/627 variables, 283/369 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/627 variables, 4/373 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/627 variables, 460/833 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/627 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 9 (OVERLAPS) 1/628 variables, 1/834 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 628/628 variables, and 834 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 283/283 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60149ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Finished structural reductions in LTL mode , in 1 iterations and 60363 ms. Remains : 283/283 places, 461/461 transitions.
Support contains 97 out of 283 places after structural reductions.
[2026-05-24 20:14:18] [INFO ] Flatten gal took : 51 ms
[2026-05-24 20:14:18] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA DLCshifumi-PT-3a-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-3a-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 20:14:18] [INFO ] Flatten gal took : 29 ms
[2026-05-24 20:14:18] [INFO ] Input system was already deterministic with 461 transitions.
Support contains 73 out of 283 places (down from 97) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2282 ms. (17 steps per ms) remains 7/43 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 7/7 properties
[2026-05-24 20:14:19] [INFO ] Flow matrix only has 345 transitions (discarded 116 similar events)
[2026-05-24 20:14:19] [INFO ] Invariant cache hit.
[2026-05-24 20:14:19] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp34 is UNSAT
At refinement iteration 1 (OVERLAPS) 21/39 variables, 18/18 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 244/283 variables, 68/86 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/86 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 344/627 variables, 283/369 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/627 variables, 4/373 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/627 variables, 0/373 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/628 variables, 1/374 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/628 variables, 0/374 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/628 variables, 0/374 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 628/628 variables, and 374 constraints, problems are : Problem set: 2 solved, 5 unsolved in 524 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 283/283 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp36 is UNSAT
After SMT solving in domain Int declared 23/628 variables, and 11 constraints, problems are : Problem set: 7 solved, 0 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 11/86 constraints, State Equation: 0/283 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 0/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 580ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 12 simplifications.
FORMULA DLCshifumi-PT-3a-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 20:14:20] [INFO ] Flatten gal took : 16 ms
[2026-05-24 20:14:20] [INFO ] Flatten gal took : 15 ms
[2026-05-24 20:14:20] [INFO ] Input system was already deterministic with 461 transitions.
Support contains 54 out of 283 places (down from 55) after GAL structural reductions.
Computed a total of 45 stabilizing places and 1 stable transitions
Graph (complete) has 562 edges and 283 vertex of which 245 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 461/461 transitions.
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 246 transition count 461
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 59 place count 224 transition count 417
Iterating global reduction 1 with 22 rules applied. Total rules applied 81 place count 224 transition count 417
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 89 place count 224 transition count 409
Applied a total of 89 rules in 11 ms. Remains 224 /283 variables (removed 59) and now considering 409/461 (removed 52) transitions.
[2026-05-24 20:14:20] [INFO ] Flow matrix only has 319 transitions (discarded 90 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1455164229336921086.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12651248818974567015.kers'
[2026-05-24 20:14:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1455164229336921086.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12651248818974567015.kers]
Normalized transition count is 318 out of 319 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 318 rows 221 cols 677 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-05-24 20:14:20] [INFO ] Computed 45 invariants in 1 ms
Computed 45 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12651248818974567015.kers
Total runtime 2 ms.
[2026-05-24 20:14:20] [INFO ] Implicit Places using invariants in 59 ms returned [221, 222]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 60 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 222/283 places, 409/461 transitions.
Applied a total of 0 rules in 3 ms. Remains 222 /222 variables (removed 0) and now considering 409/409 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74 ms. Remains : 222/283 places, 409/461 transitions.
[2026-05-24 20:14:20] [INFO ] Flatten gal took : 11 ms
[2026-05-24 20:14:20] [INFO ] Flatten gal took : 11 ms
[2026-05-24 20:14:20] [INFO ] Input system was already deterministic with 409 transitions.
[2026-05-24 20:14:20] [INFO ] Flatten gal took : 10 ms
[2026-05-24 20:14:20] [INFO ] Flatten gal took : 10 ms
[2026-05-24 20:14:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality10038041851306623230.gal : 5 ms
[2026-05-24 20:14:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality4745343966564273524.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10038041851306623230.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4745343966564273524.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,1.11759e+30,0.068159,5684,2,622,5,2374,6,0,1205,1624,0


Converting to forward existential form...Done !
original formula: EG(AF(EX(EG(((p455!=0)&&(p106!=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(EX(EG(((p455!=0)&&(p106!=1))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.293111,14172,1,0,7,51472,25,1,5261,4864,11
FORMULA DLCshifumi-PT-3a-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 283/283 places, 461/461 transitions.
Graph (trivial) has 448 edges and 283 vertex of which 232 / 283 are part of one of the 42 SCC in 7 ms
Free SCC test removed 190 places
Ensure Unique test removed 400 transitions
Reduce isomorphic transitions removed 400 transitions.
Graph (complete) has 162 edges and 93 vertex of which 56 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.1 ms
Discarding 37 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 56 transition count 59
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 54 transition count 59
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 51 place count 9 transition count 10
Iterating global reduction 2 with 45 rules applied. Total rules applied 96 place count 9 transition count 10
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 98 place count 9 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 7 transition count 6
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 104 place count 7 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 106 place count 5 transition count 4
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 108 place count 3 transition count 2
Iterating global reduction 4 with 2 rules applied. Total rules applied 110 place count 3 transition count 2
Applied a total of 110 rules in 23 ms. Remains 3 /283 variables (removed 280) and now considering 2/461 (removed 459) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3382347012096751792.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2150326876672358254.kers'
[2026-05-24 20:14:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3382347012096751792.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2150326876672358254.kers]
Normalized transition count is 1 out of 2 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 1 rows 1 cols 1 entries
Finished phase 1 with 1 SingleSign rule and 0 generalized
[2026-05-24 20:14:20] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2150326876672358254.kers
Total runtime 0 ms.
[2026-05-24 20:14:20] [INFO ] Implicit Places using invariants in 16 ms returned []
[2026-05-24 20:14:20] [INFO ] Invariant cache hit.
[2026-05-24 20:14:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 20:14:20] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2026-05-24 20:14:20] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2026-05-24 20:14:20] [INFO ] Invariant cache hit.
[2026-05-24 20:14:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/4 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/5 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/5 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5/5 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/4 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/5 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/5 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5/5 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 63ms
Starting structural reductions in SI_CTL mode, iteration 1 : 3/283 places, 2/461 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 128 ms. Remains : 3/283 places, 2/461 transitions.
[2026-05-24 20:14:21] [INFO ] Flatten gal took : 1 ms
[2026-05-24 20:14:21] [INFO ] Flatten gal took : 0 ms
[2026-05-24 20:14:21] [INFO ] Input system was already deterministic with 2 transitions.
[2026-05-24 20:14:21] [INFO ] Flatten gal took : 0 ms
[2026-05-24 20:14:21] [INFO ] Flatten gal took : 0 ms
[2026-05-24 20:14:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality14358923819480661477.gal : 0 ms
[2026-05-24 20:14:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality9965183718149018008.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/CTLCardinality14358923819480661477.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9965183718149018008.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2,0.001555,3728,2,6,5,16,6,0,10,8,0


Converting to forward existential form...Done !
original formula: EG(EF((p405==0)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (p405==0)))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.002175,4004,1,0,6,22,20,1,46,12,12
FORMULA DLCshifumi-PT-3a-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 461/461 transitions.
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 245 transition count 461
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 60 place count 223 transition count 417
Iterating global reduction 1 with 22 rules applied. Total rules applied 82 place count 223 transition count 417
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 91 place count 223 transition count 408
Applied a total of 91 rules in 10 ms. Remains 223 /283 variables (removed 60) and now considering 408/461 (removed 53) transitions.
[2026-05-24 20:14:21] [INFO ] Flow matrix only has 318 transitions (discarded 90 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10941003616935477942.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2569432584439802481.kers'
[2026-05-24 20:14:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10941003616935477942.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2569432584439802481.kers]
Normalized transition count is 317 out of 318 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 317 rows 221 cols 675 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-05-24 20:14:21] [INFO ] Computed 44 invariants in 1 ms
Computed 44 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2569432584439802481.kers
Total runtime 1 ms.
[2026-05-24 20:14:21] [INFO ] Implicit Places using invariants in 49 ms returned [221, 222]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 50 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 221/283 places, 408/461 transitions.
Applied a total of 0 rules in 4 ms. Remains 221 /221 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64 ms. Remains : 221/283 places, 408/461 transitions.
[2026-05-24 20:14:21] [INFO ] Flatten gal took : 9 ms
[2026-05-24 20:14:21] [INFO ] Flatten gal took : 11 ms
[2026-05-24 20:14:21] [INFO ] Input system was already deterministic with 408 transitions.
[2026-05-24 20:14:21] [INFO ] Flatten gal took : 9 ms
[2026-05-24 20:14:21] [INFO ] Flatten gal took : 9 ms
[2026-05-24 20:14:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality4043778339195960315.gal : 5 ms
[2026-05-24 20:14:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality1659382803788575192.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/CTLCardinality4043778339195960315.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1659382803788575192.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.11759e+30,0.058911,5780,2,613,5,2374,6,0,1203,1625,0


Converting to forward existential form...Done !
original formula: A(EF(EX(((EG((p33==1)) + !(((p256==1)||(p250==0)))) + (p282!=1)))) U AX(AG((p75==0))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(!(E(TRUE U !((p75==0))))))))))) * !(E(!(!(EX(!(!(E(TRUE U !((p75==0)))))))) U (!(E(TRUE ...273
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.29562,14512,1,0,12,53372,28,2,5249,7968,16
FORMULA DLCshifumi-PT-3a-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 283/283 places, 461/461 transitions.
Graph (trivial) has 412 edges and 283 vertex of which 208 / 283 are part of one of the 42 SCC in 1 ms
Free SCC test removed 166 places
Ensure Unique test removed 348 transitions
Reduce isomorphic transitions removed 348 transitions.
Graph (complete) has 214 edges and 117 vertex of which 81 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.0 ms
Discarding 36 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 81 transition count 109
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 8 rules applied. Total rules applied 14 place count 77 transition count 105
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 74 transition count 105
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 54 place count 37 transition count 63
Iterating global reduction 3 with 37 rules applied. Total rules applied 91 place count 37 transition count 63
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 95 place count 37 transition count 59
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 97 place count 36 transition count 58
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 101 place count 34 transition count 56
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 105 place count 34 transition count 52
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 107 place count 32 transition count 52
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 109 place count 30 transition count 50
Iterating global reduction 6 with 2 rules applied. Total rules applied 111 place count 30 transition count 50
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 112 place count 30 transition count 50
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 113 place count 29 transition count 49
Iterating global reduction 6 with 1 rules applied. Total rules applied 114 place count 29 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 115 place count 29 transition count 48
Applied a total of 115 rules in 13 ms. Remains 29 /283 variables (removed 254) and now considering 48/461 (removed 413) transitions.
[2026-05-24 20:14:21] [INFO ] Flow matrix only has 31 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4867880055667816224.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7729296702856573100.kers'
[2026-05-24 20:14:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4867880055667816224.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7729296702856573100.kers]
Normalized transition count is 30 out of 31 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 30 rows 26 cols 68 entries
Finished phase 1 with 17 SingleSign rule and 0 generalized
[2026-05-24 20:14:21] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7729296702856573100.kers
Total runtime 0 ms.
[2026-05-24 20:14:21] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-24 20:14:21] [INFO ] Flow matrix only has 31 transitions (discarded 17 similar events)
[2026-05-24 20:14:21] [INFO ] Invariant cache hit.
[2026-05-24 20:14:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 20:14:21] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2026-05-24 20:14:21] [INFO ] Redundant transitions in 0 ms returned []
Running 47 sub problems to find dead transitions.
[2026-05-24 20:14:21] [INFO ] Flow matrix only has 31 transitions (discarded 17 similar events)
[2026-05-24 20:14:21] [INFO ] Invariant cache hit.
[2026-05-24 20:14:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 2/29 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 30/59 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 1/60 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 42 constraints, problems are : Problem set: 0 solved, 47 unsolved in 730 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 29/29 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 2/29 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 30/59 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 47/88 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 1/60 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/60 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 89 constraints, problems are : Problem set: 0 solved, 47 unsolved in 719 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 29/29 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1453ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1453ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/283 places, 48/461 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1520 ms. Remains : 29/283 places, 48/461 transitions.
[2026-05-24 20:14:23] [INFO ] Flatten gal took : 4 ms
[2026-05-24 20:14:23] [INFO ] Flatten gal took : 2 ms
[2026-05-24 20:14:23] [INFO ] Input system was already deterministic with 48 transitions.
[2026-05-24 20:14:23] [INFO ] Flatten gal took : 1 ms
[2026-05-24 20:14:23] [INFO ] Flatten gal took : 1 ms
[2026-05-24 20:14:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality14023730426208585482.gal : 1 ms
[2026-05-24 20:14:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality12905496068105046571.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/CTLCardinality14023730426208585482.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12905496068105046571.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,6481,0.005096,3988,2,74,5,240,6,0,140,163,0


Converting to forward existential form...Done !
original formula: ((!(A(EF((p112==1)) U !(AF((p282==0))))) + E((!(((p318==0)||(p229==1))) * (A((p87==1) U (p164==1)) + EF(((p163==0)||(p223==1))))) U AF(!(...215
=> equivalent forward existential formula: [FwdG((Init * !((!(!((E(!(!(!(EG(!((p282==0)))))) U (!(E(TRUE U (p112==1))) * !(!(!(EG(!((p282==0)))))))) + EG(!...407
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 45/0/3
(forward)formula 0,1,0.016551,4724,1,0,24,1867,66,11,781,1425,29
FORMULA DLCshifumi-PT-3a-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 283/283 places, 461/461 transitions.
Graph (trivial) has 446 edges and 283 vertex of which 230 / 283 are part of one of the 42 SCC in 0 ms
Free SCC test removed 188 places
Ensure Unique test removed 397 transitions
Reduce isomorphic transitions removed 397 transitions.
Graph (complete) has 165 edges and 95 vertex of which 58 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.1 ms
Discarding 37 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 58 transition count 62
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 56 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 55 transition count 61
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 52 place count 11 transition count 13
Iterating global reduction 3 with 44 rules applied. Total rules applied 96 place count 11 transition count 13
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 98 place count 11 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 102 place count 9 transition count 9
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 104 place count 9 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 106 place count 7 transition count 7
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 108 place count 5 transition count 5
Iterating global reduction 5 with 2 rules applied. Total rules applied 110 place count 5 transition count 5
Applied a total of 110 rules in 10 ms. Remains 5 /283 variables (removed 278) and now considering 5/461 (removed 456) transitions.
[2026-05-24 20:14:23] [INFO ] Flow matrix only has 4 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8469675728099359116.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7183813709382917968.kers'
[2026-05-24 20:14:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8469675728099359116.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7183813709382917968.kers]
Normalized transition count is 3 out of 4 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 3 rows 3 cols 6 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-24 20:14:23] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7183813709382917968.kers
Total runtime 0 ms.
[2026-05-24 20:14:23] [INFO ] Implicit Places using invariants in 17 ms returned []
[2026-05-24 20:14:23] [INFO ] Flow matrix only has 4 transitions (discarded 1 similar events)
[2026-05-24 20:14:23] [INFO ] Invariant cache hit.
[2026-05-24 20:14:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 20:14:23] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2026-05-24 20:14:23] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2026-05-24 20:14:23] [INFO ] Flow matrix only has 4 transitions (discarded 1 similar events)
[2026-05-24 20:14:23] [INFO ] Invariant cache hit.
[2026-05-24 20:14:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/5 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/8 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/9 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/9 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/5 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/8 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/9 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/9 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/9 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/9 variables, and 13 constraints, problems are : Problem set: 0 solved, 4 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 110ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 110ms
Starting structural reductions in SI_CTL mode, iteration 1 : 5/283 places, 5/461 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 160 ms. Remains : 5/283 places, 5/461 transitions.
[2026-05-24 20:14:23] [INFO ] Flatten gal took : 1 ms
[2026-05-24 20:14:23] [INFO ] Flatten gal took : 0 ms
[2026-05-24 20:14:23] [INFO ] Input system was already deterministic with 5 transitions.
[2026-05-24 20:14:23] [INFO ] Flatten gal took : 0 ms
[2026-05-24 20:14:23] [INFO ] Flatten gal took : 0 ms
[2026-05-24 20:14:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality5892274778165183401.gal : 0 ms
[2026-05-24 20:14:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality2274699415102995853.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/CTLCardinality5892274778165183401.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2274699415102995853.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,3,0.001773,3748,2,10,5,30,6,0,20,16,0


Converting to forward existential form...Done !
original formula: EG(A(EF((p399==0)) U (p111==1)))
=> equivalent forward existential formula: [FwdG(Init,!((E(!((p111==1)) U (!(E(TRUE U (p399==0))) * !((p111==1)))) + EG(!((p111==1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 3/0/2
(forward)formula 0,0,0.003445,4304,1,0,9,58,29,5,104,48,13
FORMULA DLCshifumi-PT-3a-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 461/461 transitions.
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 246 transition count 461
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 59 place count 224 transition count 417
Iterating global reduction 1 with 22 rules applied. Total rules applied 81 place count 224 transition count 417
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 89 place count 224 transition count 409
Applied a total of 89 rules in 6 ms. Remains 224 /283 variables (removed 59) and now considering 409/461 (removed 52) transitions.
[2026-05-24 20:14:23] [INFO ] Flow matrix only has 319 transitions (discarded 90 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17702922501780621079.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9439276736740848309.kers'
[2026-05-24 20:14:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17702922501780621079.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9439276736740848309.kers]
Normalized transition count is 318 out of 319 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 318 rows 221 cols 677 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-05-24 20:14:23] [INFO ] Computed 45 invariants in 1 ms
Computed 45 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9439276736740848309.kers
Total runtime 1 ms.
[2026-05-24 20:14:23] [INFO ] Implicit Places using invariants in 47 ms returned [222, 223]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 49 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 222/283 places, 409/461 transitions.
Applied a total of 0 rules in 7 ms. Remains 222 /222 variables (removed 0) and now considering 409/409 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 222/283 places, 409/461 transitions.
[2026-05-24 20:14:23] [INFO ] Flatten gal took : 9 ms
[2026-05-24 20:14:23] [INFO ] Flatten gal took : 9 ms
[2026-05-24 20:14:23] [INFO ] Input system was already deterministic with 409 transitions.
[2026-05-24 20:14:23] [INFO ] Flatten gal took : 8 ms
[2026-05-24 20:14:23] [INFO ] Flatten gal took : 7 ms
[2026-05-24 20:14:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality9644115869565667367.gal : 1 ms
[2026-05-24 20:14:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality10664398322667327569.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/CTLCardinality9644115869565667367.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10664398322667327569.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,1.11759e+30,0.060757,5776,2,622,5,2374,6,0,1205,1624,0


Converting to forward existential form...Done !
original formula: EG(EF(EX(((AF((p115==1)) * EF((p362==1))) * AX((p148==1))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U EX(((!(EG(!((p115==1)))) * E(TRUE U (p362==1))) * !(EX(!((p148==1))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.258533,13820,1,0,7,50942,22,0,4902,4321,7
FORMULA DLCshifumi-PT-3a-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 283/283 places, 461/461 transitions.
Graph (trivial) has 444 edges and 283 vertex of which 228 / 283 are part of one of the 42 SCC in 1 ms
Free SCC test removed 186 places
Ensure Unique test removed 393 transitions
Reduce isomorphic transitions removed 393 transitions.
Graph (complete) has 169 edges and 97 vertex of which 59 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.0 ms
Discarding 38 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Graph (trivial) has 17 edges and 14 vertex of which 8 / 14 are part of one of the 2 SCC in 1 ms
Free SCC test removed 6 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 91 rules applied. Total rules applied 93 place count 8 transition count 21
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 108 place count 5 transition count 9
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 111 place count 5 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 112 place count 5 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 113 place count 4 transition count 5
Applied a total of 113 rules in 5 ms. Remains 4 /283 variables (removed 279) and now considering 5/461 (removed 456) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4753836832308663694.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17551735028342740297.kers'
[2026-05-24 20:14:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4753836832308663694.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17551735028342740297.kers]
Normalized transition count is 4 out of 5 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 4 rows 2 cols 4 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-24 20:14:23] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17551735028342740297.kers
Total runtime 0 ms.
[2026-05-24 20:14:23] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-24 20:14:23] [INFO ] Invariant cache hit.
[2026-05-24 20:14:23] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2026-05-24 20:14:23] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2026-05-24 20:14:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 61ms
Starting structural reductions in SI_CTL mode, iteration 1 : 4/283 places, 5/461 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 111 ms. Remains : 4/283 places, 5/461 transitions.
[2026-05-24 20:14:23] [INFO ] Flatten gal took : 1 ms
[2026-05-24 20:14:23] [INFO ] Flatten gal took : 0 ms
[2026-05-24 20:14:23] [INFO ] Input system was already deterministic with 5 transitions.
[2026-05-24 20:14:23] [INFO ] Flatten gal took : 1 ms
[2026-05-24 20:14:23] [INFO ] Flatten gal took : 0 ms
[2026-05-24 20:14:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality14557934055528097946.gal : 0 ms
[2026-05-24 20:14:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality887479992393839844.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/CTLCardinality14557934055528097946.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality887479992393839844.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,4,0.004964,3744,2,7,5,25,5,0,22,14,0


Converting to forward existential form...Done !
original formula: EG(((p300==0)||(p265==1)))
=> equivalent forward existential formula: [FwdG(Init,((p300==0)||(p265==1)))] != FALSE
Hit Full ! (commute/partial/dont) 0/0/5
(forward)formula 0,1,0.007552,4020,1,0,6,51,18,1,89,40,8
FORMULA DLCshifumi-PT-3a-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 461/461 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 253 transition count 461
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 47 place count 236 transition count 427
Iterating global reduction 1 with 17 rules applied. Total rules applied 64 place count 236 transition count 427
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 71 place count 236 transition count 420
Applied a total of 71 rules in 5 ms. Remains 236 /283 variables (removed 47) and now considering 420/461 (removed 41) transitions.
[2026-05-24 20:14:23] [INFO ] Flow matrix only has 322 transitions (discarded 98 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10044714014543613252.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17887116212545169321.kers'
[2026-05-24 20:14:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10044714014543613252.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17887116212545169321.kers]
Normalized transition count is 321 out of 322 initially.
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 321 rows 223 cols 683 entries
Finished phase 1 with 181 SingleSign rule and 0 generalized
[2026-05-24 20:14:23] [INFO ] Computed 55 invariants in 1 ms
Computed 55 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17887116212545169321.kers
Total runtime 2 ms.
[2026-05-24 20:14:23] [INFO ] Implicit Places using invariants in 56 ms returned [226, 230]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 57 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 234/283 places, 420/461 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 234 transition count 414
Applied a total of 6 rules in 4 ms. Remains 234 /234 variables (removed 0) and now considering 414/420 (removed 6) transitions.
[2026-05-24 20:14:23] [INFO ] Flow matrix only has 322 transitions (discarded 92 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14210480298952403102.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9532272198280241821.kers'
[2026-05-24 20:14:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14210480298952403102.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9532272198280241821.kers]
Normalized transition count is 321 out of 322 initially.
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 321 rows 223 cols 683 entries
Finished phase 1 with 181 SingleSign rule and 0 generalized
[2026-05-24 20:14:23] [INFO ] Computed 53 invariants in 1 ms
Computed 53 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9532272198280241821.kers
Total runtime 1 ms.
[2026-05-24 20:14:23] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-24 20:14:23] [INFO ] Flow matrix only has 322 transitions (discarded 92 similar events)
[2026-05-24 20:14:23] [INFO ] Invariant cache hit.
[2026-05-24 20:14:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 20:14:23] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 234/283 places, 414/461 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 228 ms. Remains : 234/283 places, 414/461 transitions.
[2026-05-24 20:14:23] [INFO ] Flatten gal took : 8 ms
[2026-05-24 20:14:23] [INFO ] Flatten gal took : 8 ms
[2026-05-24 20:14:23] [INFO ] Input system was already deterministic with 414 transitions.
[2026-05-24 20:14:23] [INFO ] Flatten gal took : 7 ms
[2026-05-24 20:14:24] [INFO ] Flatten gal took : 8 ms
[2026-05-24 20:14:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality10574274485916959207.gal : 2 ms
[2026-05-24 20:14:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality18130882719001398115.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/CTLCardinality10574274485916959207.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18130882719001398115.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.50874e+30,0.064839,5824,2,648,5,2465,6,0,1226,1676,0


Converting to forward existential form...Done !
original formula: (EF((((p47==0)&&(p161==1)) + EG(((p516==1)&&((p497==0)||(p37==1)))))) * ((AX(FALSE) + !(E((((p505==1)&&(p299==0))&&((p375==1)&&((p361==0)...334
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (((p47==0)&&(p161==1)) + EG(((p516==1)&&((p497==0)||(p37==1))))))))] = FALSE * [(FwdU((Init...510
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 411/3/3
Hit Full ! (commute/partial/dont) 410/10/4
(forward)formula 0,0,0.40397,15208,1,0,17,57823,41,7,5914,8694,23
FORMULA DLCshifumi-PT-3a-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 283/283 places, 461/461 transitions.
Graph (trivial) has 444 edges and 283 vertex of which 228 / 283 are part of one of the 42 SCC in 2 ms
Free SCC test removed 186 places
Ensure Unique test removed 394 transitions
Reduce isomorphic transitions removed 394 transitions.
Graph (complete) has 168 edges and 97 vertex of which 59 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.1 ms
Discarding 38 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Graph (trivial) has 16 edges and 14 vertex of which 8 / 14 are part of one of the 2 SCC in 0 ms
Free SCC test removed 6 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 91 rules applied. Total rules applied 93 place count 8 transition count 20
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 108 place count 5 transition count 8
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 110 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 112 place count 4 transition count 5
Applied a total of 112 rules in 12 ms. Remains 4 /283 variables (removed 279) and now considering 5/461 (removed 456) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9702092269788701960.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12973738104512098997.kers'
[2026-05-24 20:14:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9702092269788701960.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12973738104512098997.kers]
Normalized transition count is 4 out of 5 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 4 rows 2 cols 4 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-24 20:14:24] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12973738104512098997.kers
Total runtime 0 ms.
[2026-05-24 20:14:24] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-24 20:14:24] [INFO ] Invariant cache hit.
[2026-05-24 20:14:24] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2026-05-24 20:14:24] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_CTL mode, iteration 1 : 4/283 places, 5/461 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 69 ms. Remains : 4/283 places, 5/461 transitions.
[2026-05-24 20:14:24] [INFO ] Flatten gal took : 0 ms
[2026-05-24 20:14:24] [INFO ] Flatten gal took : 1 ms
[2026-05-24 20:14:24] [INFO ] Input system was already deterministic with 5 transitions.
[2026-05-24 20:14:24] [INFO ] Flatten gal took : 0 ms
[2026-05-24 20:14:24] [INFO ] Flatten gal took : 0 ms
[2026-05-24 20:14:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality5928563437242540272.gal : 1 ms
[2026-05-24 20:14:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality1496998916815571022.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/CTLCardinality5928563437242540272.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1496998916815571022.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,4,0.001811,3740,2,7,5,25,5,0,22,14,0


Converting to forward existential form...Done !
original formula: AF(AG((EF((p159==1)) + EG((p20==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((E(TRUE U (p159==1)) + EG((p20==1))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.003261,4284,1,0,7,54,25,1,87,41,9
FORMULA DLCshifumi-PT-3a-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 283/283 places, 461/461 transitions.
Graph (trivial) has 445 edges and 283 vertex of which 231 / 283 are part of one of the 42 SCC in 1 ms
Free SCC test removed 189 places
Ensure Unique test removed 397 transitions
Reduce isomorphic transitions removed 397 transitions.
Graph (complete) has 165 edges and 94 vertex of which 57 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.1 ms
Discarding 37 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 57 transition count 62
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 55 transition count 62
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 50 place count 11 transition count 14
Iterating global reduction 2 with 44 rules applied. Total rules applied 94 place count 11 transition count 14
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 96 place count 11 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 100 place count 9 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 9 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 104 place count 7 transition count 8
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 106 place count 5 transition count 6
Iterating global reduction 4 with 2 rules applied. Total rules applied 108 place count 5 transition count 6
Applied a total of 108 rules in 6 ms. Remains 5 /283 variables (removed 278) and now considering 6/461 (removed 455) transitions.
[2026-05-24 20:14:24] [INFO ] Flow matrix only has 4 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18313832895856059174.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14194110350706292007.kers'
[2026-05-24 20:14:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18313832895856059174.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14194110350706292007.kers]
Normalized transition count is 3 out of 4 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 3 rows 3 cols 6 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-24 20:14:24] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14194110350706292007.kers
Total runtime 0 ms.
[2026-05-24 20:14:24] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-24 20:14:24] [INFO ] Flow matrix only has 4 transitions (discarded 2 similar events)
[2026-05-24 20:14:24] [INFO ] Invariant cache hit.
[2026-05-24 20:14:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 20:14:24] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2026-05-24 20:14:24] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-24 20:14:24] [INFO ] Flow matrix only has 4 transitions (discarded 2 similar events)
[2026-05-24 20:14:24] [INFO ] Invariant cache hit.
[2026-05-24 20:14:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/5 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 3/8 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/9 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/9 variables, and 9 constraints, problems are : Problem set: 0 solved, 5 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/5 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 3/8 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/9 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/9 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/9 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/9 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 115ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 115ms
Starting structural reductions in SI_CTL mode, iteration 1 : 5/283 places, 6/461 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 171 ms. Remains : 5/283 places, 6/461 transitions.
[2026-05-24 20:14:24] [INFO ] Flatten gal took : 0 ms
[2026-05-24 20:14:24] [INFO ] Flatten gal took : 0 ms
[2026-05-24 20:14:24] [INFO ] Input system was already deterministic with 6 transitions.
[2026-05-24 20:14:24] [INFO ] Flatten gal took : 1 ms
[2026-05-24 20:14:24] [INFO ] Flatten gal took : 0 ms
[2026-05-24 20:14:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality8975216806731526169.gal : 0 ms
[2026-05-24 20:14:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality3362855758468236456.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/CTLCardinality8975216806731526169.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3362855758468236456.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,3,0.004842,3744,2,10,5,30,6,0,20,16,0


Converting to forward existential form...Done !
original formula: AF(AG(((p253==0)&&(p536==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((p253==0)&&(p536==1)))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.007547,4036,1,0,7,55,19,1,99,39,11
FORMULA DLCshifumi-PT-3a-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 461/461 transitions.
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 246 transition count 461
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 58 place count 225 transition count 419
Iterating global reduction 1 with 21 rules applied. Total rules applied 79 place count 225 transition count 419
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 88 place count 225 transition count 410
Applied a total of 88 rules in 4 ms. Remains 225 /283 variables (removed 58) and now considering 410/461 (removed 51) transitions.
[2026-05-24 20:14:24] [INFO ] Flow matrix only has 318 transitions (discarded 92 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13843376361907449779.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4892904440298677939.kers'
[2026-05-24 20:14:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13843376361907449779.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4892904440298677939.kers]
Normalized transition count is 317 out of 318 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 317 rows 221 cols 675 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-05-24 20:14:24] [INFO ] Computed 46 invariants in 1 ms
Computed 46 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4892904440298677939.kers
Total runtime 1 ms.
[2026-05-24 20:14:24] [INFO ] Implicit Places using invariants in 48 ms returned [222, 223]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 49 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 223/283 places, 410/461 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 223 transition count 408
Applied a total of 2 rules in 4 ms. Remains 223 /223 variables (removed 0) and now considering 408/410 (removed 2) transitions.
[2026-05-24 20:14:24] [INFO ] Flow matrix only has 318 transitions (discarded 90 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16467504119169879279.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1332563702002746902.kers'
[2026-05-24 20:14:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16467504119169879279.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1332563702002746902.kers]
Normalized transition count is 317 out of 318 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 317 rows 221 cols 675 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-05-24 20:14:24] [INFO ] Computed 44 invariants in 0 ms
Computed 44 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1332563702002746902.kers
Total runtime 1 ms.
[2026-05-24 20:14:24] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-24 20:14:24] [INFO ] Flow matrix only has 318 transitions (discarded 90 similar events)
[2026-05-24 20:14:24] [INFO ] Invariant cache hit.
[2026-05-24 20:14:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 20:14:24] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 223/283 places, 408/461 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 212 ms. Remains : 223/283 places, 408/461 transitions.
[2026-05-24 20:14:24] [INFO ] Flatten gal took : 6 ms
[2026-05-24 20:14:24] [INFO ] Flatten gal took : 6 ms
[2026-05-24 20:14:24] [INFO ] Input system was already deterministic with 408 transitions.
[2026-05-24 20:14:24] [INFO ] Flatten gal took : 5 ms
[2026-05-24 20:14:24] [INFO ] Flatten gal took : 6 ms
[2026-05-24 20:14:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality4366819991305061575.gal : 2 ms
[2026-05-24 20:14:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality7580129729447873779.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/CTLCardinality4366819991305061575.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7580129729447873779.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.11759e+30,0.069411,5784,2,624,5,2379,6,0,1205,1625,0


Converting to forward existential form...Done !
original formula: !(E(EF((!(((p137==0)||(p251==1))) + EX((p514==1)))) U (p363==1)))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U (!(((p137==0)||(p251==1))) + EX((p514==1))))) * (p363==1))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.292726,13984,1,0,7,49981,18,2,5446,4217,10
FORMULA DLCshifumi-PT-3a-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-24 20:14:25] [INFO ] Flatten gal took : 10 ms
[2026-05-24 20:14:25] [INFO ] Flatten gal took : 7 ms
Total runtime 69187 ms.

BK_STOP 1779653665346

--------------------
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="DLCshifumi-PT-3a"
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 DLCshifumi-PT-3a, 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 r098-tall-177955695700697"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCshifumi-PT-3a.tgz
mv DLCshifumi-PT-3a 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 ;