Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524100204.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 MedleyA-PT-14, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524100204
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 46K 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 MedleyA-PT-14-LTLFireability-00
FORMULA_NAME MedleyA-PT-14-LTLFireability-01
FORMULA_NAME MedleyA-PT-14-LTLFireability-02
FORMULA_NAME MedleyA-PT-14-LTLFireability-03
FORMULA_NAME MedleyA-PT-14-LTLFireability-04
FORMULA_NAME MedleyA-PT-14-LTLFireability-05
FORMULA_NAME MedleyA-PT-14-LTLFireability-06
FORMULA_NAME MedleyA-PT-14-LTLFireability-07
FORMULA_NAME MedleyA-PT-14-LTLFireability-08
FORMULA_NAME MedleyA-PT-14-LTLFireability-09
FORMULA_NAME MedleyA-PT-14-LTLFireability-10
FORMULA_NAME MedleyA-PT-14-LTLFireability-11
FORMULA_NAME MedleyA-PT-14-LTLFireability-12
FORMULA_NAME MedleyA-PT-14-LTLFireability-13
FORMULA_NAME MedleyA-PT-14-LTLFireability-14
FORMULA_NAME MedleyA-PT-14-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748867438912

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 12:30:41] [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-06-02 12:30:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 12:30:41] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2025-06-02 12:30:41] [INFO ] Transformed 184 places.
[2025-06-02 12:30:41] [INFO ] Transformed 178 transitions.
[2025-06-02 12:30:41] [INFO ] Found NUPN structural information;
[2025-06-02 12:30:41] [INFO ] Parsed PT model containing 184 places and 178 transitions and 492 arcs in 379 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA MedleyA-PT-14-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 178/178 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 155 transition count 149
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 155 transition count 149
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 152 transition count 146
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 152 transition count 146
Applied a total of 64 rules in 114 ms. Remains 152 /184 variables (removed 32) and now considering 146/178 (removed 32) transitions.
// Phase 1: matrix 146 rows 152 cols
[2025-06-02 12:30:42] [INFO ] Computed 24 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:42] [INFO ] Implicit Places using invariants in 518 ms returned [80, 119]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 593 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 150/184 places, 146/178 transitions.
Applied a total of 0 rules in 14 ms. Remains 150 /150 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 753 ms. Remains : 150/184 places, 146/178 transitions.
Support contains 36 out of 150 places after structural reductions.
[2025-06-02 12:30:43] [INFO ] Flatten gal took : 79 ms
[2025-06-02 12:30:43] [INFO ] Flatten gal took : 34 ms
[2025-06-02 12:30:43] [INFO ] Input system was already deterministic with 146 transitions.
Support contains 34 out of 150 places (down from 36) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2617 ms. (15 steps per ms) remains 2/28 properties
BEST_FIRST walk for 40002 steps (8 resets) in 509 ms. (78 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 296 ms. (134 steps per ms) remains 1/1 properties
// Phase 1: matrix 146 rows 150 cols
[2025-06-02 12:30:44] [INFO ] Computed 22 invariants in 6 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp10 is UNSAT
After SMT solving in domain Real declared 2/296 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 0/8 constraints, State Equation: 0/150 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 79ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA MedleyA-PT-14-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 22 stabilizing places and 22 stable transitions
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(p0))&&F(p1)) U p2)))'
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 146/146 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 141 transition count 137
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 141 transition count 137
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 138 transition count 134
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 138 transition count 134
Applied a total of 24 rules in 23 ms. Remains 138 /150 variables (removed 12) and now considering 134/146 (removed 12) transitions.
// Phase 1: matrix 134 rows 138 cols
[2025-06-02 12:30:45] [INFO ] Computed 22 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:45] [INFO ] Implicit Places using invariants in 233 ms returned [38]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 236 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 137/150 places, 134/146 transitions.
Applied a total of 0 rules in 8 ms. Remains 137 /137 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 267 ms. Remains : 137/150 places, 134/146 transitions.
Stuttering acceptance computed with spot in 574 ms :[(NOT p2), (NOT p2), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : MedleyA-PT-14-LTLFireability-00
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 3 ms.
FORMULA MedleyA-PT-14-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-14-LTLFireability-00 finished in 983 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(p0)&&X(p1)))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 146/146 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 140 transition count 136
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 136
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 137 transition count 133
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 137 transition count 133
Applied a total of 26 rules in 11 ms. Remains 137 /150 variables (removed 13) and now considering 133/146 (removed 13) transitions.
// Phase 1: matrix 133 rows 137 cols
[2025-06-02 12:30:46] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:46] [INFO ] Implicit Places using invariants in 154 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 156 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/150 places, 133/146 transitions.
Applied a total of 0 rules in 5 ms. Remains 136 /136 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 172 ms. Remains : 136/150 places, 133/146 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : MedleyA-PT-14-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-14-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-14-LTLFireability-01 finished in 306 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(G((p0&&(F(p0) U p1)))))'
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 146/146 transitions.
Reduce places removed 1 places and 1 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 0 with 8 rules applied. Total rules applied 8 place count 149 transition count 137
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 141 transition count 137
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 16 place count 141 transition count 120
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 50 place count 124 transition count 120
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 59 place count 115 transition count 111
Iterating global reduction 2 with 9 rules applied. Total rules applied 68 place count 115 transition count 111
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 68 place count 115 transition count 107
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 111 transition count 107
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 79 place count 108 transition count 104
Iterating global reduction 2 with 3 rules applied. Total rules applied 82 place count 108 transition count 104
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 126 place count 86 transition count 82
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 146 place count 76 transition count 99
Applied a total of 146 rules in 58 ms. Remains 76 /150 variables (removed 74) and now considering 99/146 (removed 47) transitions.
// Phase 1: matrix 99 rows 76 cols
[2025-06-02 12:30:46] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:46] [INFO ] Implicit Places using invariants in 151 ms returned [6, 10, 19, 28, 33, 48, 52]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 159 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/150 places, 99/146 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 69 transition count 95
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 65 transition count 95
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 62 transition count 92
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 20 place count 59 transition count 96
Applied a total of 20 rules in 21 ms. Remains 59 /69 variables (removed 10) and now considering 96/99 (removed 3) transitions.
// Phase 1: matrix 96 rows 59 cols
[2025-06-02 12:30:46] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:47] [INFO ] Implicit Places using invariants in 129 ms returned []
[2025-06-02 12:30:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:47] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-02 12:30:47] [INFO ] Implicit Places using invariants and state equation in 231 ms returned [12, 27, 41]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 366 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/150 places, 96/146 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 55 transition count 95
Applied a total of 2 rules in 11 ms. Remains 55 /56 variables (removed 1) and now considering 95/96 (removed 1) transitions.
// Phase 1: matrix 95 rows 55 cols
[2025-06-02 12:30:47] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:47] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-02 12:30:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:47] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-02 12:30:47] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 55/150 places, 95/146 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 905 ms. Remains : 55/150 places, 95/146 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : MedleyA-PT-14-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 620 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 1 ms.
FORMULA MedleyA-PT-14-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-14-LTLFireability-02 finished in 1703 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((F(p0)&&G(p1))))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 146/146 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 149 transition count 136
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 140 transition count 136
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 18 place count 140 transition count 119
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 52 place count 123 transition count 119
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 60 place count 115 transition count 111
Iterating global reduction 2 with 8 rules applied. Total rules applied 68 place count 115 transition count 111
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 68 place count 115 transition count 108
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 74 place count 112 transition count 108
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 110 transition count 106
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 110 transition count 106
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 122 place count 88 transition count 84
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 148 place count 75 transition count 110
Applied a total of 148 rules in 27 ms. Remains 75 /150 variables (removed 75) and now considering 110/146 (removed 36) transitions.
// Phase 1: matrix 110 rows 75 cols
[2025-06-02 12:30:48] [INFO ] Computed 22 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:48] [INFO ] Implicit Places using invariants in 97 ms returned [7, 11, 20, 30, 34, 49, 53]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 99 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/150 places, 110/146 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 68 transition count 106
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 64 transition count 106
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 61 transition count 103
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 20 place count 58 transition count 109
Applied a total of 20 rules in 10 ms. Remains 58 /68 variables (removed 10) and now considering 109/110 (removed 1) transitions.
// Phase 1: matrix 109 rows 58 cols
[2025-06-02 12:30:48] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:48] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-02 12:30:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:48] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-02 12:30:48] [INFO ] Implicit Places using invariants and state equation in 164 ms returned [13, 28, 42]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 239 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/150 places, 109/146 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 2 place count 54 transition count 108
Applied a total of 2 rules in 5 ms. Remains 54 /55 variables (removed 1) and now considering 108/109 (removed 1) transitions.
// Phase 1: matrix 108 rows 54 cols
[2025-06-02 12:30:48] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:48] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-02 12:30:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:48] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-02 12:30:49] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 54/150 places, 108/146 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 688 ms. Remains : 54/150 places, 108/146 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-14-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 275 ms.
Product exploration explored 100000 steps with 0 reset in 324 ms.
Computed a total of 3 stabilizing places and 9 stable transitions
Computed a total of 3 stabilizing places and 9 stable transitions
Detected a total of 3/54 stabilizing places and 9/108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 403 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 615 ms. (64 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 520 ms. (76 steps per ms) remains 1/1 properties
[2025-06-02 12:30:50] [INFO ] Invariant cache hit.
[2025-06-02 12:30:50] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/22 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/26 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 77/103 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 51/154 variables, 23/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 25/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/157 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/157 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/157 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/159 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/159 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/159 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/161 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/161 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/161 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/162 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/162 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/162 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 96 constraints, problems are : Problem set: 0 solved, 1 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 22/162 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 5/10 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/54 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 271ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p1) p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 453 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 108/108 transitions.
Applied a total of 0 rules in 6 ms. Remains 54 /54 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2025-06-02 12:30:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:51] [INFO ] Implicit Places using invariants in 138 ms returned []
[2025-06-02 12:30:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:51] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-02 12:30:51] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:30:51] [INFO ] Redundant transitions in 5 ms returned []
Running 107 sub problems to find dead transitions.
[2025-06-02 12:30:51] [INFO ] Invariant cache hit.
[2025-06-02 12:30:51] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 1/54 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:30:53] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 11 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:30:54] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 4 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:30:54] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:30:54] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 7 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 4/16 constraints. Problems are: Problem set: 12 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/16 constraints. Problems are: Problem set: 12 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 107/161 variables, 54/70 constraints. Problems are: Problem set: 12 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 29/99 constraints. Problems are: Problem set: 12 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/99 constraints. Problems are: Problem set: 12 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 1/162 variables, 1/100 constraints. Problems are: Problem set: 12 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/100 constraints. Problems are: Problem set: 12 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/162 variables, 0/100 constraints. Problems are: Problem set: 12 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 100 constraints, problems are : Problem set: 12 solved, 95 unsolved in 5810 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 95 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 3/3 constraints. Problems are: Problem set: 12 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 2/5 constraints. Problems are: Problem set: 12 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 1/6 constraints. Problems are: Problem set: 12 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/6 constraints. Problems are: Problem set: 12 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 4/54 variables, 7/13 constraints. Problems are: Problem set: 12 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 3/16 constraints. Problems are: Problem set: 12 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/16 constraints. Problems are: Problem set: 12 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 107/161 variables, 54/70 constraints. Problems are: Problem set: 12 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 29/99 constraints. Problems are: Problem set: 12 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 95/194 constraints. Problems are: Problem set: 12 solved, 95 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:00] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 1/195 constraints. Problems are: Problem set: 12 solved, 95 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:02] [INFO ] Deduced a trap along path composed of 5 places in 65 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:02] [INFO ] Deduced a trap along path composed of 5 places in 88 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/161 variables, 2/197 constraints. Problems are: Problem set: 12 solved, 95 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:03] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/161 variables, 1/198 constraints. Problems are: Problem set: 12 solved, 95 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/161 variables, 0/198 constraints. Problems are: Problem set: 12 solved, 95 unsolved
At refinement iteration 14 (OVERLAPS) 1/162 variables, 1/199 constraints. Problems are: Problem set: 12 solved, 95 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/162 variables, 0/199 constraints. Problems are: Problem set: 12 solved, 95 unsolved
At refinement iteration 16 (OVERLAPS) 0/162 variables, 0/199 constraints. Problems are: Problem set: 12 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 199 constraints, problems are : Problem set: 12 solved, 95 unsolved in 14255 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 95/107 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 20195ms problems are : Problem set: 12 solved, 95 unsolved
Search for dead transitions found 12 dead transitions in 20200ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 54/54 places, 96/108 transitions.
Graph (complete) has 208 edges and 54 vertex of which 51 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 51 /54 variables (removed 3) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 51 cols
[2025-06-02 12:31:12] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:31:12] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-06-02 12:31:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:31:12] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-02 12:31:12] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/54 places, 96/108 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20872 ms. Remains : 51/54 places, 96/108 transitions.
Computed a total of 3 stabilizing places and 9 stable transitions
Computed a total of 3 stabilizing places and 9 stable transitions
Knowledge obtained : [p1, (X (NOT p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 171 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
RANDOM walk for 4 steps (0 resets) in 6 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X (NOT p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 195 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 167 ms.
Product exploration explored 100000 steps with 0 reset in 476 ms.
Built C files in :
/tmp/ltsmin17167759522518121989
[2025-06-02 12:31:13] [INFO ] Computing symmetric may disable matrix : 96 transitions.
[2025-06-02 12:31:13] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 12:31:13] [INFO ] Computing symmetric may enable matrix : 96 transitions.
[2025-06-02 12:31:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 12:31:13] [INFO ] Computing Do-Not-Accords matrix : 96 transitions.
[2025-06-02 12:31:13] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 12:31:13] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17167759522518121989
Running compilation step : cd /tmp/ltsmin17167759522518121989;'/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 557 ms.
Running link step : cd /tmp/ltsmin17167759522518121989;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 80 ms.
Running LTSmin : cd /tmp/ltsmin17167759522518121989;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14406141680736749226.hoa' '--buchi-type=spotba'
LTSmin run took 208 ms.
FORMULA MedleyA-PT-14-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-14-LTLFireability-03 finished in 26337 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))))'
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 146/146 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 140 transition count 136
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 136
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 137 transition count 133
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 137 transition count 133
Applied a total of 26 rules in 8 ms. Remains 137 /150 variables (removed 13) and now considering 133/146 (removed 13) transitions.
// Phase 1: matrix 133 rows 137 cols
[2025-06-02 12:31:14] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:31:14] [INFO ] Implicit Places using invariants in 168 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 172 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/150 places, 133/146 transitions.
Applied a total of 0 rules in 2 ms. Remains 136 /136 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 182 ms. Remains : 136/150 places, 133/146 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-14-LTLFireability-04
Entered a terminal (fully accepting) state of product in 110 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-14-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-14-LTLFireability-04 finished in 374 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)))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 146/146 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 149 transition count 136
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 140 transition count 136
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 18 place count 140 transition count 119
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 52 place count 123 transition count 119
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 61 place count 114 transition count 110
Iterating global reduction 2 with 9 rules applied. Total rules applied 70 place count 114 transition count 110
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 70 place count 114 transition count 107
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 76 place count 111 transition count 107
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 79 place count 108 transition count 104
Iterating global reduction 2 with 3 rules applied. Total rules applied 82 place count 108 transition count 104
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 126 place count 86 transition count 82
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 152 place count 73 transition count 107
Applied a total of 152 rules in 36 ms. Remains 73 /150 variables (removed 77) and now considering 107/146 (removed 39) transitions.
// Phase 1: matrix 107 rows 73 cols
[2025-06-02 12:31:15] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:31:15] [INFO ] Implicit Places using invariants in 173 ms returned [6, 10, 19, 27, 31, 46, 50]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 177 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/150 places, 107/146 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 66 transition count 103
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 62 transition count 103
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 59 transition count 100
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 20 place count 56 transition count 106
Applied a total of 20 rules in 15 ms. Remains 56 /66 variables (removed 10) and now considering 106/107 (removed 1) transitions.
// Phase 1: matrix 106 rows 56 cols
[2025-06-02 12:31:15] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:31:15] [INFO ] Implicit Places using invariants in 126 ms returned []
[2025-06-02 12:31:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:31:15] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-06-02 12:31:15] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/150 places, 106/146 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 567 ms. Remains : 56/150 places, 106/146 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-14-LTLFireability-06
Stuttering criterion allowed to conclude after 373 steps with 34 reset in 2 ms.
FORMULA MedleyA-PT-14-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-14-LTLFireability-06 finished in 693 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(p0) U G(p1)) U (F(p0)&&X(!p2))))'
Support contains 8 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 146/146 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 139 transition count 135
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 139 transition count 135
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 136 transition count 132
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 136 transition count 132
Applied a total of 28 rules in 8 ms. Remains 136 /150 variables (removed 14) and now considering 132/146 (removed 14) transitions.
// Phase 1: matrix 132 rows 136 cols
[2025-06-02 12:31:15] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:31:15] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-06-02 12:31:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:31:16] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2025-06-02 12:31:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:19] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:19] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:19] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:19] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:19] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:19] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:20] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:20] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:20] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:20] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 4 ms to minimize.
Problem TDEAD101 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:20] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 5 ms to minimize.
Problem TDEAD113 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:20] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 4 ms to minimize.
Problem TDEAD125 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 12/34 constraints. Problems are: Problem set: 3 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:21] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 16 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 1/35 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/35 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 132/268 variables, 136/171 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/171 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 0/268 variables, 0/171 constraints. Problems are: Problem set: 3 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 171 constraints, problems are : Problem set: 3 solved, 128 unsolved in 13708 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 128 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 4/136 variables, 15/17 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 5/22 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 13/35 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/35 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 132/268 variables, 136/171 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 128/299 constraints. Problems are: Problem set: 3 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:34] [INFO ] Deduced a trap along path composed of 3 places in 141 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:34] [INFO ] Deduced a trap along path composed of 9 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:34] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:35] [INFO ] Deduced a trap along path composed of 9 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:36] [INFO ] Deduced a trap along path composed of 7 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 5/304 constraints. Problems are: Problem set: 3 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:43] [INFO ] Deduced a trap along path composed of 7 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:43] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 2/306 constraints. Problems are: Problem set: 3 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:47] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 1/307 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 0/307 constraints. Problems are: Problem set: 3 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:59] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 268/268 variables, and 308 constraints, problems are : Problem set: 3 solved, 128 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 128/131 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 43757ms problems are : Problem set: 3 solved, 128 unsolved
Search for dead transitions found 3 dead transitions in 43760ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 136/150 places, 129/146 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 133 transition count 129
Applied a total of 3 rules in 2 ms. Remains 133 /136 variables (removed 3) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 133 cols
[2025-06-02 12:32:00] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:32:00] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-06-02 12:32:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:32:00] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 133/150 places, 129/146 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44590 ms. Remains : 133/150 places, 129/146 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) p2), (NOT p0), p2, (NOT p1)]
Running random walk in product with property : MedleyA-PT-14-LTLFireability-07
Product exploration explored 100000 steps with 1 reset in 271 ms.
Stack based approach found an accepted trace after 272 steps with 11 reset with depth 33 and stack size 33 in 2 ms.
FORMULA MedleyA-PT-14-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-14-LTLFireability-07 finished in 45130 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(p0)&&X(G(p1))))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 146/146 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 140 transition count 136
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 136
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 137 transition count 133
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 137 transition count 133
Applied a total of 26 rules in 8 ms. Remains 137 /150 variables (removed 13) and now considering 133/146 (removed 13) transitions.
// Phase 1: matrix 133 rows 137 cols
[2025-06-02 12:32:00] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:32:01] [INFO ] Implicit Places using invariants in 194 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 196 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/150 places, 133/146 transitions.
Applied a total of 0 rules in 2 ms. Remains 136 /136 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 206 ms. Remains : 136/150 places, 133/146 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-14-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-14-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-14-LTLFireability-08 finished in 402 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(p0)&&X(F((G(p2)&&p1))))))'
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 146/146 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 140 transition count 136
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 136
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 138 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 138 transition count 134
Applied a total of 24 rules in 6 ms. Remains 138 /150 variables (removed 12) and now considering 134/146 (removed 12) transitions.
// Phase 1: matrix 134 rows 138 cols
[2025-06-02 12:32:01] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:32:01] [INFO ] Implicit Places using invariants in 168 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 169 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 137/150 places, 134/146 transitions.
Applied a total of 0 rules in 4 ms. Remains 137 /137 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 179 ms. Remains : 137/150 places, 134/146 transitions.
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : MedleyA-PT-14-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 223 ms.
Stack based approach found an accepted trace after 69 steps with 0 reset with depth 70 and stack size 70 in 0 ms.
FORMULA MedleyA-PT-14-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-14-LTLFireability-09 finished in 722 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(p0)||X(X(F(p1)))))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 146/146 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 140 transition count 136
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 136
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 137 transition count 133
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 137 transition count 133
Applied a total of 26 rules in 8 ms. Remains 137 /150 variables (removed 13) and now considering 133/146 (removed 13) transitions.
// Phase 1: matrix 133 rows 137 cols
[2025-06-02 12:32:02] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:32:02] [INFO ] Implicit Places using invariants in 165 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 174 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/150 places, 133/146 transitions.
Applied a total of 0 rules in 2 ms. Remains 136 /136 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 185 ms. Remains : 136/150 places, 133/146 transitions.
Stuttering acceptance computed with spot in 248 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-14-LTLFireability-10
Product exploration explored 100000 steps with 3535 reset in 184 ms.
Stack based approach found an accepted trace after 474 steps with 16 reset with depth 15 and stack size 15 in 2 ms.
FORMULA MedleyA-PT-14-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-14-LTLFireability-10 finished in 643 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((X(X(p0)) U (p1&&X((G(p2) U p0)))))))'
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 146/146 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 140 transition count 136
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 136
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 138 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 138 transition count 134
Applied a total of 24 rules in 7 ms. Remains 138 /150 variables (removed 12) and now considering 134/146 (removed 12) transitions.
// Phase 1: matrix 134 rows 138 cols
[2025-06-02 12:32:02] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:32:02] [INFO ] Implicit Places using invariants in 178 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 180 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 137/150 places, 134/146 transitions.
Applied a total of 0 rules in 2 ms. Remains 137 /137 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 191 ms. Remains : 137/150 places, 134/146 transitions.
Stuttering acceptance computed with spot in 476 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true, (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : MedleyA-PT-14-LTLFireability-11
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-14-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-14-LTLFireability-11 finished in 711 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||(G(p1)&&(p2||F(G(p0)))))))'
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 146/146 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 140 transition count 136
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 136
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 138 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 138 transition count 134
Applied a total of 24 rules in 5 ms. Remains 138 /150 variables (removed 12) and now considering 134/146 (removed 12) transitions.
[2025-06-02 12:32:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:32:03] [INFO ] Implicit Places using invariants in 151 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 152 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 137/150 places, 134/146 transitions.
Applied a total of 0 rules in 1 ms. Remains 137 /137 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 158 ms. Remains : 137/150 places, 134/146 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p1), (NOT p0)]
Running random walk in product with property : MedleyA-PT-14-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 103 ms.
Product exploration explored 100000 steps with 50000 reset in 159 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Computed a total of 19 stabilizing places and 19 stable transitions
Detected a total of 19/137 stabilizing places and 19/134 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X p1), (X (X p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 23 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-14-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-14-LTLFireability-15 finished in 694 ms.
All properties solved by simple procedures.
Total runtime 82642 ms.

BK_STOP 1748867524181

--------------------
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="MedleyA-PT-14"
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 MedleyA-PT-14, 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 r128-smll-174876524100204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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