Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r338-smll-178021499300459.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is FileSystem-PT-N05I10B10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499300459
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 7.8K May 27 10:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 27 10:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 27 10:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 27 10:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Jun 16 12:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Jun 16 12:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 16 12:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Jun 16 12:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 13K May 27 10:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K May 27 10:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 27 10:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K May 27 10:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Jun 16 12:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 16 12:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 10 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 236K Jun 10 11:57 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1781616166234

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FileSystem-PT-N05I10B10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-06-16 13:22:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-16 13:22:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-16 13:22:48] [INFO ] Load time of PNML (sax parser for PT used): 208 ms
[2026-06-16 13:22:48] [INFO ] Transformed 561 places.
[2026-06-16 13:22:48] [INFO ] Transformed 520 transitions.
[2026-06-16 13:22:48] [INFO ] Parsed PT model containing 561 places and 520 transitions and 1850 arcs in 413 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 10 places and 0 transitions.
FORMULA FileSystem-PT-N05I10B10-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B10-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B10-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B10-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 520/520 transitions.
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 466 transition count 520
Discarding 72 places :
Symmetric choice reduction at 1 with 72 rule applications. Total rules 157 place count 394 transition count 448
Iterating global reduction 1 with 72 rules applied. Total rules applied 229 place count 394 transition count 448
Applied a total of 229 rules in 102 ms. Remains 394 /551 variables (removed 157) and now considering 448/520 (removed 72) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11188361052689908175.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-955452019883570343.kers'
[2026-06-16 13:22:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11188361052689908175.kers, --Pflows, --basisKERS=/tmp/petrispot-output-955452019883570343.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 1 ms.
// Phase 1: matrix 448 rows 384 cols 1249 entries
Finished phase 1 with 372 SingleSign rule and 0 generalized
[2026-06-16 13:22:49] [INFO ] Computed 22 invariants in 8 ms
Computed 22 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-955452019883570343.kers
Total runtime 12 ms.
[2026-06-16 13:22:50] [INFO ] Implicit Places using invariants in 997 ms returned []
[2026-06-16 13:22:50] [INFO ] Invariant cache hit.
[2026-06-16 13:22:51] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-16 13:22:53] [INFO ] Implicit Places using invariants and state equation in 3405 ms returned []
Implicit Place search using SMT with State Equation took 4454 ms to find 0 implicit places.
Running 438 sub problems to find dead transitions.
[2026-06-16 13:22:53] [INFO ] Invariant cache hit.
[2026-06-16 13:22:53] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/368 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/368 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (OVERLAPS) 11/379 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 438 unsolved
SMT process timed out in 30378ms, After SMT, problems are : Problem set: 0 solved, 438 unsolved
Search for dead transitions found 0 dead transitions in 30407ms
Starting structural reductions in LTL mode, iteration 1 : 394/551 places, 448/520 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35028 ms. Remains : 394/551 places, 448/520 transitions.
Starting structural reductions in LTL mode, iteration 0 : 394/394 places, 448/448 transitions.
Applied a total of 0 rules in 14 ms. Remains 394 /394 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2026-06-16 13:23:24] [INFO ] Invariant cache hit.
[2026-06-16 13:23:24] [INFO ] Implicit Places using invariants in 312 ms returned []
[2026-06-16 13:23:24] [INFO ] Invariant cache hit.
[2026-06-16 13:23:24] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-16 13:23:26] [INFO ] Implicit Places using invariants and state equation in 2365 ms returned []
Implicit Place search using SMT with State Equation took 2688 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2704 ms. Remains : 394/394 places, 448/448 transitions.
Support contains 46 out of 394 places after structural reductions.
[2026-06-16 13:23:27] [INFO ] Flatten gal took : 104 ms
[2026-06-16 13:23:27] [INFO ] Flatten gal took : 53 ms
[2026-06-16 13:23:27] [INFO ] Input system was already deterministic with 448 transitions.
RANDOM walk for 40000 steps (604 resets) in 2147 ms. (18 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
Interrupted probabilistic random walk after 341309 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 28
Probabilistic random walk after 341309 steps, saw 63157 distinct states, run finished after 3008 ms. (steps per millisecond=113 ) properties seen :0
[2026-06-16 13:23:31] [INFO ] Invariant cache hit.
[2026-06-16 13:23:31] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 1 (OVERLAPS) 338/382 variables, 11/11 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 0/11 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 11/393 variables, 11/22 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/22 constraints. Problems are: Problem set: 4 solved, 24 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 5 (OVERLAPS) 448/841 variables, 393/415 constraints. Problems are: Problem set: 13 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/841 variables, 100/515 constraints. Problems are: Problem set: 13 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/841 variables, 0/515 constraints. Problems are: Problem set: 13 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 1/842 variables, 1/516 constraints. Problems are: Problem set: 13 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/842 variables, 0/516 constraints. Problems are: Problem set: 13 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/842 variables, 0/516 constraints. Problems are: Problem set: 13 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 842/842 variables, and 516 constraints, problems are : Problem set: 13 solved, 15 unsolved in 2281 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 394/394 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 13 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 13 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 345/377 variables, 10/10 constraints. Problems are: Problem set: 13 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 13/23 constraints. Problems are: Problem set: 13 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/377 variables, 0/23 constraints. Problems are: Problem set: 13 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 12/389 variables, 12/35 constraints. Problems are: Problem set: 13 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 1/36 constraints. Problems are: Problem set: 13 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/36 constraints. Problems are: Problem set: 13 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 448/837 variables, 389/425 constraints. Problems are: Problem set: 13 solved, 15 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/837 variables, 100/525 constraints. Problems are: Problem set: 20 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/837 variables, 8/533 constraints. Problems are: Problem set: 20 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 837/842 variables, and 533 constraints, problems are : Problem set: 20 solved, 8 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 389/394 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 8/28 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7312ms problems are : Problem set: 20 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 448/448 transitions.
Graph (complete) has 939 edges and 394 vertex of which 388 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 388 transition count 438
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 378 transition count 438
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 27 place count 372 transition count 432
Iterating global reduction 2 with 6 rules applied. Total rules applied 33 place count 372 transition count 432
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 0 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 2 with 210 rules applied. Total rules applied 243 place count 267 transition count 327
Free-agglomeration rule (complex) applied 96 times.
Iterating global reduction 2 with 96 rules applied. Total rules applied 339 place count 267 transition count 231
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 2 with 98 rules applied. Total rules applied 437 place count 169 transition count 231
Applied a total of 437 rules in 124 ms. Remains 169 /394 variables (removed 225) and now considering 231/448 (removed 217) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 169/394 places, 231/448 transitions.
RANDOM walk for 40000 steps (1508 resets) in 586 ms. (68 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (228 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (233 resets) in 125 ms. (317 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (228 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (227 resets) in 142 ms. (279 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (228 resets) in 151 ms. (263 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (228 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (228 resets) in 132 ms. (300 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (228 resets) in 112 ms. (354 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 576353 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :0 out of 8
Probabilistic random walk after 576353 steps, saw 88775 distinct states, run finished after 3001 ms. (steps per millisecond=192 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14268262972230759959.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4436152860457881732.kers'
[2026-06-16 13:23:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14268262972230759959.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4436152860457881732.kers]
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 231 rows 158 cols 624 entries
Finished phase 1 with 148 SingleSign rule and 1 generalized
[2026-06-16 13:23:42] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4436152860457881732.kers
Total runtime 2 ms.
[2026-06-16 13:23:42] [INFO ] State equation strengthened by 100 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, 8 unsolved
At refinement iteration 1 (OVERLAPS) 10/28 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 127/155 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 14/169 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 231/400 variables, 169/189 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 100/289 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/400 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 289 constraints, problems are : Problem set: 0 solved, 8 unsolved in 525 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 169/169 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 10/28 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 127/155 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 14/169 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 231/400 variables, 169/199 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 100/299 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 8/307 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/400 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 307 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2832 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 169/169 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3371ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 1620 ms.
Support contains 18 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 231/231 transitions.
Applied a total of 0 rules in 22 ms. Remains 169 /169 variables (removed 0) and now considering 231/231 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 169/169 places, 231/231 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 231/231 transitions.
Applied a total of 0 rules in 12 ms. Remains 169 /169 variables (removed 0) and now considering 231/231 (removed 0) transitions.
[2026-06-16 13:23:47] [INFO ] Invariant cache hit.
[2026-06-16 13:23:47] [INFO ] Implicit Places using invariants in 214 ms returned []
[2026-06-16 13:23:47] [INFO ] Invariant cache hit.
[2026-06-16 13:23:47] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-16 13:23:48] [INFO ] Implicit Places using invariants and state equation in 1192 ms returned []
Implicit Place search using SMT with State Equation took 1408 ms to find 0 implicit places.
[2026-06-16 13:23:48] [INFO ] Redundant transitions in 11 ms returned []
Running 221 sub problems to find dead transitions.
[2026-06-16 13:23:48] [INFO ] Invariant cache hit.
[2026-06-16 13:23:48] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 11/160 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/160 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 12 (INCLUDED_ONLY) 0/160 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 160/400 variables, and 84 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/169 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 11/160 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 58/84 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 5/90 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 231/391 variables, 160/250 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 100/350 constraints. Problems are: Problem set: 179 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 21/371 constraints. Problems are: Problem set: 179 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/371 constraints. Problems are: Problem set: 179 solved, 42 unsolved
At refinement iteration 12 (OVERLAPS) 9/400 variables, 9/380 constraints. Problems are: Problem set: 179 solved, 42 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/400 variables, 21/401 constraints. Problems are: Problem set: 179 solved, 42 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/400 variables, 0/401 constraints. Problems are: Problem set: 179 solved, 42 unsolved
At refinement iteration 15 (OVERLAPS) 0/400 variables, 0/401 constraints. Problems are: Problem set: 179 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 401 constraints, problems are : Problem set: 179 solved, 42 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 169/169 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 42/221 constraints, Known Traps: 70/70 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60083ms problems are : Problem set: 179 solved, 42 unsolved
Search for dead transitions found 179 dead transitions in 60086ms
Found 179 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 179 transitions
Dead transitions reduction (with SMT) removed 179 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 169/169 places, 52/231 transitions.
Graph (complete) has 159 edges and 169 vertex of which 81 are kept as prefixes of interest. Removing 88 places using SCC suffix rule.0 ms
Discarding 88 places :
Also discarding 0 output transitions
Reduce places removed 9 places and 11 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 72 transition count 41
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 66 transition count 41
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 61 transition count 36
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 61 transition count 36
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 30 place count 57 transition count 28
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 57 transition count 28
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 38 place count 53 transition count 24
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 53 transition count 24
Deduced a syphon composed of 17 places in 0 ms
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 48 place count 53 transition count 18
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 54 place count 47 transition count 18
Deduced a syphon composed of 17 places in 0 ms
Applied a total of 54 rules in 10 ms. Remains 47 /169 variables (removed 122) and now considering 18/52 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14872138606493804696.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-452245009587263582.kers'
[2026-06-16 13:24:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14872138606493804696.kers, --Pflows, --basisKERS=/tmp/petrispot-output-452245009587263582.kers]
Culling trivial invariants: removing 17 columns.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 23 columns in 0 ms.
// Phase 1: matrix 18 rows 24 cols 50 entries
Finished phase 1 with 13 SingleSign rule and 5 generalized
[2026-06-16 13:24:48] [INFO ] Computed 29 invariants in 0 ms
Computed 29 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-452245009587263582.kers
Total runtime 1 ms.
[2026-06-16 13:24:49] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-06-16 13:24:49] [INFO ] Invariant cache hit.
[2026-06-16 13:24:49] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-06-16 13:24:49] [INFO ] Implicit Places using invariants and state equation in 84 ms returned [10, 13, 16, 22]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 149 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 43/169 places, 18/231 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 40 transition count 15
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 40 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 39 transition count 14
Graph (complete) has 31 edges and 39 vertex of which 27 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 27 transition count 14
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 27 transition count 6
Deduced a syphon composed of 17 places in 0 ms
Applied a total of 17 rules in 4 ms. Remains 27 /43 variables (removed 16) and now considering 6/18 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8826565206141528932.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16546228922436761421.kers'
[2026-06-16 13:24:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8826565206141528932.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16546228922436761421.kers]
Culling trivial invariants: removing 17 columns.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 19 columns in 0 ms.
// Phase 1: matrix 6 rows 8 cols 18 entries
Finished phase 1 with 5 SingleSign rule and 1 generalized
[2026-06-16 13:24:49] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16546228922436761421.kers
Total runtime 0 ms.
[2026-06-16 13:24:49] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-06-16 13:24:49] [INFO ] Invariant cache hit.
[2026-06-16 13:24:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-06-16 13:24:49] [INFO ] Implicit Places using invariants and state equation in 45 ms returned [11]
Discarding 1 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 84 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 26/169 places, 5/231 transitions.
Graph (complete) has 13 edges and 26 vertex of which 22 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 22 transition count 4
Deduced a syphon composed of 17 places in 0 ms
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 22 transition count 3
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 20 transition count 1
Ensure Unique test removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 19 transition count 1
Deduced a syphon composed of 17 places in 0 ms
Applied a total of 8 rules in 7 ms. Remains 19 /26 variables (removed 7) and now considering 1/5 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16490123656914361276.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8934747875544645293.kers'
[2026-06-16 13:24:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16490123656914361276.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8934747875544645293.kers]
Culling trivial invariants: removing 17 columns.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 18 columns in 0 ms.
// Phase 1: matrix 1 rows 1 cols 1 entries
Finished phase 1 with 1 SingleSign rule and 0 generalized
[2026-06-16 13:24:49] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8934747875544645293.kers
Total runtime 0 ms.
[2026-06-16 13:24:49] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-06-16 13:24:49] [INFO ] Invariant cache hit.
[2026-06-16 13:24:49] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 19/169 places, 1/231 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 61831 ms. Remains : 19/169 places, 1/231 transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Successfully simplified 28 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA FileSystem-PT-N05I10B10-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B10-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B10-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B10-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B10-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B10-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B10-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 84 stabilizing places and 148 stable transitions
Graph (complete) has 949 edges and 394 vertex of which 379 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.6 ms
FORMULA FileSystem-PT-N05I10B10-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B10-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B10-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B10-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved by simple procedures.
Total runtime 120864 ms.

BK_STOP 1781616289381

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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