Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812400364.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 ParamProductionCell-PT-1, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812400364
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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 4.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 174K 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 ParamProductionCell-PT-1-LTLFireability-00
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-01
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-02
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-03
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-04
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-05
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-06
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-07
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-08
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-09
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-10
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-11
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-12
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-13
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-14
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748879684655

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-1
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 15:54:45] [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 15:54:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 15:54:46] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2025-06-02 15:54:46] [INFO ] Transformed 231 places.
[2025-06-02 15:54:46] [INFO ] Transformed 202 transitions.
[2025-06-02 15:54:46] [INFO ] Found NUPN structural information;
[2025-06-02 15:54:46] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ParamProductionCell-PT-1-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 225 transition count 196
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 225 transition count 196
Applied a total of 12 rules in 58 ms. Remains 225 /231 variables (removed 6) and now considering 196/202 (removed 6) transitions.
// Phase 1: matrix 196 rows 225 cols
[2025-06-02 15:54:46] [INFO ] Computed 59 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:54:46] [INFO ] Implicit Places using invariants in 371 ms returned [1, 15, 16, 18, 19, 24, 35, 36, 42, 46, 47, 59, 65, 73, 78, 79, 98, 114, 118, 119, 162, 164, 165, 188, 190, 191, 195, 200, 201, 205]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 402 ms to find 30 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 195/231 places, 196/202 transitions.
Applied a total of 0 rules in 7 ms. Remains 195 /195 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 481 ms. Remains : 195/231 places, 196/202 transitions.
Support contains 57 out of 195 places after structural reductions.
[2025-06-02 15:54:46] [INFO ] Flatten gal took : 36 ms
[2025-06-02 15:54:46] [INFO ] Flatten gal took : 15 ms
[2025-06-02 15:54:46] [INFO ] Input system was already deterministic with 196 transitions.
Support contains 56 out of 195 places (down from 57) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1592 ms. (25 steps per ms) remains 7/31 properties
BEST_FIRST walk for 40002 steps (8 resets) in 362 ms. (110 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 201 ms. (198 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 205 ms. (194 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 215 ms. (185 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 177 ms. (224 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 144 ms. (275 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 170 ms. (233 steps per ms) remains 7/7 properties
// Phase 1: matrix 196 rows 195 cols
[2025-06-02 15:54:47] [INFO ] Computed 29 invariants in 3 ms
[2025-06-02 15:54:47] [INFO ] State equation strengthened by 68 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 124/135 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:48] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:48] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 16/151 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 21/172 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:48] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 8 ms to minimize.
Problem AtomicPropp1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:48] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 10 ms to minimize.
Problem AtomicPropp2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:48] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:48] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:48] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 10 ms to minimize.
Problem AtomicPropp11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:48] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:49] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 10 ms to minimize.
Problem AtomicPropp13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:49] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 3 ms to minimize.
Problem AtomicPropp18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:49] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 7 ms to minimize.
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp22 is UNSAT
After SMT solving in domain Real declared 172/391 variables, and 30 constraints, problems are : Problem set: 7 solved, 0 unsolved in 1207 ms.
Refiners :[Positive P Invariants (semi-flows): 10/19 constraints, Generalized P Invariants (flows): 9/10 constraints, State Equation: 0/195 constraints, ReadFeed: 0/68 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1237ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA ParamProductionCell-PT-1-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 7 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ParamProductionCell-PT-1-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA ParamProductionCell-PT-1-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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))) U p1))'
Support contains 4 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 196/196 transitions.
Applied a total of 0 rules in 4 ms. Remains 195 /195 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2025-06-02 15:54:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:54:49] [INFO ] Implicit Places using invariants in 182 ms returned [25, 33, 52, 82, 84, 96, 139, 140, 168, 186]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 183 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/195 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 183 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 183 transition count 194
Applied a total of 4 rules in 11 ms. Remains 183 /185 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 183 cols
[2025-06-02 15:54:49] [INFO ] Computed 19 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:54:50] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-06-02 15:54:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:54:50] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 15:54:50] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 183/195 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 689 ms. Remains : 183/195 places, 194/196 transitions.
Stuttering acceptance computed with spot in 303 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-01
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-1-LTLFireability-01 finished in 1140 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 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 196/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 195 transition count 161
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 160 transition count 161
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 70 place count 160 transition count 152
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 88 place count 151 transition count 152
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 134 place count 128 transition count 129
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 2 with 2 rules applied. Total rules applied 136 place count 127 transition count 128
Applied a total of 136 rules in 35 ms. Remains 127 /195 variables (removed 68) and now considering 128/196 (removed 68) transitions.
// Phase 1: matrix 128 rows 127 cols
[2025-06-02 15:54:50] [INFO ] Computed 29 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:54:50] [INFO ] Implicit Places using invariants in 103 ms returned [0, 2, 4, 11, 16, 28, 37, 44, 56, 57, 75, 88, 89, 112, 121]
[2025-06-02 15:54:50] [INFO ] Actually due to overlaps returned [44, 4, 16, 28, 56, 57, 88, 89, 112, 11, 121, 0]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 104 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/195 places, 128/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 115 transition count 125
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 112 transition count 125
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 112 transition count 121
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 108 transition count 121
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 106 transition count 119
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 106 transition count 119
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 50 place count 90 transition count 103
Applied a total of 50 rules in 16 ms. Remains 90 /115 variables (removed 25) and now considering 103/128 (removed 25) transitions.
// Phase 1: matrix 103 rows 90 cols
[2025-06-02 15:54:50] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:54:50] [INFO ] Implicit Places using invariants in 68 ms returned [1, 27, 55]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 69 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/195 places, 103/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 87 /87 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 229 ms. Remains : 87/195 places, 103/196 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-02
Product exploration explored 100000 steps with 1701 reset in 244 ms.
Product exploration explored 100000 steps with 1702 reset in 133 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 231 steps (0 resets) in 8 ms. (25 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 103 rows 87 cols
[2025-06-02 15:54:51] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 15:54:51] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2025-06-02 15:54:51] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2025-06-02 15:54:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 15:54:52] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-06-02 15:54:52] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2025-06-02 15:54:52] [INFO ] State equation strengthened by 67 read => feed constraints.
[2025-06-02 15:54:52] [INFO ] [Nat]Added 67 Read/Feed constraints in 12 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:52] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:52] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:52] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:52] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:52] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:52] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:52] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:52] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 6 ms to minimize.
[2025-06-02 15:54:52] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 440 ms
[2025-06-02 15:54:52] [INFO ] Computed and/alt/rep : 102/216/102 causal constraints (skipped 0 transitions) in 5 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:52] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:52] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 4 ms to minimize.
[2025-06-02 15:54:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2025-06-02 15:54:52] [INFO ] Added : 93 causal constraints over 20 iterations in 329 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 103/103 transitions.
Applied a total of 0 rules in 3 ms. Remains 87 /87 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2025-06-02 15:54:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:54:52] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-02 15:54:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:54:53] [INFO ] State equation strengthened by 67 read => feed constraints.
[2025-06-02 15:54:53] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 15:54:53] [INFO ] Redundant transitions in 3 ms returned []
Running 102 sub problems to find dead transitions.
[2025-06-02 15:54:53] [INFO ] Invariant cache hit.
[2025-06-02 15:54:53] [INFO ] State equation strengthened by 67 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:53] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:53] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:53] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:53] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:53] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:53] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:53] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:53] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:53] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:53] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:54] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 4 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:54] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 6 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:54] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:54] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:54] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 4 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:54] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:54] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:54] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:54] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 5 ms to minimize.
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 15:54:54] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 3 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 20/34 constraints. Problems are: Problem set: 28 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:54] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:54] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 5 ms to minimize.
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:54] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:54] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:54] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 5 ms to minimize.
Problem TDEAD35 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:54] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 2 ms to minimize.
Problem TDEAD38 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:54] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:54] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:54] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 5 ms to minimize.
Problem TDEAD49 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:55] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:55] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:55] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 12/46 constraints. Problems are: Problem set: 32 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/46 constraints. Problems are: Problem set: 32 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 103/190 variables, 87/133 constraints. Problems are: Problem set: 32 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 67/200 constraints. Problems are: Problem set: 32 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/200 constraints. Problems are: Problem set: 32 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/190 variables, 0/200 constraints. Problems are: Problem set: 32 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 200 constraints, problems are : Problem set: 32 solved, 70 unsolved in 4378 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 87/87 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 32 solved, 70 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 10/10 constraints. Problems are: Problem set: 32 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 12/22 constraints. Problems are: Problem set: 32 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/22 constraints. Problems are: Problem set: 32 solved, 70 unsolved
At refinement iteration 3 (OVERLAPS) 16/87 variables, 4/26 constraints. Problems are: Problem set: 32 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 20/46 constraints. Problems are: Problem set: 32 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/46 constraints. Problems are: Problem set: 32 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 103/190 variables, 87/133 constraints. Problems are: Problem set: 32 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 67/200 constraints. Problems are: Problem set: 32 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 70/270 constraints. Problems are: Problem set: 32 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/270 constraints. Problems are: Problem set: 32 solved, 70 unsolved
At refinement iteration 10 (OVERLAPS) 0/190 variables, 0/270 constraints. Problems are: Problem set: 32 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 270 constraints, problems are : Problem set: 32 solved, 70 unsolved in 3710 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 87/87 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 70/102 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8113ms problems are : Problem set: 32 solved, 70 unsolved
Search for dead transitions found 32 dead transitions in 8116ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 87/87 places, 71/103 transitions.
Graph (complete) has 227 edges and 87 vertex of which 71 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 71 /87 variables (removed 16) and now considering 71/71 (removed 0) transitions.
// Phase 1: matrix 71 rows 71 cols
[2025-06-02 15:55:01] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:01] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-02 15:55:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:01] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-02 15:55:01] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/87 places, 71/103 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8551 ms. Remains : 71/87 places, 71/103 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 232 steps (0 resets) in 7 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
[2025-06-02 15:55:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 15:55:01] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2025-06-02 15:55:01] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2025-06-02 15:55:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 15:55:02] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 15:55:02] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-02 15:55:02] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-02 15:55:02] [INFO ] [Nat]Added 47 Read/Feed constraints in 5 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:02] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:02] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:02] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:02] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:02] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:02] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:02] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:02] [INFO ] Deduced a trap composed of 10 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 15:55:02] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:02] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 4 ms to minimize.
[2025-06-02 15:55:02] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 634 ms
[2025-06-02 15:55:02] [INFO ] Computed and/alt/rep : 70/104/70 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 15:55:02] [INFO ] Added : 57 causal constraints over 12 iterations in 111 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1702 reset in 87 ms.
Product exploration explored 100000 steps with 1702 reset in 170 ms.
Built C files in :
/tmp/ltsmin9245188078993160718
[2025-06-02 15:55:03] [INFO ] Computing symmetric may disable matrix : 71 transitions.
[2025-06-02 15:55:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 15:55:03] [INFO ] Computing symmetric may enable matrix : 71 transitions.
[2025-06-02 15:55:03] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 15:55:03] [INFO ] Computing Do-Not-Accords matrix : 71 transitions.
[2025-06-02 15:55:03] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 15:55:03] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9245188078993160718
Running compilation step : cd /tmp/ltsmin9245188078993160718;'/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 308 ms.
Running link step : cd /tmp/ltsmin9245188078993160718;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin9245188078993160718;'/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/stateBased15268071158660362981.hoa' '--buchi-type=spotba'
LTSmin run took 130 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-1-LTLFireability-02 finished in 13015 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((p0||X(X(X(X(G(p1)))))))))'
Support contains 5 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 195 /195 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 195 cols
[2025-06-02 15:55:03] [INFO ] Computed 29 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:03] [INFO ] Implicit Places using invariants in 155 ms returned [25, 33, 52, 82, 84, 98, 139, 168, 186]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 156 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/195 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 184 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 184 transition count 194
Applied a total of 4 rules in 6 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 184 cols
[2025-06-02 15:55:03] [INFO ] Computed 20 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:04] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-02 15:55:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:04] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 15:55:04] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 184/195 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 702 ms. Remains : 184/195 places, 194/196 transitions.
Stuttering acceptance computed with spot in 297 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-03
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-1-LTLFireability-03 finished in 1019 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))'
Support contains 6 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 196/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 195 transition count 162
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 161 transition count 162
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 68 place count 161 transition count 153
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 86 place count 152 transition count 153
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 136 place count 127 transition count 128
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 2 with 2 rules applied. Total rules applied 138 place count 126 transition count 127
Applied a total of 138 rules in 18 ms. Remains 126 /195 variables (removed 69) and now considering 127/196 (removed 69) transitions.
// Phase 1: matrix 127 rows 126 cols
[2025-06-02 15:55:04] [INFO ] Computed 29 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:04] [INFO ] Implicit Places using invariants in 115 ms returned [0, 2, 4, 11, 16, 28, 37, 42, 44, 55, 56, 75, 88, 89, 111, 120]
[2025-06-02 15:55:04] [INFO ] Actually due to overlaps returned [42, 44, 4, 16, 28, 55, 56, 88, 89, 111, 11, 120, 0]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 116 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/195 places, 127/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 113 transition count 123
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 109 transition count 123
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 8 place count 109 transition count 120
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 14 place count 106 transition count 120
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 74 place count 76 transition count 90
Applied a total of 74 rules in 8 ms. Remains 76 /113 variables (removed 37) and now considering 90/127 (removed 37) transitions.
// Phase 1: matrix 90 rows 76 cols
[2025-06-02 15:55:04] [INFO ] Computed 16 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:04] [INFO ] Implicit Places using invariants in 54 ms returned [1, 27, 48]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 54 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 73/195 places, 90/196 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 200 ms. Remains : 73/195 places, 90/196 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-04
Product exploration explored 100000 steps with 1613 reset in 130 ms.
Product exploration explored 100000 steps with 1613 reset in 141 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 244 steps (0 resets) in 5 ms. (40 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
// Phase 1: matrix 90 rows 73 cols
[2025-06-02 15:55:05] [INFO ] Computed 13 invariants in 0 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 15:55:05] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-06-02 15:55:05] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2025-06-02 15:55:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 15:55:05] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-06-02 15:55:05] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2025-06-02 15:55:05] [INFO ] State equation strengthened by 67 read => feed constraints.
[2025-06-02 15:55:05] [INFO ] [Nat]Added 67 Read/Feed constraints in 11 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:05] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:05] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:06] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:06] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:06] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:06] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:06] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:06] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 3 ms to minimize.
[2025-06-02 15:55:06] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 420 ms
[2025-06-02 15:55:06] [INFO ] Computed and/alt/rep : 89/211/89 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 15:55:06] [INFO ] Added : 77 causal constraints over 16 iterations in 201 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2025-06-02 15:55:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:06] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-02 15:55:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:06] [INFO ] State equation strengthened by 67 read => feed constraints.
[2025-06-02 15:55:06] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 15:55:06] [INFO ] Redundant transitions in 2 ms returned []
Running 89 sub problems to find dead transitions.
[2025-06-02 15:55:06] [INFO ] Invariant cache hit.
[2025-06-02 15:55:06] [INFO ] State equation strengthened by 67 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:06] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:06] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:06] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:07] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:07] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:07] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:07] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:07] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:07] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:07] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:07] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 5 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:07] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 4 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:07] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:07] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 4 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:07] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:07] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:07] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 2 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:07] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:07] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:07] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 20/33 constraints. Problems are: Problem set: 16 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:07] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 4 ms to minimize.
Problem TDEAD48 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:07] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 4 ms to minimize.
Problem TDEAD63 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:07] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:08] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 4 ms to minimize.
Problem TDEAD68 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:08] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 5 ms to minimize.
Problem TDEAD70 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:08] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:08] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 2 ms to minimize.
Problem TDEAD76 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:08] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:08] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 3 ms to minimize.
Problem TDEAD77 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:08] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:08] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 4 ms to minimize.
Problem TDEAD81 is UNSAT
Problem TDEAD85 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 11/44 constraints. Problems are: Problem set: 24 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/44 constraints. Problems are: Problem set: 24 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 90/163 variables, 73/117 constraints. Problems are: Problem set: 24 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 67/184 constraints. Problems are: Problem set: 24 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/184 constraints. Problems are: Problem set: 24 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/163 variables, 0/184 constraints. Problems are: Problem set: 24 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 184 constraints, problems are : Problem set: 24 solved, 65 unsolved in 3461 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 73/73 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 65 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 10/10 constraints. Problems are: Problem set: 24 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 12/22 constraints. Problems are: Problem set: 24 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/22 constraints. Problems are: Problem set: 24 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 8/73 variables, 3/25 constraints. Problems are: Problem set: 24 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 19/44 constraints. Problems are: Problem set: 24 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/44 constraints. Problems are: Problem set: 24 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 90/163 variables, 73/117 constraints. Problems are: Problem set: 24 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 67/184 constraints. Problems are: Problem set: 24 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 65/249 constraints. Problems are: Problem set: 24 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/249 constraints. Problems are: Problem set: 24 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/163 variables, 0/249 constraints. Problems are: Problem set: 24 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 249 constraints, problems are : Problem set: 24 solved, 65 unsolved in 2663 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 73/73 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 65/89 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6138ms problems are : Problem set: 24 solved, 65 unsolved
Search for dead transitions found 24 dead transitions in 6139ms
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 : 73/73 places, 66/90 transitions.
Graph (complete) has 211 edges and 73 vertex of which 65 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 65 /73 variables (removed 8) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 65 cols
[2025-06-02 15:55:12] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:12] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-02 15:55:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:12] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-02 15:55:12] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 65/73 places, 66/90 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6491 ms. Remains : 65/73 places, 66/90 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 244 steps (0 resets) in 5 ms. (40 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2025-06-02 15:55:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 15:55:13] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2025-06-02 15:55:13] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2025-06-02 15:55:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 15:55:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 15:55:13] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-02 15:55:13] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-02 15:55:13] [INFO ] [Nat]Added 47 Read/Feed constraints in 6 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:13] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:13] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:13] [INFO ] Deduced a trap composed of 4 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 15:55:13] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:13] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:13] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:13] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:13] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:13] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:13] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:14] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:14] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 4 ms to minimize.
[2025-06-02 15:55:14] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 622 ms
[2025-06-02 15:55:14] [INFO ] Computed and/alt/rep : 65/99/65 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 15:55:14] [INFO ] Added : 65 causal constraints over 13 iterations in 113 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1613 reset in 178 ms.
Product exploration explored 100000 steps with 1613 reset in 143 ms.
Built C files in :
/tmp/ltsmin5405617795678133922
[2025-06-02 15:55:14] [INFO ] Computing symmetric may disable matrix : 66 transitions.
[2025-06-02 15:55:14] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 15:55:14] [INFO ] Computing symmetric may enable matrix : 66 transitions.
[2025-06-02 15:55:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 15:55:14] [INFO ] Computing Do-Not-Accords matrix : 66 transitions.
[2025-06-02 15:55:14] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 15:55:14] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5405617795678133922
Running compilation step : cd /tmp/ltsmin5405617795678133922;'/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 157 ms.
Running link step : cd /tmp/ltsmin5405617795678133922;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5405617795678133922;'/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/stateBased13752509755212902013.hoa' '--buchi-type=spotba'
LTSmin run took 73 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-1-LTLFireability-04 finished in 10119 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((X(G(p2))&&p1)))))'
Support contains 6 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 195 /195 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 195 cols
[2025-06-02 15:55:14] [INFO ] Computed 29 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:15] [INFO ] Implicit Places using invariants in 141 ms returned [25, 33, 82, 84, 96, 98, 139, 140, 168]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 142 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/195 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 184 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 184 transition count 194
Applied a total of 4 rules in 4 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 184 cols
[2025-06-02 15:55:15] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:15] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-02 15:55:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:15] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 15:55:16] [INFO ] Implicit Places using invariants and state equation in 880 ms returned []
Implicit Place search using SMT with State Equation took 985 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 184/195 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1134 ms. Remains : 184/195 places, 194/196 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 145 ms.
Stack based approach found an accepted trace after 162 steps with 0 reset with depth 163 and stack size 163 in 1 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-1-LTLFireability-07 finished in 1490 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 4 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 196/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 195 transition count 161
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 160 transition count 161
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 70 place count 160 transition count 152
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 88 place count 151 transition count 152
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 134 place count 128 transition count 129
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 2 with 2 rules applied. Total rules applied 136 place count 127 transition count 128
Applied a total of 136 rules in 12 ms. Remains 127 /195 variables (removed 68) and now considering 128/196 (removed 68) transitions.
// Phase 1: matrix 128 rows 127 cols
[2025-06-02 15:55:16] [INFO ] Computed 29 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:16] [INFO ] Implicit Places using invariants in 106 ms returned [0, 2, 4, 11, 16, 28, 37, 44, 56, 57, 75, 88, 89, 112, 121]
[2025-06-02 15:55:16] [INFO ] Actually due to overlaps returned [44, 4, 16, 28, 56, 57, 88, 89, 112, 11, 121, 0]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 107 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/195 places, 128/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 115 transition count 126
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 113 transition count 126
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 113 transition count 121
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 108 transition count 121
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 106 transition count 119
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 106 transition count 119
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 48 place count 91 transition count 104
Applied a total of 48 rules in 10 ms. Remains 91 /115 variables (removed 24) and now considering 104/128 (removed 24) transitions.
// Phase 1: matrix 104 rows 91 cols
[2025-06-02 15:55:16] [INFO ] Computed 17 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:16] [INFO ] Implicit Places using invariants in 60 ms returned [1, 27, 55]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 61 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 88/195 places, 104/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 88 /88 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 192 ms. Remains : 88/195 places, 104/196 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 196 ms.
Stack based approach found an accepted trace after 73 steps with 0 reset with depth 74 and stack size 74 in 1 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-1-LTLFireability-10 finished in 516 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 U ((F(p1) U p2)&&X(!p2)))))'
Support contains 5 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 196/196 transitions.
Applied a total of 0 rules in 4 ms. Remains 195 /195 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 195 cols
[2025-06-02 15:55:16] [INFO ] Computed 29 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:17] [INFO ] Implicit Places using invariants in 161 ms returned [25, 33, 52, 82, 84, 96, 98, 140, 168, 186]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 162 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/195 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 183 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 183 transition count 194
Applied a total of 4 rules in 5 ms. Remains 183 /185 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 183 cols
[2025-06-02 15:55:17] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:17] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-06-02 15:55:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:17] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 15:55:17] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 183/195 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 888 ms. Remains : 183/195 places, 194/196 transitions.
Stuttering acceptance computed with spot in 372 ms :[true, p2, (NOT p1), (NOT p2), (AND (NOT p1) p2), (NOT p2), p2, true, (AND (NOT p1) p2)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-11
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-1-LTLFireability-11 finished in 1288 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(X(X(F(p1)))))))'
Support contains 4 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 195 /195 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 195 cols
[2025-06-02 15:55:18] [INFO ] Computed 29 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:18] [INFO ] Implicit Places using invariants in 170 ms returned [25, 52, 82, 84, 96, 98, 139, 140, 168, 186]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 171 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/195 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 183 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 183 transition count 194
Applied a total of 4 rules in 5 ms. Remains 183 /185 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 183 cols
[2025-06-02 15:55:18] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:18] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-02 15:55:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:18] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 15:55:18] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 183/195 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 612 ms. Remains : 183/195 places, 194/196 transitions.
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 112 ms.
Product exploration explored 100000 steps with 50000 reset in 111 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-1-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-1-LTLFireability-12 finished in 1082 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)) U p0)||F(p1)))'
Support contains 4 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 196/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 195 transition count 164
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 163 transition count 163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 162 transition count 163
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 66 place count 162 transition count 153
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 86 place count 152 transition count 153
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 134 place count 128 transition count 129
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 3 with 2 rules applied. Total rules applied 136 place count 127 transition count 128
Applied a total of 136 rules in 20 ms. Remains 127 /195 variables (removed 68) and now considering 128/196 (removed 68) transitions.
// Phase 1: matrix 128 rows 127 cols
[2025-06-02 15:55:19] [INFO ] Computed 29 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:19] [INFO ] Implicit Places using invariants in 111 ms returned [0, 2, 5, 17, 29, 39, 44, 46, 57, 58, 76, 89, 90, 112, 121]
[2025-06-02 15:55:19] [INFO ] Actually due to overlaps returned [44, 46, 5, 17, 29, 57, 58, 89, 90, 112, 121, 0]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 112 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/195 places, 128/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 115 transition count 124
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 111 transition count 124
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 111 transition count 120
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 107 transition count 120
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 74 place count 78 transition count 91
Applied a total of 74 rules in 7 ms. Remains 78 /115 variables (removed 37) and now considering 91/128 (removed 37) transitions.
// Phase 1: matrix 91 rows 78 cols
[2025-06-02 15:55:19] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:19] [INFO ] Implicit Places using invariants in 56 ms returned [1, 32, 51]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 57 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 75/195 places, 91/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 198 ms. Remains : 75/195 places, 91/196 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-13
Product exploration explored 100000 steps with 1493 reset in 89 ms.
Product exploration explored 100000 steps with 1492 reset in 98 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 32740 steps (7 resets) in 188 ms. (173 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 286 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
// Phase 1: matrix 91 rows 75 cols
[2025-06-02 15:55:20] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 15:55:20] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2025-06-02 15:55:20] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2025-06-02 15:55:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 15:55:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2025-06-02 15:55:20] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2025-06-02 15:55:20] [INFO ] State equation strengthened by 67 read => feed constraints.
[2025-06-02 15:55:20] [INFO ] [Nat]Added 67 Read/Feed constraints in 7 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:20] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:20] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:20] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:21] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:21] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:21] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:21] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:21] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:21] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:21] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:21] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 4 ms to minimize.
[2025-06-02 15:55:21] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 469 ms
[2025-06-02 15:55:21] [INFO ] Computed and/alt/rep : 90/214/90 causal constraints (skipped 0 transitions) in 5 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:21] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 5 ms to minimize.
[2025-06-02 15:55:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2025-06-02 15:55:21] [INFO ] Added : 88 causal constraints over 19 iterations in 241 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 91/91 transitions.
Applied a total of 0 rules in 5 ms. Remains 75 /75 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2025-06-02 15:55:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:21] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-02 15:55:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:21] [INFO ] State equation strengthened by 67 read => feed constraints.
[2025-06-02 15:55:21] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 15:55:21] [INFO ] Redundant transitions in 2 ms returned []
Running 90 sub problems to find dead transitions.
[2025-06-02 15:55:21] [INFO ] Invariant cache hit.
[2025-06-02 15:55:21] [INFO ] State equation strengthened by 67 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:21] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:22] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:22] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:22] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:22] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:22] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:22] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:22] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:22] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 4 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:22] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 4 ms to minimize.
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:22] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:22] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 3 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:22] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:22] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:22] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:22] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:22] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 4 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:22] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:22] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:22] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 20/34 constraints. Problems are: Problem set: 16 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:22] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:23] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:23] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 4 ms to minimize.
Problem TDEAD50 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:23] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:23] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 4 ms to minimize.
Problem TDEAD63 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:23] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 3 ms to minimize.
Problem TDEAD69 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:23] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 6 ms to minimize.
Problem TDEAD71 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:23] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 4 ms to minimize.
Problem TDEAD77 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:23] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 4 ms to minimize.
Problem TDEAD78 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:23] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 3 ms to minimize.
Problem TDEAD82 is UNSAT
Problem TDEAD86 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 10/44 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/44 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 91/166 variables, 75/119 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 67/186 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/186 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/166 variables, 0/186 constraints. Problems are: Problem set: 24 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 186 constraints, problems are : Problem set: 24 solved, 66 unsolved in 3088 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 75/75 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 66 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 10/10 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 12/22 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/22 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 8/75 variables, 4/26 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 18/44 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/44 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 91/166 variables, 75/119 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 67/186 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 66/252 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 0/252 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/166 variables, 0/252 constraints. Problems are: Problem set: 24 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 252 constraints, problems are : Problem set: 24 solved, 66 unsolved in 2428 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 75/75 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 66/90 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5527ms problems are : Problem set: 24 solved, 66 unsolved
Search for dead transitions found 24 dead transitions in 5527ms
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 : 75/75 places, 67/91 transitions.
Graph (complete) has 218 edges and 75 vertex of which 67 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 67 /75 variables (removed 8) and now considering 67/67 (removed 0) transitions.
// Phase 1: matrix 67 rows 67 cols
[2025-06-02 15:55:27] [INFO ] Computed 14 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:27] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-02 15:55:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:27] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-02 15:55:27] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/75 places, 67/91 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5925 ms. Remains : 67/75 places, 67/91 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 129 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 32073 steps (6 resets) in 47 ms. (668 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 273 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2025-06-02 15:55:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 15:55:28] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 15:55:28] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2025-06-02 15:55:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 15:55:28] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-02 15:55:28] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-02 15:55:28] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-02 15:55:28] [INFO ] [Nat]Added 47 Read/Feed constraints in 7 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:28] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:28] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:28] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:28] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:28] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:28] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:28] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:28] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:28] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 4 ms to minimize.
[2025-06-02 15:55:28] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 360 ms
[2025-06-02 15:55:28] [INFO ] Computed and/alt/rep : 66/102/66 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 15:55:29] [INFO ] Added : 64 causal constraints over 13 iterations in 96 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 1493 reset in 89 ms.
Product exploration explored 100000 steps with 1493 reset in 95 ms.
Built C files in :
/tmp/ltsmin1199860822499914710
[2025-06-02 15:55:29] [INFO ] Computing symmetric may disable matrix : 67 transitions.
[2025-06-02 15:55:29] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 15:55:29] [INFO ] Computing symmetric may enable matrix : 67 transitions.
[2025-06-02 15:55:29] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 15:55:29] [INFO ] Computing Do-Not-Accords matrix : 67 transitions.
[2025-06-02 15:55:29] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 15:55:29] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1199860822499914710
Running compilation step : cd /tmp/ltsmin1199860822499914710;'/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 160 ms.
Running link step : cd /tmp/ltsmin1199860822499914710;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin1199860822499914710;'/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/stateBased17894813199804712292.hoa' '--buchi-type=spotba'
LTSmin run took 92 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-1-LTLFireability-13 finished in 10428 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)||F(p1)))'
Support contains 3 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 195 /195 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 195 cols
[2025-06-02 15:55:29] [INFO ] Computed 29 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:29] [INFO ] Implicit Places using invariants in 167 ms returned [25, 33, 52, 82, 84, 96, 98, 139, 140, 168, 186]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 168 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/195 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 182 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 182 transition count 194
Applied a total of 4 rules in 3 ms. Remains 182 /184 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 182 cols
[2025-06-02 15:55:29] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:29] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-06-02 15:55:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:30] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 15:55:30] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 182/195 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 661 ms. Remains : 182/195 places, 194/196 transitions.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-15
Product exploration explored 100000 steps with 666 reset in 95 ms.
Product exploration explored 100000 steps with 666 reset in 121 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 79 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 596 steps (0 resets) in 6 ms. (85 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 117 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2025-06-02 15:55:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 15:55:31] [INFO ] [Real]Absence check using 18 positive place invariants in 47 ms returned sat
[2025-06-02 15:55:32] [INFO ] [Real]Absence check using state equation in 721 ms returned sat
[2025-06-02 15:55:32] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 15:55:32] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2025-06-02 15:55:32] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2025-06-02 15:55:32] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 15:55:32] [INFO ] [Nat]Added 68 Read/Feed constraints in 193 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:32] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:32] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:32] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:33] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:33] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:33] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:33] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:33] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 3 ms to minimize.
[2025-06-02 15:55:33] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 906 ms
[2025-06-02 15:55:33] [INFO ] Computed and/alt/rep : 193/308/193 causal constraints (skipped 0 transitions) in 10 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:34] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 2 ms to minimize.
[2025-06-02 15:55:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2025-06-02 15:55:34] [INFO ] Added : 178 causal constraints over 37 iterations in 1179 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 182 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 194/194 transitions.
Applied a total of 0 rules in 2 ms. Remains 182 /182 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2025-06-02 15:55:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:34] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-02 15:55:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:34] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 15:55:35] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2025-06-02 15:55:35] [INFO ] Invariant cache hit.
[2025-06-02 15:55:35] [INFO ] State equation strengthened by 68 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:35] [INFO ] Deduced a trap composed of 5 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 15:55:35] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:36] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:36] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:36] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:36] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:36] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:36] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:36] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:36] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:36] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:36] [INFO ] Deduced a trap composed of 7 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 15:55:36] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:36] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:36] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:36] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:36] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:36] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:37] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:37] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:37] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:37] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:37] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:37] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:37] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:37] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:38] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:38] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:38] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:38] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:38] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:38] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:38] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:38] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/182 variables, 1/52 constraints. Problems are: Problem set: 24 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:41] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:41] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:41] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:41] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 8 ms to minimize.
Problem TDEAD92 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:41] [INFO ] Deduced a trap composed of 69 places in 66 ms of which 9 ms to minimize.
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD144 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:42] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 8 ms to minimize.
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 6/58 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/58 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 194/376 variables, 182/240 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 68/308 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 0/308 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 10 (OVERLAPS) 0/376 variables, 0/308 constraints. Problems are: Problem set: 32 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 308 constraints, problems are : Problem set: 32 solved, 161 unsolved in 18737 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 182/182 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 32 solved, 161 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 11/11 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 14/25 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/25 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 17/182 variables, 7/32 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 26/58 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/58 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 194/376 variables, 182/240 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 68/308 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 161/469 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 0/469 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 10 (OVERLAPS) 0/376 variables, 0/469 constraints. Problems are: Problem set: 32 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 469 constraints, problems are : Problem set: 32 solved, 161 unsolved in 17410 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 182/182 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 161/193 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36171ms problems are : Problem set: 32 solved, 161 unsolved
Search for dead transitions found 32 dead transitions in 36175ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in LTL mode, iteration 1 : 182/182 places, 162/194 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 166 transition count 162
Applied a total of 16 rules in 4 ms. Remains 166 /182 variables (removed 16) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 166 cols
[2025-06-02 15:56:11] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:56:11] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-02 15:56:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:56:11] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-02 15:56:11] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 166/182 places, 162/194 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36976 ms. Remains : 166/182 places, 162/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 596 steps (0 resets) in 7 ms. (74 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2025-06-02 15:56:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 15:56:12] [INFO ] [Real]Absence check using 18 positive place invariants in 48 ms returned sat
[2025-06-02 15:56:12] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2025-06-02 15:56:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 15:56:13] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2025-06-02 15:56:13] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2025-06-02 15:56:13] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-02 15:56:13] [INFO ] [Nat]Added 48 Read/Feed constraints in 219 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:13] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:13] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:13] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:13] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:14] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:14] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:14] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:14] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:14] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:14] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 8 ms to minimize.
[2025-06-02 15:56:14] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1064 ms
[2025-06-02 15:56:14] [INFO ] Computed and/alt/rep : 161/196/161 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 15:56:15] [INFO ] Added : 147 causal constraints over 30 iterations in 1058 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 666 reset in 86 ms.
Product exploration explored 100000 steps with 666 reset in 89 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 162/162 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 166 transition count 162
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 38 place count 166 transition count 162
Deduced a syphon composed of 51 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 51 place count 166 transition count 162
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 62 place count 155 transition count 151
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 73 place count 155 transition count 151
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 111 place count 155 transition count 151
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 140 place count 126 transition count 122
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 169 place count 126 transition count 122
Deduced a syphon composed of 49 places in 0 ms
Applied a total of 169 rules in 23 ms. Remains 126 /166 variables (removed 40) and now considering 122/162 (removed 40) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 15:56:16] [INFO ] Redundant transitions in 2 ms returned []
Running 121 sub problems to find dead transitions.
// Phase 1: matrix 122 rows 126 cols
[2025-06-02 15:56:16] [INFO ] Computed 18 invariants in 0 ms
[2025-06-02 15:56:16] [INFO ] State equation strengthened by 48 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:16] [INFO ] Deduced a trap composed of 8 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 15:56:16] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:16] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:16] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:16] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:16] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 5 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:16] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:16] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:17] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 5 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:17] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 4 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:17] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:17] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:17] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 4 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:17] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:17] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 4 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:17] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 2 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD49 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:17] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD51 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:17] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 2 ms to minimize.
Problem TDEAD54 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:17] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:17] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 20/37 constraints. Problems are: Problem set: 45 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:17] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:17] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:17] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:17] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:17] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 5/42 constraints. Problems are: Problem set: 45 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/42 constraints. Problems are: Problem set: 45 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 1/126 variables, 1/43 constraints. Problems are: Problem set: 45 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:18] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:18] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:18] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 4 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD72 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:18] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 3 ms to minimize.
Problem TDEAD86 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 4/47 constraints. Problems are: Problem set: 49 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/47 constraints. Problems are: Problem set: 49 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 122/248 variables, 126/173 constraints. Problems are: Problem set: 49 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 48/221 constraints. Problems are: Problem set: 49 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/221 constraints. Problems are: Problem set: 49 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/248 variables, 0/221 constraints. Problems are: Problem set: 49 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 221 constraints, problems are : Problem set: 49 solved, 72 unsolved in 5274 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 126/126 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 49 solved, 72 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 10/10 constraints. Problems are: Problem set: 49 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 27/37 constraints. Problems are: Problem set: 49 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/37 constraints. Problems are: Problem set: 49 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 50/126 variables, 8/45 constraints. Problems are: Problem set: 49 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 2/47 constraints. Problems are: Problem set: 49 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/47 constraints. Problems are: Problem set: 49 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 122/248 variables, 126/173 constraints. Problems are: Problem set: 49 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 48/221 constraints. Problems are: Problem set: 49 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 72/293 constraints. Problems are: Problem set: 49 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/293 constraints. Problems are: Problem set: 49 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/248 variables, 0/293 constraints. Problems are: Problem set: 49 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 293 constraints, problems are : Problem set: 49 solved, 72 unsolved in 5486 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 126/126 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 72/121 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10771ms problems are : Problem set: 49 solved, 72 unsolved
Search for dead transitions found 49 dead transitions in 10772ms
Found 49 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 49 transitions
Dead transitions reduction (with SMT) removed 49 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 126/166 places, 73/162 transitions.
Graph (complete) has 237 edges and 126 vertex of which 77 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.1 ms
Discarding 49 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 77 transition count 73
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 77 transition count 73
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 7 ms. Remains 77 /126 variables (removed 49) and now considering 73/73 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/166 places, 73/162 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10821 ms. Remains : 77/166 places, 73/162 transitions.
Built C files in :
/tmp/ltsmin14738515892237955172
[2025-06-02 15:56:27] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14738515892237955172
Running compilation step : cd /tmp/ltsmin14738515892237955172;'/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 245 ms.
Running link step : cd /tmp/ltsmin14738515892237955172;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin14738515892237955172;'/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/stateBased11087137950798061798.hoa' '--buchi-type=spotba'
LTSmin run took 5930 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-1-LTLFireability-15 finished in 63578 ms.
All properties solved by simple procedures.
Total runtime 107441 ms.

BK_STOP 1748879793326

--------------------
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="ParamProductionCell-PT-1"
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 ParamProductionCell-PT-1, 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 r142-tall-174876812400364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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