Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969020100340.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 MedleyB-PT-B08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020100340
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 9.0K Mar 7 18:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Mar 7 18:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 7 18:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 7 18:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 11:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 11:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Mar 7 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Mar 7 18:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 12M 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 MedleyB-PT-B08-LTLFireability-00
FORMULA_NAME MedleyB-PT-B08-LTLFireability-01
FORMULA_NAME MedleyB-PT-B08-LTLFireability-02
FORMULA_NAME MedleyB-PT-B08-LTLFireability-03
FORMULA_NAME MedleyB-PT-B08-LTLFireability-04
FORMULA_NAME MedleyB-PT-B08-LTLFireability-05
FORMULA_NAME MedleyB-PT-B08-LTLFireability-06
FORMULA_NAME MedleyB-PT-B08-LTLFireability-07
FORMULA_NAME MedleyB-PT-B08-LTLFireability-08
FORMULA_NAME MedleyB-PT-B08-LTLFireability-09
FORMULA_NAME MedleyB-PT-B08-LTLFireability-10
FORMULA_NAME MedleyB-PT-B08-LTLFireability-11
FORMULA_NAME MedleyB-PT-B08-LTLFireability-12
FORMULA_NAME MedleyB-PT-B08-LTLFireability-13
FORMULA_NAME MedleyB-PT-B08-LTLFireability-14
FORMULA_NAME MedleyB-PT-B08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779708905082

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 11:35:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 11:35:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 11:35:07] [INFO ] Load time of PNML (sax parser for PT used): 717 ms
[2026-05-25 11:35:07] [INFO ] Transformed 1099 places.
[2026-05-25 11:35:07] [INFO ] Transformed 14556 transitions.
[2026-05-25 11:35:07] [INFO ] Found NUPN structural information;
[2026-05-25 11:35:07] [INFO ] Parsed PT model containing 1099 places and 14556 transitions and 216508 arcs in 965 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA MedleyB-PT-B08-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B08-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B08-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 1099 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1099/1099 places, 14556/14556 transitions.
Discarding 139 places :
Symmetric choice reduction at 0 with 139 rule applications. Total rules 139 place count 960 transition count 14417
Iterating global reduction 0 with 139 rules applied. Total rules applied 278 place count 960 transition count 14417
Discarding 74 places :
Symmetric choice reduction at 0 with 74 rule applications. Total rules 352 place count 886 transition count 14343
Iterating global reduction 0 with 74 rules applied. Total rules applied 426 place count 886 transition count 14343
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 442 place count 870 transition count 14327
Iterating global reduction 0 with 16 rules applied. Total rules applied 458 place count 870 transition count 14327
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 466 place count 862 transition count 14319
Iterating global reduction 0 with 8 rules applied. Total rules applied 474 place count 862 transition count 14319
Applied a total of 474 rules in 669 ms. Remains 862 /1099 variables (removed 237) and now considering 14319/14556 (removed 237) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5987488849496170828.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5269368398524549375.kers'
[2026-05-25 11:35:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5987488849496170828.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5269368398524549375.kers]
Culled 0 columns in 22 ms.
// Phase 1: matrix 14319 rows 862 cols 216034 entries
Finished phase 1 with 853 SingleSign rule and 0 generalized
[2026-05-25 11:35:08] [INFO ] Computed 9 invariants in 128 ms
Computed 9 P flows in 129 ms.
Exported basis to /tmp/petrispot-output-5269368398524549375.kers
Total runtime 155 ms.
[2026-05-25 11:35:09] [INFO ] Implicit Places using invariants in 994 ms returned []
Implicit Place search using SMT only with invariants took 1037 ms to find 0 implicit places.
Running 14318 sub problems to find dead transitions.
[2026-05-25 11:35:09] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 861/15181 variables, and 0 constraints, problems are : Problem set: 0 solved, 14318 unsolved in 30321 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/862 constraints, PredecessorRefiner: 14318/892 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14318 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 861/15181 variables, and 0 constraints, problems are : Problem set: 0 solved, 14318 unsolved in 30267 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/862 constraints, PredecessorRefiner: 13426/892 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 103564ms problems are : Problem set: 0 solved, 14318 unsolved
Search for dead transitions found 0 dead transitions in 103697ms
Starting structural reductions in LTL mode, iteration 1 : 862/1099 places, 14319/14556 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105561 ms. Remains : 862/1099 places, 14319/14556 transitions.
Starting structural reductions in LTL mode, iteration 0 : 862/862 places, 14319/14319 transitions.
Applied a total of 0 rules in 71 ms. Remains 862 /862 variables (removed 0) and now considering 14319/14319 (removed 0) transitions.
[2026-05-25 11:36:53] [INFO ] Invariant cache hit.
[2026-05-25 11:36:54] [INFO ] Implicit Places using invariants in 466 ms returned []
Implicit Place search using SMT only with invariants took 468 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 544 ms. Remains : 862/862 places, 14319/14319 transitions.
Support contains 53 out of 862 places after structural reductions.
[2026-05-25 11:36:55] [INFO ] Flatten gal took : 1449 ms
[2026-05-25 11:36:56] [INFO ] Flatten gal took : 988 ms
[2026-05-25 11:36:59] [INFO ] Input system was already deterministic with 14319 transitions.
Reduction of identical properties reduced properties to check from 34 to 33
RANDOM walk for 40000 steps (291 resets) in 2020 ms. (19 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 307 ms. (12 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
Interrupted probabilistic random walk after 49950 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :1 out of 32
Probabilistic random walk after 49950 steps, saw 13015 distinct states, run finished after 3010 ms. (steps per millisecond=16 ) properties seen :1
[2026-05-25 11:37:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp31 is UNSAT
At refinement iteration 1 (OVERLAPS) 811/862 variables, 9/9 constraints. Problems are: Problem set: 3 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/862 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 28 unsolved
SMT process timed out in 5243ms, After SMT, problems are : Problem set: 3 solved, 28 unsolved
Fused 28 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 48 out of 862 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 862/862 places, 14319/14319 transitions.
Graph (trivial) has 837 edges and 862 vertex of which 128 / 862 are part of one of the 24 SCC in 16 ms
Free SCC test removed 104 places
Drop transitions (Empty/Sink Transition effects.) removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Graph (complete) has 2184 edges and 758 vertex of which 750 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.68 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 498 rules applied. Total rules applied 500 place count 750 transition count 13677
Reduce places removed 490 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 506 rules applied. Total rules applied 1006 place count 260 transition count 13661
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1014 place count 252 transition count 13661
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 1014 place count 252 transition count 13621
Deduced a syphon composed of 40 places in 7 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 1094 place count 212 transition count 13621
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1095 place count 212 transition count 13620
Performed 42 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 42 places in 3 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 1179 place count 170 transition count 13577
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 1194 place count 170 transition count 13562
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 1210 place count 154 transition count 13531
Iterating global reduction 5 with 16 rules applied. Total rules applied 1226 place count 154 transition count 13531
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1227 place count 154 transition count 13530
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1234 place count 147 transition count 13523
Iterating global reduction 6 with 7 rules applied. Total rules applied 1241 place count 147 transition count 13523
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1257 place count 139 transition count 13515
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1263 place count 136 transition count 13523
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1271 place count 136 transition count 13515
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1273 place count 135 transition count 13521
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1281 place count 135 transition count 13513
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1283 place count 134 transition count 13519
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1291 place count 134 transition count 13511
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1293 place count 133 transition count 13517
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1301 place count 133 transition count 13509
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1303 place count 132 transition count 13515
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1311 place count 132 transition count 13507
Free-agglomeration rule applied 57 times.
Iterating global reduction 6 with 57 rules applied. Total rules applied 1368 place count 132 transition count 13450
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 6 with 57 rules applied. Total rules applied 1425 place count 75 transition count 13450
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1433 place count 67 transition count 13442
Iterating global reduction 7 with 8 rules applied. Total rules applied 1441 place count 67 transition count 13442
Applied a total of 1441 rules in 11498 ms. Remains 67 /862 variables (removed 795) and now considering 13442/14319 (removed 877) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11498 ms. Remains : 67/862 places, 13442/14319 transitions.
RANDOM walk for 40000 steps (2484 resets) in 3046 ms. (13 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 24/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 18/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 10/11 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 9/10 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 8/9 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 7/8 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 6/7 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 5/6 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 4/5 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 3/4 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 2/3 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 1/2 properties
BEST_FIRST walk for 503 steps (0 resets) in 9 ms. (50 steps per ms) remains 0/1 properties
FORMULA MedleyB-PT-B08-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA MedleyB-PT-B08-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA MedleyB-PT-B08-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B08-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 120 stabilizing places and 128 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||X((G(!p2) U (!p3&&G(!p2))))||p0)))'
Support contains 12 out of 862 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 862/862 places, 14319/14319 transitions.
Applied a total of 0 rules in 109 ms. Remains 862 /862 variables (removed 0) and now considering 14319/14319 (removed 0) transitions.
[2026-05-25 11:37:22] [INFO ] Invariant cache hit.
[2026-05-25 11:37:25] [INFO ] Implicit Places using invariants in 3603 ms returned []
Implicit Place search using SMT only with invariants took 3612 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3724 ms. Remains : 862/862 places, 14319/14319 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||X((G(!p2) U (!p3&&G(!p2))))||p0)))'
Stuttering acceptance computed with spot in 542 ms :[true, (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) (NOT p1) p3)), (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) (NOT p1) p3)), p2, (AND p2 (NOT p1)), (NOT p1), (OR p3 p2), (OR (AND (NOT p1) p3) (AND (NOT p1) p2))]
Running random walk in product with property : MedleyB-PT-B08-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 1790 ms.
Product exploration explored 100000 steps with 50000 reset in 1601 ms.
Computed a total of 120 stabilizing places and 128 stable transitions
Computed a total of 120 stabilizing places and 128 stable transitions
Knowledge based reduction with 16 factoid took 62 ms. Proved property starting from automaton with 8 states, 21 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 293 ms.
FORMULA MedleyB-PT-B08-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyB-PT-B08-LTLFireability-00 finished in 8171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0&&X(!p1))))'
Support contains 16 out of 862 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 862/862 places, 14319/14319 transitions.
Applied a total of 0 rules in 104 ms. Remains 862 /862 variables (removed 0) and now considering 14319/14319 (removed 0) transitions.
[2026-05-25 11:37:30] [INFO ] Invariant cache hit.
[2026-05-25 11:37:33] [INFO ] Implicit Places using invariants in 3195 ms returned []
Implicit Place search using SMT only with invariants took 3211 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3318 ms. Remains : 862/862 places, 14319/14319 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&p1)))'
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : MedleyB-PT-B08-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 1014 ms.
Product exploration explored 100000 steps with 50000 reset in 1151 ms.
Computed a total of 120 stabilizing places and 128 stable transitions
Computed a total of 120 stabilizing places and 128 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 9 factoid took 23 ms. Proved property starting from automaton with 2 states, 4 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 233 ms.
FORMULA MedleyB-PT-B08-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyB-PT-B08-LTLFireability-01 finished in 5990 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((F(p0) U G(p1)) U p2)&&X(X(F(p3)))))'
Support contains 17 out of 862 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 862/862 places, 14319/14319 transitions.
Applied a total of 0 rules in 126 ms. Remains 862 /862 variables (removed 0) and now considering 14319/14319 (removed 0) transitions.
[2026-05-25 11:37:36] [INFO ] Invariant cache hit.
[2026-05-25 11:37:39] [INFO ] Implicit Places using invariants in 3412 ms returned []
Implicit Place search using SMT only with invariants took 3414 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3542 ms. Remains : 862/862 places, 14319/14319 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((F(p0) U G(p1)) U p2)&&X(X(F(p3)))))'
Stuttering acceptance computed with spot in 441 ms :[(OR (NOT p2) (NOT p3)), (NOT p0), (NOT p1), (NOT p2), (NOT p3), (NOT p3)]
Running random walk in product with property : MedleyB-PT-B08-LTLFireability-03
Stuttering criterion allowed to conclude after 138 steps with 0 reset in 3 ms.
FORMULA MedleyB-PT-B08-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B08-LTLFireability-03 finished in 4181 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 16 out of 862 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 862/862 places, 14319/14319 transitions.
Graph (trivial) has 869 edges and 862 vertex of which 128 / 862 are part of one of the 24 SCC in 3 ms
Free SCC test removed 104 places
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 505 transitions
Trivial Post-agglo rules discarded 505 transitions
Performed 505 trivial Post agglomeration. Transition count delta: 505
Iterating post reduction 0 with 505 rules applied. Total rules applied 506 place count 757 transition count 13693
Reduce places removed 505 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 521 rules applied. Total rules applied 1027 place count 252 transition count 13677
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1035 place count 244 transition count 13677
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 1035 place count 244 transition count 13644
Deduced a syphon composed of 33 places in 6 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 1101 place count 211 transition count 13644
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1108 place count 204 transition count 13637
Iterating global reduction 3 with 7 rules applied. Total rules applied 1115 place count 204 transition count 13637
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 6 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 1193 place count 165 transition count 13598
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1214 place count 144 transition count 5312
Iterating global reduction 3 with 21 rules applied. Total rules applied 1235 place count 144 transition count 5312
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 1240 place count 144 transition count 5307
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1248 place count 136 transition count 5291
Iterating global reduction 4 with 8 rules applied. Total rules applied 1256 place count 136 transition count 5291
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1264 place count 128 transition count 5275
Iterating global reduction 4 with 8 rules applied. Total rules applied 1272 place count 128 transition count 5275
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 1296 place count 116 transition count 5282
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1297 place count 115 transition count 5266
Iterating global reduction 4 with 1 rules applied. Total rules applied 1298 place count 115 transition count 5266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1299 place count 115 transition count 5265
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 1307 place count 115 transition count 5257
Applied a total of 1307 rules in 2972 ms. Remains 115 /862 variables (removed 747) and now considering 5257/14319 (removed 9062) transitions.
[2026-05-25 11:37:43] [INFO ] Flow matrix only has 5248 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8009901096840271890.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11175048133188266302.kers'
[2026-05-25 11:37:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8009901096840271890.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11175048133188266302.kers]
Normalized transition count is 5247 out of 5248 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 20 ms.
// Phase 1: matrix 5247 rows 114 cols 80191 entries
Finished phase 1 with 113 SingleSign rule and 0 generalized
[2026-05-25 11:37:43] [INFO ] Computed 2 invariants in 68 ms
Computed 2 P flows in 81 ms.
Exported basis to /tmp/petrispot-output-11175048133188266302.kers
Total runtime 90 ms.
[2026-05-25 11:37:44] [INFO ] Implicit Places using invariants in 1429 ms returned []
[2026-05-25 11:37:44] [INFO ] Flow matrix only has 5248 transitions (discarded 9 similar events)
[2026-05-25 11:37:44] [INFO ] Invariant cache hit.
[2026-05-25 11:37:46] [INFO ] State equation strengthened by 255 read => feed constraints.
[2026-05-25 11:37:51] [INFO ] Implicit Places using invariants and state equation in 6509 ms returned []
Implicit Place search using SMT with State Equation took 7958 ms to find 0 implicit places.
[2026-05-25 11:37:51] [INFO ] Redundant transitions in 587 ms returned []
Running 5240 sub problems to find dead transitions.
[2026-05-25 11:37:51] [INFO ] Flow matrix only has 5248 transitions (discarded 9 similar events)
[2026-05-25 11:37:51] [INFO ] Invariant cache hit.
[2026-05-25 11:37:52] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5240 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 114/5363 variables, and 1 constraints, problems are : Problem set: 0 solved, 5240 unsolved in 30106 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 0/115 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 5240/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5240 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 114/5363 variables, and 1 constraints, problems are : Problem set: 0 solved, 5240 unsolved in 30104 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 0/115 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 5175/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 71288ms problems are : Problem set: 0 solved, 5240 unsolved
Search for dead transitions found 0 dead transitions in 71319ms
Starting structural reductions in SI_LTL mode, iteration 1 : 115/862 places, 5257/14319 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82874 ms. Remains : 115/862 places, 5257/14319 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyB-PT-B08-LTLFireability-04
Product exploration explored 100000 steps with 6330 reset in 1151 ms.
Product exploration explored 100000 steps with 6259 reset in 1142 ms.
Computed a total of 5 stabilizing places and 24 stable transitions
Computed a total of 5 stabilizing places and 24 stable transitions
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (2506 resets) in 1816 ms. (22 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (184 resets) in 264 ms. (150 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 195558 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 1
Probabilistic random walk after 195558 steps, saw 60146 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
[2026-05-25 11:39:09] [INFO ] Flow matrix only has 5248 transitions (discarded 9 similar events)
[2026-05-25 11:39:09] [INFO ] Invariant cache hit.
[2026-05-25 11:39:10] [INFO ] State equation strengthened by 255 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 97/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5359/5363 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1646 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 113/115 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 1/0 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/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 97/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5246/5359 variables, 113/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5359/5363 variables, and 368 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 113/115 constraints, ReadFeed: 254/255 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7703ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 5257/5257 transitions.
Graph (complete) has 918 edges and 115 vertex of which 114 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.19 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 114 transition count 5239
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 32 rules applied. Total rules applied 50 place count 98 transition count 5223
Free-agglomeration rule applied 52 times.
Iterating global reduction 1 with 52 rules applied. Total rules applied 102 place count 98 transition count 5171
Reduce places removed 53 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 172 place count 45 transition count 5154
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 180 place count 37 transition count 5146
Iterating global reduction 2 with 8 rules applied. Total rules applied 188 place count 37 transition count 5146
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 2 with 79 rules applied. Total rules applied 267 place count 37 transition count 5067
Performed 8 Post agglomeration using F-continuation condition with reduction of 3931 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 283 place count 29 transition count 1128
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 589 transitions
Reduce isomorphic transitions removed 597 transitions.
Iterating post reduction 3 with 597 rules applied. Total rules applied 880 place count 29 transition count 531
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 888 place count 25 transition count 527
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 889 place count 24 transition count 526
Applied a total of 889 rules in 961 ms. Remains 24 /115 variables (removed 91) and now considering 526/5257 (removed 4731) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 962 ms. Remains : 24/115 places, 526/5257 transitions.
RANDOM walk for 15555 steps (1624 resets) in 168 ms. (92 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 12680 ms.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0)]
Support contains 16 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 5257/5257 transitions.
Applied a total of 0 rules in 501 ms. Remains 115 /115 variables (removed 0) and now considering 5257/5257 (removed 0) transitions.
[2026-05-25 11:39:18] [INFO ] Flow matrix only has 5248 transitions (discarded 9 similar events)
[2026-05-25 11:39:18] [INFO ] Invariant cache hit.
[2026-05-25 11:39:20] [INFO ] Implicit Places using invariants in 1297 ms returned []
[2026-05-25 11:39:20] [INFO ] Flow matrix only has 5248 transitions (discarded 9 similar events)
[2026-05-25 11:39:20] [INFO ] Invariant cache hit.
[2026-05-25 11:39:22] [INFO ] State equation strengthened by 255 read => feed constraints.
[2026-05-25 11:39:27] [INFO ] Implicit Places using invariants and state equation in 7531 ms returned []
Implicit Place search using SMT with State Equation took 8849 ms to find 0 implicit places.
[2026-05-25 11:39:28] [INFO ] Redundant transitions in 455 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9823 ms. Remains : 115/115 places, 5257/5257 transitions.
Computed a total of 5 stabilizing places and 24 stable transitions
Computed a total of 5 stabilizing places and 24 stable transitions
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (2517 resets) in 939 ms. (42 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (180 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 200773 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 200773 steps, saw 61097 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2026-05-25 11:39:31] [INFO ] Flow matrix only has 5248 transitions (discarded 9 similar events)
[2026-05-25 11:39:31] [INFO ] Invariant cache hit.
[2026-05-25 11:39:32] [INFO ] State equation strengthened by 255 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 97/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5246/5359 variables, 113/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 5860ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 5257/5257 transitions.
Graph (complete) has 918 edges and 115 vertex of which 114 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 114 transition count 5239
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 32 rules applied. Total rules applied 50 place count 98 transition count 5223
Free-agglomeration rule applied 52 times.
Iterating global reduction 1 with 52 rules applied. Total rules applied 102 place count 98 transition count 5171
Reduce places removed 53 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 172 place count 45 transition count 5154
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 180 place count 37 transition count 5146
Iterating global reduction 2 with 8 rules applied. Total rules applied 188 place count 37 transition count 5146
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 2 with 79 rules applied. Total rules applied 267 place count 37 transition count 5067
Performed 8 Post agglomeration using F-continuation condition with reduction of 3931 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 283 place count 29 transition count 1128
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 589 transitions
Reduce isomorphic transitions removed 597 transitions.
Iterating post reduction 3 with 597 rules applied. Total rules applied 880 place count 29 transition count 531
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 888 place count 25 transition count 527
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 889 place count 24 transition count 526
Applied a total of 889 rules in 932 ms. Remains 24 /115 variables (removed 91) and now considering 526/5257 (removed 4731) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 932 ms. Remains : 24/115 places, 526/5257 transitions.
RANDOM walk for 19605 steps (2059 resets) in 162 ms. (120 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 10558 ms.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6297 reset in 1236 ms.
Product exploration explored 100000 steps with 6271 reset in 1182 ms.
Built C files in :
/tmp/ltsmin4383742214509180191
[2026-05-25 11:39:41] [INFO ] Too many transitions (5257) to apply POR reductions. Disabling POR matrices.
[2026-05-25 11:39:41] [INFO ] Built C files in 148ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4383742214509180191
Running compilation step : cd /tmp/ltsmin4383742214509180191;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4383742214509180191;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4383742214509180191;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 16 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 5257/5257 transitions.
Applied a total of 0 rules in 466 ms. Remains 115 /115 variables (removed 0) and now considering 5257/5257 (removed 0) transitions.
[2026-05-25 11:39:45] [INFO ] Flow matrix only has 5248 transitions (discarded 9 similar events)
[2026-05-25 11:39:45] [INFO ] Invariant cache hit.
[2026-05-25 11:39:46] [INFO ] Implicit Places using invariants in 1342 ms returned []
[2026-05-25 11:39:46] [INFO ] Flow matrix only has 5248 transitions (discarded 9 similar events)
[2026-05-25 11:39:46] [INFO ] Invariant cache hit.
[2026-05-25 11:39:48] [INFO ] State equation strengthened by 255 read => feed constraints.
[2026-05-25 11:39:53] [INFO ] Implicit Places using invariants and state equation in 6761 ms returned []
Implicit Place search using SMT with State Equation took 8106 ms to find 0 implicit places.
[2026-05-25 11:39:53] [INFO ] Redundant transitions in 580 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9172 ms. Remains : 115/115 places, 5257/5257 transitions.
Built C files in :
/tmp/ltsmin3616162522347715525
[2026-05-25 11:39:53] [INFO ] Too many transitions (5257) to apply POR reductions. Disabling POR matrices.
[2026-05-25 11:39:54] [INFO ] Built C files in 112ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3616162522347715525
Running compilation step : cd /tmp/ltsmin3616162522347715525;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3616162522347715525;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3616162522347715525;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-25 11:39:58] [INFO ] Flatten gal took : 599 ms
[2026-05-25 11:39:59] [INFO ] Flatten gal took : 481 ms
[2026-05-25 11:39:59] [INFO ] Time to serialize gal into /tmp/LTL3128645822649883503.gal : 135 ms
[2026-05-25 11:39:59] [INFO ] Time to serialize properties into /tmp/LTL948361962664364385.prop : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3128645822649883503.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4093389403210334065.hoa' '-atoms' '/tmp/LTL948361962664364385.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL948361962664364385.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4093389403210334065.hoa
Detected timeout of ITS tools.
[2026-05-25 11:40:15] [INFO ] Flatten gal took : 707 ms
[2026-05-25 11:40:16] [INFO ] Flatten gal took : 420 ms
[2026-05-25 11:40:16] [INFO ] Time to serialize gal into /tmp/LTL5140150494788085588.gal : 85 ms
[2026-05-25 11:40:16] [INFO ] Time to serialize properties into /tmp/LTL13439409802118057178.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5140150494788085588.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13439409802118057178.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((p90==0)||(p224==0))||((p371==0)||(p480==0)))||(((p626==0)||(p773==0))||((p907==0)||(p1016==0))))&&((((p43==0)||(p190==0))...237
Formula 0 simplified : FG!"(((((p90==0)||(p224==0))||((p371==0)||(p480==0)))||(((p626==0)||(p773==0))||((p907==0)||(p1016==0))))&&((((p43==0)||(p190==0))||...231
Detected timeout of ITS tools.
[2026-05-25 11:40:32] [INFO ] Flatten gal took : 456 ms
[2026-05-25 11:40:32] [INFO ] Applying decomposition
[2026-05-25 11:40:32] [INFO ] Flatten gal took : 458 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14244688743897257609.txt' '-o' '/tmp/graph14244688743897257609.bin' '-w' '/tmp/graph14244688743897257609.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14244688743897257609.bin' '-l' '-1' '-v' '-w' '/tmp/graph14244688743897257609.weights' '-q' '0' '-e' '0.001'
[2026-05-25 11:40:34] [INFO ] Decomposing Gal with order
[2026-05-25 11:40:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 11:40:35] [INFO ] Removed a total of 40948 redundant transitions.
[2026-05-25 11:40:35] [INFO ] Flatten gal took : 1116 ms
[2026-05-25 11:40:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 262 ms.
[2026-05-25 11:40:36] [INFO ] Time to serialize gal into /tmp/LTL9137322328166176614.gal : 14 ms
[2026-05-25 11:40:36] [INFO ] Time to serialize properties into /tmp/LTL16626662916299589132.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9137322328166176614.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16626662916299589132.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((i1.u2.p90==0)||(i2.u4.p224==0))||((i2.u8.p371==0)||(i1.u10.p480==0)))||(((i1.u14.p626==0)||(i1.u17.p773==0))||((i1.u19.p9...343
Formula 0 simplified : FG!"(((((i1.u2.p90==0)||(i2.u4.p224==0))||((i2.u8.p371==0)||(i1.u10.p480==0)))||(((i1.u14.p626==0)||(i1.u17.p773==0))||((i1.u19.p907...337
Detected timeout of ITS tools.
Treatment of property MedleyB-PT-B08-LTLFireability-04 finished in 190785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((F(p1)&&X(X(F(p2))))))))'
Support contains 17 out of 862 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 862/862 places, 14319/14319 transitions.
Applied a total of 0 rules in 90 ms. Remains 862 /862 variables (removed 0) and now considering 14319/14319 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14221992134553646747.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11226304570801301276.kers'
[2026-05-25 11:40:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14221992134553646747.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11226304570801301276.kers]
Culled 0 columns in 22 ms.
// Phase 1: matrix 14319 rows 862 cols 216034 entries
Finished phase 1 with 853 SingleSign rule and 0 generalized
[2026-05-25 11:40:51] [INFO ] Computed 9 invariants in 122 ms
Computed 9 P flows in 123 ms.
Exported basis to /tmp/petrispot-output-11226304570801301276.kers
Total runtime 143 ms.
[2026-05-25 11:40:54] [INFO ] Implicit Places using invariants in 3243 ms returned []
Implicit Place search using SMT only with invariants took 3260 ms to find 0 implicit places.
Running 14318 sub problems to find dead transitions.
[2026-05-25 11:40:54] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 861/15181 variables, and 0 constraints, problems are : Problem set: 0 solved, 14318 unsolved in 30207 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/862 constraints, PredecessorRefiner: 14318/892 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14318 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 861/15181 variables, and 0 constraints, problems are : Problem set: 0 solved, 14318 unsolved in 30204 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/862 constraints, PredecessorRefiner: 13426/892 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 104681ms problems are : Problem set: 0 solved, 14318 unsolved
Search for dead transitions found 0 dead transitions in 104741ms
Finished structural reductions in LTL mode , in 1 iterations and 108145 ms. Remains : 862/862 places, 14319/14319 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((F(p0)&&X(X(F(p1)))))||p2)))'
Stuttering acceptance computed with spot in 259 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyB-PT-B08-LTLFireability-05
Stuttering criterion allowed to conclude after 117 steps with 0 reset in 2 ms.
FORMULA MedleyB-PT-B08-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B08-LTLFireability-05 finished in 108522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(G(p0))) U (X(p1)&&F(!p2))))'
Support contains 21 out of 862 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 862/862 places, 14319/14319 transitions.
Applied a total of 0 rules in 122 ms. Remains 862 /862 variables (removed 0) and now considering 14319/14319 (removed 0) transitions.
[2026-05-25 11:42:39] [INFO ] Invariant cache hit.
[2026-05-25 11:42:42] [INFO ] Implicit Places using invariants in 2916 ms returned []
Implicit Place search using SMT only with invariants took 2919 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3042 ms. Remains : 862/862 places, 14319/14319 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(G(p0))) U (X(p1)&&F(!p2))))'
Stuttering acceptance computed with spot in 347 ms :[(OR (NOT p1) p2), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), p2, true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyB-PT-B08-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B08-LTLFireability-07 finished in 3468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&((X(X(F(!p0)))&&F((!p1 U (G(!p1)||(!p1&&G(!p2))))))||G(F(!p0)))))'
Support contains 19 out of 862 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 862/862 places, 14319/14319 transitions.
Applied a total of 0 rules in 85 ms. Remains 862 /862 variables (removed 0) and now considering 14319/14319 (removed 0) transitions.
[2026-05-25 11:42:43] [INFO ] Invariant cache hit.
[2026-05-25 11:42:46] [INFO ] Implicit Places using invariants in 2833 ms returned []
Implicit Place search using SMT only with invariants took 2834 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2920 ms. Remains : 862/862 places, 14319/14319 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(G(F(!p0))||(X(X(F(!p0)))&&F((!p1 U (G(!p1)||(!p1&&G(!p2)))))))))'
Stuttering acceptance computed with spot in 329 ms :[true, (NOT p0), p0, (AND p2 p1 p0), (AND p0 p1), p0, (AND p2 p1 p0), (AND p0 p1)]
Running random walk in product with property : MedleyB-PT-B08-LTLFireability-08
Stuttering criterion allowed to conclude after 132 steps with 0 reset in 2 ms.
FORMULA MedleyB-PT-B08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B08-LTLFireability-08 finished in 3348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(X(p0))))&&(p1 U G((p2||G(p1)))))))'
Support contains 17 out of 862 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 862/862 places, 14319/14319 transitions.
Applied a total of 0 rules in 87 ms. Remains 862 /862 variables (removed 0) and now considering 14319/14319 (removed 0) transitions.
[2026-05-25 11:42:46] [INFO ] Invariant cache hit.
[2026-05-25 11:42:49] [INFO ] Implicit Places using invariants in 3394 ms returned []
Implicit Place search using SMT only with invariants took 3410 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3498 ms. Remains : 862/862 places, 14319/14319 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(X(p0))))&&(p1 U G((p2||G(p1)))))))'
Stuttering acceptance computed with spot in 653 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyB-PT-B08-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B08-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B08-LTLFireability-09 finished in 4268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 8 out of 862 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 862/862 places, 14319/14319 transitions.
Graph (trivial) has 877 edges and 862 vertex of which 128 / 862 are part of one of the 24 SCC in 1 ms
Free SCC test removed 104 places
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 513 transitions
Trivial Post-agglo rules discarded 513 transitions
Performed 513 trivial Post agglomeration. Transition count delta: 513
Iterating post reduction 0 with 513 rules applied. Total rules applied 514 place count 757 transition count 13685
Reduce places removed 513 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 529 rules applied. Total rules applied 1043 place count 244 transition count 13669
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1051 place count 236 transition count 13669
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 1051 place count 236 transition count 13636
Deduced a syphon composed of 33 places in 7 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 1117 place count 203 transition count 13636
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1124 place count 196 transition count 13629
Iterating global reduction 3 with 7 rules applied. Total rules applied 1131 place count 196 transition count 13629
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 5 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 1209 place count 157 transition count 13590
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 1236 place count 130 transition count 2644
Iterating global reduction 3 with 27 rules applied. Total rules applied 1263 place count 130 transition count 2644
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 1274 place count 130 transition count 2633
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1282 place count 122 transition count 2617
Iterating global reduction 4 with 8 rules applied. Total rules applied 1290 place count 122 transition count 2617
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1298 place count 114 transition count 2601
Iterating global reduction 4 with 8 rules applied. Total rules applied 1306 place count 114 transition count 2601
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 1330 place count 102 transition count 2608
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1331 place count 101 transition count 2592
Iterating global reduction 4 with 1 rules applied. Total rules applied 1332 place count 101 transition count 2592
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1333 place count 101 transition count 2591
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 1341 place count 101 transition count 2583
Applied a total of 1341 rules in 1852 ms. Remains 101 /862 variables (removed 761) and now considering 2583/14319 (removed 11736) transitions.
[2026-05-25 11:42:52] [INFO ] Flow matrix only has 2574 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9033911563312543401.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6857722214803440698.kers'
[2026-05-25 11:42:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9033911563312543401.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6857722214803440698.kers]
Normalized transition count is 2573 out of 2574 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 18 ms.
// Phase 1: matrix 2573 rows 100 cols 37603 entries
Finished phase 1 with 99 SingleSign rule and 0 generalized
[2026-05-25 11:42:52] [INFO ] Computed 2 invariants in 34 ms
Computed 2 P flows in 41 ms.
Exported basis to /tmp/petrispot-output-6857722214803440698.kers
Total runtime 53 ms.
[2026-05-25 11:42:53] [INFO ] Implicit Places using invariants in 762 ms returned []
[2026-05-25 11:42:53] [INFO ] Flow matrix only has 2574 transitions (discarded 9 similar events)
[2026-05-25 11:42:53] [INFO ] Invariant cache hit.
[2026-05-25 11:42:54] [INFO ] State equation strengthened by 255 read => feed constraints.
[2026-05-25 11:42:56] [INFO ] Implicit Places using invariants and state equation in 2969 ms returned []
Implicit Place search using SMT with State Equation took 3738 ms to find 0 implicit places.
[2026-05-25 11:42:56] [INFO ] Redundant transitions in 107 ms returned []
Running 2566 sub problems to find dead transitions.
[2026-05-25 11:42:56] [INFO ] Flow matrix only has 2574 transitions (discarded 9 similar events)
[2026-05-25 11:42:56] [INFO ] Invariant cache hit.
[2026-05-25 11:42:56] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2566 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2566 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 101/2675 variables, and 2 constraints, problems are : Problem set: 0 solved, 2566 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/101 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 2566/57 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2566 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2566 unsolved
SMT process timed out in 65881ms, After SMT, problems are : Problem set: 0 solved, 2566 unsolved
Search for dead transitions found 0 dead transitions in 65891ms
Starting structural reductions in SI_LTL mode, iteration 1 : 101/862 places, 2583/14319 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71607 ms. Remains : 101/862 places, 2583/14319 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : MedleyB-PT-B08-LTLFireability-11
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B08-LTLFireability-11 finished in 71702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Spot run failed in 93 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-25 11:44:03] [INFO ] Flatten gal took : 782 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1800798227587917942
[2026-05-25 11:44:04] [INFO ] Too many transitions (14319) to apply POR reductions. Disabling POR matrices.
[2026-05-25 11:44:04] [INFO ] Built C files in 280ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1800798227587917942
Running compilation step : cd /tmp/ltsmin1800798227587917942;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-25 11:44:04] [INFO ] Applying decomposition
[2026-05-25 11:44:05] [INFO ] Flatten gal took : 765 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8320505755555013261.txt' '-o' '/tmp/graph8320505755555013261.bin' '-w' '/tmp/graph8320505755555013261.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8320505755555013261.bin' '-l' '-1' '-v' '-w' '/tmp/graph8320505755555013261.weights' '-q' '0' '-e' '0.001'
[2026-05-25 11:44:09] [INFO ] Decomposing Gal with order
[2026-05-25 11:44:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 11:44:11] [INFO ] Removed a total of 107150 redundant transitions.
[2026-05-25 11:44:12] [INFO ] Flatten gal took : 1864 ms
[2026-05-25 11:44:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 908 ms.
[2026-05-25 11:44:13] [INFO ] Time to serialize gal into /tmp/LTLFireability7788854137761227490.gal : 76 ms
[2026-05-25 11:44:13] [INFO ] Time to serialize properties into /tmp/LTLFireability17164656577884822462.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7788854137761227490.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17164656577884822462.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((i0.u4.p90==0)||(i0.u51.p224==0))||((i11.u96.p371==0)||(i4.u160.p480==0)))||(((i0.u196.p626==0)||(i11.u229.p773==0))||((i1...362
Formula 0 simplified : FG!"(((((i0.u4.p90==0)||(i0.u51.p224==0))||((i11.u96.p371==0)||(i4.u160.p480==0)))||(((i0.u196.p626==0)||(i11.u229.p773==0))||((i11....356
Compilation finished in 173588 ms.
Running link step : cd /tmp/ltsmin1800798227587917942;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 166 ms.
Running LTSmin : cd /tmp/ltsmin1800798227587917942;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2026-05-25 12:04:22] [INFO ] Applying decomposition
[2026-05-25 12:04:26] [INFO ] Flatten gal took : 3268 ms
[2026-05-25 12:04:29] [INFO ] Decomposing Gal with order
[2026-05-25 12:04:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 12:04:37] [INFO ] Removed a total of 107021 redundant transitions.
[2026-05-25 12:04:38] [INFO ] Flatten gal took : 4915 ms
[2026-05-25 12:04:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 454 labels/synchronizations in 498 ms.
[2026-05-25 12:04:38] [INFO ] Time to serialize gal into /tmp/LTLFireability8553017637628058497.gal : 28 ms
[2026-05-25 12:04:38] [INFO ] Time to serialize properties into /tmp/LTLFireability320969277766369908.ltl : 4 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8553017637628058497.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability320969277766369908.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((i0.i0.i0.i0.i0.i0.i0.u8.p90==0)||(i0.i0.i0.i0.i0.i0.i0.u9.p224==0))||((i0.i0.i0.i0.i0.i0.u10.p371==0)||(i0.i0.i0.i0.i0.u1...507
Formula 0 simplified : FG!"(((((i0.i0.i0.i0.i0.i0.i0.u8.p90==0)||(i0.i0.i0.i0.i0.i0.i0.u9.p224==0))||((i0.i0.i0.i0.i0.i0.u10.p371==0)||(i0.i0.i0.i0.i0.u11....501
Reverse transition relation is NOT exact ! Due to transitions t892, i0.u15.t91, i0.u15.t100, i0.u15.t133, i0.u15.t134, i0.u15.t135, i0.u15.t168, i0.u15.t16...1631
Computing Next relation with stutter on 5.5553e+07 deadlock states
234 unique states visited
0 strongly connected components in search stack
466 transitions explored
234 items max in DFS search stack
7468 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,74.759,938588,1,0,595039,1.81886e+06,12634,1.74563e+06,4003,8.54192e+06,299901
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA MedleyB-PT-B08-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1860860 ms.

BK_STOP 1779710768506

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="MedleyB-PT-B08"
export BK_EXAMINATION="LTLFireability"
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 MedleyB-PT-B08, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-oct2-177969020100340"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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