Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r072-tall-174860067500460.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is DoubleExponent-PT-001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860067500460
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 17K May 29 14:32 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 DoubleExponent-PT-001-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748727305813

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-31 21: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]
[2025-05-31 21:35:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 21:35:07] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2025-05-31 21:35:07] [INFO ] Transformed 57 places.
[2025-05-31 21:35:07] [INFO ] Transformed 48 transitions.
[2025-05-31 21:35:07] [INFO ] Parsed PT model containing 57 places and 48 transitions and 135 arcs in 120 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA DoubleExponent-PT-001-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 48/48 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 53 transition count 48
Applied a total of 4 rules in 17 ms. Remains 53 /57 variables (removed 4) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 53 cols
[2025-05-31 21:35:07] [INFO ] Computed 6 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:35:07] [INFO ] Implicit Places using invariants in 161 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 192 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/57 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 223 ms. Remains : 52/57 places, 48/48 transitions.
Support contains 27 out of 52 places after structural reductions.
[2025-05-31 21:35:07] [INFO ] Flatten gal took : 17 ms
[2025-05-31 21:35:07] [INFO ] Flatten gal took : 17 ms
[2025-05-31 21:35:07] [INFO ] Input system was already deterministic with 48 transitions.
RANDOM walk for 40000 steps (1302 resets) in 733 ms. (54 steps per ms) remains 1/22 properties
BEST_FIRST walk for 40000 steps (1212 resets) in 292 ms. (136 steps per ms) remains 1/1 properties
// Phase 1: matrix 48 rows 52 cols
[2025-05-31 21:35:07] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/17 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/37 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/38 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 39/77 variables, 38/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/93 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/93 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/97 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/97 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp10 is UNSAT
After SMT solving in domain Real declared 100/100 variables, and 57 constraints, problems are : Problem set: 1 solved, 0 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 167ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA DoubleExponent-PT-001-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 79 edges and 52 vertex of which 50 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||(p0&&F(G(p1)))))))'
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 52 /52 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2025-05-31 21:35:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:35:08] [INFO ] Implicit Places using invariants in 39 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/52 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 47
Applied a total of 2 rules in 4 ms. Remains 50 /51 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 50 cols
[2025-05-31 21:35:08] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:35:08] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-05-31 21:35:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:35:08] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/52 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 146 ms. Remains : 50/52 places, 47/48 transitions.
Stuttering acceptance computed with spot in 289 ms :[(NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA DoubleExponent-PT-001-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLFireability-00 finished in 504 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(p1))||X(G(p2)))))'
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 48/48 transitions.
Applied a total of 0 rules in 5 ms. Remains 52 /52 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 52 cols
[2025-05-31 21:35:08] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:35:09] [INFO ] Implicit Places using invariants in 49 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/52 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 47
Applied a total of 2 rules in 5 ms. Remains 50 /51 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 50 cols
[2025-05-31 21:35:09] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:35:09] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-05-31 21:35:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:35:09] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/52 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 149 ms. Remains : 50/52 places, 47/48 transitions.
Stuttering acceptance computed with spot in 271 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-001-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLFireability-01 finished in 437 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(X(p0)))) U ((X(X(X(X(p0))))&&G(p1))||X(X(X(X(G(p0))))))))'
Support contains 5 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 48/48 transitions.
Applied a total of 0 rules in 4 ms. Remains 52 /52 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 52 cols
[2025-05-31 21:35:09] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:35:09] [INFO ] Implicit Places using invariants in 42 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/52 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 47
Applied a total of 2 rules in 7 ms. Remains 50 /51 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 50 cols
[2025-05-31 21:35:09] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:35:09] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-05-31 21:35:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:35:09] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/52 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 145 ms. Remains : 50/52 places, 47/48 transitions.
Stuttering acceptance computed with spot in 427 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-02
Entered a terminal (fully accepting) state of product in 19 steps with 2 reset in 1 ms.
FORMULA DoubleExponent-PT-001-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLFireability-02 finished in 597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(!p0) U ((p1&&X(!p0))||X(G(!p0)))) U G((G((p2 U p3)) U X(X(p3))))))'
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 52 /52 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 52 cols
[2025-05-31 21:35:10] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:35:10] [INFO ] Implicit Places using invariants in 33 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/52 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 47
Applied a total of 2 rules in 3 ms. Remains 50 /51 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 50 cols
[2025-05-31 21:35:10] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:35:10] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-05-31 21:35:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:35:10] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/52 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 50/52 places, 47/48 transitions.
Stuttering acceptance computed with spot in 2112 ms :[(NOT p3), (AND p0 (NOT p3)), (NOT p3), false, (AND p0 (NOT p3)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (NOT p3), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (NOT p3), (NOT p3), (NOT p3), true, (AND (NOT p3) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (NOT p3), (NOT p3), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2) p0), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p3) (NOT p2) p0), (AND p0 (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p3)), p0, p0, (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), false, false, (AND (NOT p0) (NOT p3)), false]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-05
Entered a terminal (fully accepting) state of product in 59 steps with 7 reset in 4 ms.
FORMULA DoubleExponent-PT-001-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLFireability-05 finished in 2347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(X((!p0 U (G(!p0)||p1))))) U (G(X(X(X((!p0 U (p1||G(!p0)))))))||(F(!p2)&&X(X(X((!p0 U (p1||G(!p0)))))))))))'
Support contains 5 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 52 cols
[2025-05-31 21:35:12] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:35:12] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-05-31 21:35:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:35:12] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 47 sub problems to find dead transitions.
[2025-05-31 21:35:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:35:12] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:35:12] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 48/100 variables, 52/59 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:35:13] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:35:13] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/100 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 61 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1543 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 48/100 variables, 52/61 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 47/108 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:35:14] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:35:14] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:35:15] [INFO ] Deduced a trap along path composed of 13 places in 39 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/100 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (OVERLAPS) 0/100 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 111 constraints, problems are : Problem set: 0 solved, 47 unsolved in 4486 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 6039ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 6040ms
Finished structural reductions in LTL mode , in 1 iterations and 6126 ms. Remains : 52/52 places, 48/48 transitions.
Stuttering acceptance computed with spot in 312 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p2 p0 (NOT p1)), (AND p0 (NOT p1)), (AND p2 p0 (NOT p1)), (AND p0 (NOT p1)), (AND p2 p0 (NOT p1)), (AND p2 p0 (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-07
Product exploration explored 100000 steps with 25000 reset in 245 ms.
Product exploration explored 100000 steps with 25000 reset in 107 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 79 edges and 52 vertex of which 50 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 132 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p2 p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p2 p0 (NOT p1)), (AND p2 p0 (NOT p1))]
RANDOM walk for 40000 steps (1348 resets) in 180 ms. (220 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40001 steps (1143 resets) in 254 ms. (156 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (1142 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
[2025-05-31 21:35:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/35 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/36 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 37/73 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 18/91 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/95 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/95 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/99 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/99 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
Problem apf2 is UNSAT
After SMT solving in domain Real declared 100/100 variables, and 57 constraints, problems are : Problem set: 2 solved, 0 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 105ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p2) p1)), (G (OR (NOT p2) (NOT p0) p1))]
False Knowledge obtained : [(F (NOT (AND (OR (NOT p2) p0) (OR (NOT p2) (NOT p1))))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p0), (F p2), (F (NOT p1))]
Knowledge based reduction with 13 factoid took 354 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 174 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 52 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 48/48 transitions.
Applied a total of 0 rules in 4 ms. Remains 52 /52 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2025-05-31 21:35:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:35:20] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-05-31 21:35:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:35:20] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Running 47 sub problems to find dead transitions.
[2025-05-31 21:35:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:35:20] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:35:21] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 48/100 variables, 52/59 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:35:21] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:35:21] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/100 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 61 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1355 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 48/100 variables, 52/61 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 47/108 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:35:22] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:35:22] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:35:23] [INFO ] Deduced a trap along path composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/100 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (OVERLAPS) 0/100 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 111 constraints, problems are : Problem set: 0 solved, 47 unsolved in 4364 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 5726ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 5726ms
Finished structural reductions in LTL mode , in 1 iterations and 5801 ms. Remains : 52/52 places, 48/48 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 79 edges and 52 vertex of which 50 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 73 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 2927 steps (93 resets) in 19 ms. (146 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 136 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 160 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 150 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 57 ms.
Product exploration explored 100000 steps with 25000 reset in 56 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 154 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 48/48 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 52 transition count 48
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 10 place count 52 transition count 49
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 52 transition count 49
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 49 transition count 46
Deduced a syphon composed of 10 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 49 transition count 46
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 31 place count 49 transition count 48
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 47 transition count 45
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 47 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 47 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 46 transition count 46
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 46 transition count 46
Deduced a syphon composed of 20 places in 0 ms
Applied a total of 38 rules in 24 ms. Remains 46 /52 variables (removed 6) and now considering 46/48 (removed 2) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 21:35:27] [INFO ] Redundant transitions in 1 ms returned []
Running 45 sub problems to find dead transitions.
// Phase 1: matrix 46 rows 46 cols
[2025-05-31 21:35:27] [INFO ] Computed 5 invariants in 0 ms
[2025-05-31 21:35:27] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 1/46 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:35:27] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:35:28] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 44 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
At refinement iteration 6 (OVERLAPS) 46/92 variables, 46/53 constraints. Problems are: Problem set: 24 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 1/54 constraints. Problems are: Problem set: 24 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 0/54 constraints. Problems are: Problem set: 24 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 0/92 variables, 0/54 constraints. Problems are: Problem set: 24 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 54 constraints, problems are : Problem set: 24 solved, 21 unsolved in 732 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 21 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 10/35 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 2/4 constraints. Problems are: Problem set: 24 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 24 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 5/40 variables, 3/7 constraints. Problems are: Problem set: 24 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/7 constraints. Problems are: Problem set: 24 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 46/86 variables, 40/47 constraints. Problems are: Problem set: 24 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 1/48 constraints. Problems are: Problem set: 24 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 21/69 constraints. Problems are: Problem set: 24 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 0/69 constraints. Problems are: Problem set: 24 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 6/92 variables, 6/75 constraints. Problems are: Problem set: 24 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 0/75 constraints. Problems are: Problem set: 24 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 0/92 variables, 0/75 constraints. Problems are: Problem set: 24 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 75 constraints, problems are : Problem set: 24 solved, 21 unsolved in 867 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 21/45 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1609ms problems are : Problem set: 24 solved, 21 unsolved
Search for dead transitions found 24 dead transitions in 1610ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 46/52 places, 22/48 transitions.
Graph (complete) has 61 edges and 46 vertex of which 26 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 26 /46 variables (removed 20) and now considering 22/22 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/52 places, 22/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1647 ms. Remains : 26/52 places, 22/48 transitions.
Built C files in :
/tmp/ltsmin11714008102600773207
[2025-05-31 21:35:29] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11714008102600773207
Running compilation step : cd /tmp/ltsmin11714008102600773207;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 205 ms.
Running link step : cd /tmp/ltsmin11714008102600773207;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin11714008102600773207;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12166846390257170013.hoa' '--buchi-type=spotba'
LTSmin run took 65 ms.
FORMULA DoubleExponent-PT-001-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-001-LTLFireability-07 finished in 17349 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p0 U X(p1))&&F(p2)&&(p1||F(p3))) U p0)))'
Support contains 5 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 52 cols
[2025-05-31 21:35:29] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:35:29] [INFO ] Implicit Places using invariants in 36 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/52 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 47
Applied a total of 2 rules in 2 ms. Remains 50 /51 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 50 cols
[2025-05-31 21:35:29] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:35:29] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-05-31 21:35:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:35:29] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/52 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 109 ms. Remains : 50/52 places, 47/48 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p2), (NOT p3), true]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-001-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLFireability-08 finished in 354 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||X(p1)))))'
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 52 /52 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 52 cols
[2025-05-31 21:35:30] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:35:30] [INFO ] Implicit Places using invariants in 34 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/52 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 47
Applied a total of 2 rules in 2 ms. Remains 50 /51 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 50 cols
[2025-05-31 21:35:30] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:35:30] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-05-31 21:35:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:35:30] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/52 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 109 ms. Remains : 50/52 places, 47/48 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-09
Entered a terminal (fully accepting) state of product in 353 steps with 11 reset in 2 ms.
FORMULA DoubleExponent-PT-001-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLFireability-09 finished in 316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 48/48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 51 transition count 38
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 42 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 41 transition count 37
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 20 place count 41 transition count 36
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 40 transition count 36
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 44 place count 29 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 28 transition count 24
Applied a total of 45 rules in 10 ms. Remains 28 /52 variables (removed 24) and now considering 24/48 (removed 24) transitions.
// Phase 1: matrix 24 rows 28 cols
[2025-05-31 21:35:30] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:35:30] [INFO ] Implicit Places using invariants in 27 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/52 places, 24/48 transitions.
Graph (complete) has 59 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 25 transition count 22
Applied a total of 3 rules in 2 ms. Remains 25 /27 variables (removed 2) and now considering 22/24 (removed 2) transitions.
// Phase 1: matrix 22 rows 25 cols
[2025-05-31 21:35:30] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:35:30] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-05-31 21:35:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:35:30] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/52 places, 22/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 98 ms. Remains : 25/52 places, 22/48 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-10
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-001-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLFireability-10 finished in 220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&(F(p0) U p1)&&X(G(p2))))))'
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 52 /52 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 52 cols
[2025-05-31 21:35:30] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:35:30] [INFO ] Implicit Places using invariants in 33 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/52 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 47
Applied a total of 2 rules in 1 ms. Remains 50 /51 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 50 cols
[2025-05-31 21:35:30] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:35:30] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-05-31 21:35:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:35:30] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/52 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 111 ms. Remains : 50/52 places, 47/48 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-15
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-001-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLFireability-15 finished in 348 ms.
All properties solved by simple procedures.
Total runtime 23980 ms.

BK_STOP 1748727330992

--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="DoubleExponent-PT-001"
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-5832"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-001, 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 r072-tall-174860067500460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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