Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 400K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 39K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 43K 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 ProductionCell-PT-none-LTLFireability-00
FORMULA_NAME ProductionCell-PT-none-LTLFireability-01
FORMULA_NAME ProductionCell-PT-none-LTLFireability-02
FORMULA_NAME ProductionCell-PT-none-LTLFireability-03
FORMULA_NAME ProductionCell-PT-none-LTLFireability-04
FORMULA_NAME ProductionCell-PT-none-LTLFireability-05
FORMULA_NAME ProductionCell-PT-none-LTLFireability-06
FORMULA_NAME ProductionCell-PT-none-LTLFireability-07
FORMULA_NAME ProductionCell-PT-none-LTLFireability-08
FORMULA_NAME ProductionCell-PT-none-LTLFireability-09
FORMULA_NAME ProductionCell-PT-none-LTLFireability-10
FORMULA_NAME ProductionCell-PT-none-LTLFireability-11
FORMULA_NAME ProductionCell-PT-none-LTLFireability-12
FORMULA_NAME ProductionCell-PT-none-LTLFireability-13
FORMULA_NAME ProductionCell-PT-none-LTLFireability-14
FORMULA_NAME ProductionCell-PT-none-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749121933701

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ProductionCell-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-05 11:12:14] [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-05 11:12:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 11:12:15] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2025-06-05 11:12:15] [INFO ] Transformed 176 places.
[2025-06-05 11:12:15] [INFO ] Transformed 134 transitions.
[2025-06-05 11:12:15] [INFO ] Found NUPN structural information;
[2025-06-05 11:12:15] [INFO ] Parsed PT model containing 176 places and 134 transitions and 513 arcs in 154 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 2 formulas.
FORMULA ProductionCell-PT-none-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ProductionCell-PT-none-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 67 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 134/134 transitions.
Applied a total of 0 rules in 21 ms. Remains 176 /176 variables (removed 0) and now considering 134/134 (removed 0) transitions.
// Phase 1: matrix 134 rows 176 cols
[2025-06-05 11:12:15] [INFO ] Computed 50 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:12:15] [INFO ] Implicit Places using invariants in 308 ms returned [42, 59, 63, 130]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 339 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 172/176 places, 134/134 transitions.
Applied a total of 0 rules in 6 ms. Remains 172 /172 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 382 ms. Remains : 172/176 places, 134/134 transitions.
Support contains 67 out of 172 places after structural reductions.
[2025-06-05 11:12:15] [INFO ] Flatten gal took : 34 ms
[2025-06-05 11:12:15] [INFO ] Flatten gal took : 15 ms
[2025-06-05 11:12:15] [INFO ] Input system was already deterministic with 134 transitions.
Support contains 63 out of 172 places (down from 67) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 37 to 34
RANDOM walk for 40000 steps (8 resets) in 1031 ms. (38 steps per ms) remains 3/34 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 192 ms. (207 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 131 ms. (303 steps per ms) remains 3/3 properties
// Phase 1: matrix 134 rows 172 cols
[2025-06-05 11:12:16] [INFO ] Computed 46 invariants in 3 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 27/32 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 27/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 90/122 variables, 29/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 90/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:12:16] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp17 is UNSAT
At refinement iteration 9 (OVERLAPS) 47/169 variables, 13/168 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 47/215 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:12:16] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 8 ms to minimize.
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp23 is UNSAT
After SMT solving in domain Real declared 169/306 variables, and 216 constraints, problems are : Problem set: 3 solved, 0 unsolved in 442 ms.
Refiners :[Domain max(s): 169/172 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 13/14 constraints, State Equation: 0/172 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 467ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA ProductionCell-PT-none-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA ProductionCell-PT-none-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 27 stabilizing places and 32 stable transitions
FORMULA ProductionCell-PT-none-LTLFireability-09 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' '!(G((F((F(p1)&&G(p2)&&p0))||X((p1&&F(p3))))))'
Support contains 9 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 134/134 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 170 transition count 132
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 170 transition count 132
Applied a total of 4 rules in 18 ms. Remains 170 /172 variables (removed 2) and now considering 132/134 (removed 2) transitions.
// Phase 1: matrix 132 rows 170 cols
[2025-06-05 11:12:17] [INFO ] Computed 46 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:12:17] [INFO ] Implicit Places using invariants in 129 ms returned [36, 130, 131, 135]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 132 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 166/172 places, 132/134 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 165 transition count 130
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 165 transition count 130
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 164 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 164 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 163 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 163 transition count 128
Applied a total of 6 rules in 14 ms. Remains 163 /166 variables (removed 3) and now considering 128/132 (removed 4) transitions.
// Phase 1: matrix 128 rows 163 cols
[2025-06-05 11:12:17] [INFO ] Computed 42 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:12:17] [INFO ] Implicit Places using invariants in 167 ms returned []
[2025-06-05 11:12:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:12:17] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 163/172 places, 128/134 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 502 ms. Remains : 163/172 places, 128/134 transitions.
Stuttering acceptance computed with spot in 656 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : ProductionCell-PT-none-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 305 ms.
Stack based approach found an accepted trace after 228 steps with 0 reset with depth 229 and stack size 229 in 1 ms.
FORMULA ProductionCell-PT-none-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ProductionCell-PT-none-LTLFireability-00 finished in 1536 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(p1))))'
Support contains 3 out of 172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 172/172 places, 134/134 transitions.
Reduce places removed 1 places and 1 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 171 transition count 130
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 168 transition count 130
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 6 place count 168 transition count 98
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 70 place count 136 transition count 98
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 133 transition count 95
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 133 transition count 95
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
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 86 place count 128 transition count 90
Applied a total of 86 rules in 33 ms. Remains 128 /172 variables (removed 44) and now considering 90/134 (removed 44) transitions.
// Phase 1: matrix 90 rows 128 cols
[2025-06-05 11:12:18] [INFO ] Computed 46 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:12:19] [INFO ] Implicit Places using invariants in 111 ms returned [19, 20, 26, 70, 71, 72, 73, 92, 95]
[2025-06-05 11:12:19] [INFO ] Actually due to overlaps returned [70, 73, 95, 19, 20, 26, 71, 72]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 124 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/172 places, 90/134 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 119 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 119 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 118 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 118 transition count 87
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 116 transition count 85
Applied a total of 8 rules in 13 ms. Remains 116 /120 variables (removed 4) and now considering 85/90 (removed 5) transitions.
// Phase 1: matrix 85 rows 116 cols
[2025-06-05 11:12:19] [INFO ] Computed 38 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:12:19] [INFO ] Implicit Places using invariants in 99 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 115/172 places, 85/134 transitions.
Applied a total of 0 rules in 4 ms. Remains 115 /115 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 275 ms. Remains : 115/172 places, 85/134 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ProductionCell-PT-none-LTLFireability-01
Product exploration explored 100000 steps with 525 reset in 210 ms.
Stack based approach found an accepted trace after 180 steps with 0 reset with depth 181 and stack size 181 in 1 ms.
FORMULA ProductionCell-PT-none-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ProductionCell-PT-none-LTLFireability-01 finished in 654 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(!p0) U X(X((p1 U p2)))) U (G(!p2) U p1)))'
Support contains 6 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 134/134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 169 transition count 131
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 169 transition count 131
Applied a total of 6 rules in 5 ms. Remains 169 /172 variables (removed 3) and now considering 131/134 (removed 3) transitions.
// Phase 1: matrix 131 rows 169 cols
[2025-06-05 11:12:19] [INFO ] Computed 46 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:12:19] [INFO ] Implicit Places using invariants in 134 ms returned [36, 129, 130, 134]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 136 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 165/172 places, 131/134 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 164 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 164 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 163 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 163 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 162 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 162 transition count 127
Applied a total of 6 rules in 8 ms. Remains 162 /165 variables (removed 3) and now considering 127/131 (removed 4) transitions.
// Phase 1: matrix 127 rows 162 cols
[2025-06-05 11:12:19] [INFO ] Computed 42 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:12:20] [INFO ] Implicit Places using invariants in 354 ms returned []
[2025-06-05 11:12:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:12:20] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 162/172 places, 127/134 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 638 ms. Remains : 162/172 places, 127/134 transitions.
Stuttering acceptance computed with spot in 618 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND p0 (NOT p2)), false, false, (NOT p2), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), false, (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND p0 p2), p0, (AND p0 (NOT p1))]
Running random walk in product with property : ProductionCell-PT-none-LTLFireability-04
Product exploration explored 100000 steps with 4735 reset in 178 ms.
Product exploration explored 100000 steps with 4742 reset in 316 ms.
Computed a total of 21 stabilizing places and 25 stable transitions
Computed a total of 21 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p2 p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 180 ms. Reduced automaton from 16 states, 35 edges and 3 AP (stutter sensitive) to 16 states, 35 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 597 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND p0 (NOT p2)), false, false, (NOT p2), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), false, (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND p0 p2), p0, (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 301 ms. (132 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 244 ms. (163 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
[2025-06-05 11:12:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf5 is UNSAT
Problem apf7 is UNSAT
After SMT solving in domain Real declared 38/289 variables, and 13 constraints, problems are : Problem set: 2 solved, 0 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 13/33 constraints, Generalized P Invariants (flows): 0/9 constraints, State Equation: 0/162 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 160ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p2 p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (G (OR (NOT p2) p1 (NOT p0))), (G (OR (NOT p2) (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F p2), (F (NOT (OR p2 (NOT p0)))), (F p1), (F (NOT (OR p2 p1 (NOT p0)))), (F p0)]
Knowledge based reduction with 22 factoid took 385 ms. Reduced automaton from 16 states, 35 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p2), (NOT p1), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p2), (NOT p1), (OR (NOT p1) (NOT p2))]
[2025-06-05 11:12:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 11:12:23] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2025-06-05 11:12:23] [INFO ] [Real]Absence check using 33 positive and 9 generalized place invariants in 7 ms returned sat
[2025-06-05 11:12:23] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2025-06-05 11:12:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 11:12:23] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2025-06-05 11:12:23] [INFO ] [Nat]Absence check using 33 positive and 9 generalized place invariants in 5 ms returned sat
[2025-06-05 11:12:23] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2025-06-05 11:12:23] [INFO ] Computed and/alt/rep : 123/341/123 causal constraints (skipped 3 transitions) in 20 ms.
[2025-06-05 11:12:24] [INFO ] Added : 118 causal constraints over 24 iterations in 520 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 162 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 127/127 transitions.
Applied a total of 0 rules in 1 ms. Remains 162 /162 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2025-06-05 11:12:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:12:24] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-05 11:12:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:12:24] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2025-06-05 11:12:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 33/40 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:12:26] [INFO ] Deduced a trap composed of 19 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-05 11:12:26] [INFO ] Deduced a trap composed of 8 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-05 11:12:26] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:12:26] [INFO ] Deduced a trap composed of 20 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-05 11:12:26] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 6 ms to minimize.
Problem TDEAD41 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 5/47 constraints. Problems are: Problem set: 1 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:12:26] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:12:26] [INFO ] Deduced a trap composed of 9 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-05 11:12:26] [INFO ] Deduced a trap composed of 14 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-05 11:12:26] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 3 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:12:26] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 3 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 5/52 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/52 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 127/289 variables, 162/214 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/214 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 0/289 variables, 0/214 constraints. Problems are: Problem set: 5 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 214 constraints, problems are : Problem set: 5 solved, 121 unsolved in 6461 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 121 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 7/7 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 33/40 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 2/42 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 10/52 constraints. Problems are: Problem set: 5 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:12:31] [INFO ] Deduced a trap composed of 8 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-05 11:12:31] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 2/54 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/54 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 127/289 variables, 162/216 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 121/337 constraints. Problems are: Problem set: 5 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:12:35] [INFO ] Deduced a trap along path 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-05 11:12:35] [INFO ] Deduced a trap along path composed of 5 places in 31 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 2/339 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/339 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/289 variables, 0/339 constraints. Problems are: Problem set: 5 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 339 constraints, problems are : Problem set: 5 solved, 121 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 121/126 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 36515ms problems are : Problem set: 5 solved, 121 unsolved
Search for dead transitions found 5 dead transitions in 36516ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in LTL mode, iteration 1 : 162/162 places, 122/127 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 161 transition count 122
Applied a total of 1 rules in 2 ms. Remains 161 /162 variables (removed 1) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 161 cols
[2025-06-05 11:13:01] [INFO ] Computed 42 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:13:01] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-05 11:13:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:13:01] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 161/162 places, 122/127 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 37018 ms. Remains : 161/162 places, 122/127 transitions.
Computed a total of 20 stabilizing places and 20 stable transitions
Computed a total of 20 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 106 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p2), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 164 ms. (242 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
[2025-06-05 11:13:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 36/283 variables, and 12 constraints, problems are : Problem set: 1 solved, 0 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 12/33 constraints, Generalized P Invariants (flows): 0/9 constraints, State Equation: 0/161 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F p1), (F (NOT (OR p1 (NOT p2)))), (F p2)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 256 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 9 states, 22 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 351 ms :[(NOT p2), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p2)), false, (AND p2 (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 306 ms :[(NOT p2), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p2)), false, (AND p2 (NOT p1)), false, false, false]
[2025-06-05 11:13:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 11:13:02] [INFO ] [Real]Absence check using 33 positive place invariants in 24 ms returned sat
[2025-06-05 11:13:02] [INFO ] [Real]Absence check using 33 positive and 9 generalized place invariants in 7 ms returned sat
[2025-06-05 11:13:02] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2025-06-05 11:13:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 11:13:02] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2025-06-05 11:13:02] [INFO ] [Nat]Absence check using 33 positive and 9 generalized place invariants in 4 ms returned sat
[2025-06-05 11:13:03] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2025-06-05 11:13:03] [INFO ] Computed and/alt/rep : 118/317/118 causal constraints (skipped 3 transitions) in 8 ms.
[2025-06-05 11:13:03] [INFO ] Added : 116 causal constraints over 24 iterations in 464 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 336 ms :[(NOT p2), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p2)), false, (AND p2 (NOT p1)), false, false, false]
Product exploration explored 100000 steps with 1497 reset in 169 ms.
Stack based approach found an accepted trace after 827 steps with 19 reset with depth 69 and stack size 69 in 2 ms.
FORMULA ProductionCell-PT-none-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ProductionCell-PT-none-LTLFireability-04 finished in 44516 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 X((p1||G(!p1)))))'
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 134/134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 169 transition count 131
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 169 transition count 131
Applied a total of 6 rules in 3 ms. Remains 169 /172 variables (removed 3) and now considering 131/134 (removed 3) transitions.
// Phase 1: matrix 131 rows 169 cols
[2025-06-05 11:13:04] [INFO ] Computed 46 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:13:04] [INFO ] Implicit Places using invariants in 94 ms returned [36, 129, 130, 134]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 108 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 165/172 places, 131/134 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 164 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 164 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 163 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 163 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 162 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 162 transition count 127
Applied a total of 6 rules in 7 ms. Remains 162 /165 variables (removed 3) and now considering 127/131 (removed 4) transitions.
// Phase 1: matrix 127 rows 162 cols
[2025-06-05 11:13:04] [INFO ] Computed 42 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:13:04] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-05 11:13:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:13:04] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 162/172 places, 127/134 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 342 ms. Remains : 162/172 places, 127/134 transitions.
Stuttering acceptance computed with spot in 209 ms :[true, false, (AND p1 (NOT p0)), (NOT p0), false, false, p1]
Running random walk in product with property : ProductionCell-PT-none-LTLFireability-05
Entered a terminal (fully accepting) state of product in 97 steps with 0 reset in 1 ms.
FORMULA ProductionCell-PT-none-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ProductionCell-PT-none-LTLFireability-05 finished in 573 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 p1) U (!p1 U (p0||X(p2)))))'
Support contains 5 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 134/134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 169 transition count 131
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 169 transition count 131
Applied a total of 6 rules in 5 ms. Remains 169 /172 variables (removed 3) and now considering 131/134 (removed 3) transitions.
// Phase 1: matrix 131 rows 169 cols
[2025-06-05 11:13:04] [INFO ] Computed 46 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:13:04] [INFO ] Implicit Places using invariants in 79 ms returned [36, 129, 130, 134]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 80 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 165/172 places, 131/134 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 164 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 164 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 163 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 163 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 162 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 162 transition count 127
Applied a total of 6 rules in 5 ms. Remains 162 /165 variables (removed 3) and now considering 127/131 (removed 4) transitions.
// Phase 1: matrix 127 rows 162 cols
[2025-06-05 11:13:04] [INFO ] Computed 42 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:13:04] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-05 11:13:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:13:04] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 162/172 places, 127/134 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 299 ms. Remains : 162/172 places, 127/134 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : ProductionCell-PT-none-LTLFireability-06
Product exploration explored 100000 steps with 33287 reset in 162 ms.
Product exploration explored 100000 steps with 33301 reset in 176 ms.
Computed a total of 21 stabilizing places and 25 stable transitions
Computed a total of 21 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 123 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p0)]
RANDOM walk for 2869 steps (0 resets) in 29 ms. (95 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p1), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 p2 (NOT p1))))]
Knowledge based reduction with 13 factoid took 316 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p0)]
[2025-06-05 11:13:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 11:13:06] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2025-06-05 11:13:06] [INFO ] [Real]Absence check using 33 positive and 9 generalized place invariants in 4 ms returned sat
[2025-06-05 11:13:06] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2025-06-05 11:13:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 11:13:06] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2025-06-05 11:13:06] [INFO ] [Nat]Absence check using 33 positive and 9 generalized place invariants in 17 ms returned sat
[2025-06-05 11:13:06] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2025-06-05 11:13:06] [INFO ] Computed and/alt/rep : 123/341/123 causal constraints (skipped 3 transitions) in 7 ms.
[2025-06-05 11:13:07] [INFO ] Added : 102 causal constraints over 21 iterations in 324 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 5 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 127/127 transitions.
Applied a total of 0 rules in 2 ms. Remains 162 /162 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2025-06-05 11:13:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:13:07] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-05 11:13:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:13:07] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2025-06-05 11:13:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 33/40 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:08] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:08] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:08] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:09] [INFO ] Deduced a trap composed of 20 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-05 11:13:09] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 5 ms to minimize.
Problem TDEAD41 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 5/47 constraints. Problems are: Problem set: 1 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:09] [INFO ] Deduced a trap composed of 8 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-05 11:13:09] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:09] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:09] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 3 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:09] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 3 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 5/52 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/52 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 127/289 variables, 162/214 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/214 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 0/289 variables, 0/214 constraints. Problems are: Problem set: 5 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 214 constraints, problems are : Problem set: 5 solved, 121 unsolved in 6200 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 121 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 7/7 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 33/40 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 2/42 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 10/52 constraints. Problems are: Problem set: 5 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:14] [INFO ] Deduced a trap composed of 8 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-05 11:13:14] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 2/54 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/54 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 127/289 variables, 162/216 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 121/337 constraints. Problems are: Problem set: 5 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:17] [INFO ] Deduced a trap along path 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-05 11:13:17] [INFO ] Deduced a trap along path composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 2/339 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/339 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/289 variables, 0/339 constraints. Problems are: Problem set: 5 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 339 constraints, problems are : Problem set: 5 solved, 121 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 121/126 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 36234ms problems are : Problem set: 5 solved, 121 unsolved
Search for dead transitions found 5 dead transitions in 36235ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in LTL mode, iteration 1 : 162/162 places, 122/127 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 161 transition count 122
Applied a total of 1 rules in 3 ms. Remains 161 /162 variables (removed 1) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 161 cols
[2025-06-05 11:13:43] [INFO ] Computed 42 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:13:43] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-05 11:13:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:13:43] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 161/162 places, 122/127 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36662 ms. Remains : 161/162 places, 122/127 transitions.
Computed a total of 20 stabilizing places and 20 stable transitions
Computed a total of 20 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 100 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p0)]
RANDOM walk for 3137 steps (0 resets) in 35 ms. (87 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p1), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 p2 (NOT p1))))]
Knowledge based reduction with 12 factoid took 312 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p0)]
[2025-06-05 11:13:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 11:13:44] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2025-06-05 11:13:44] [INFO ] [Real]Absence check using 33 positive and 9 generalized place invariants in 4 ms returned sat
[2025-06-05 11:13:44] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2025-06-05 11:13:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 11:13:45] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2025-06-05 11:13:45] [INFO ] [Nat]Absence check using 33 positive and 9 generalized place invariants in 4 ms returned sat
[2025-06-05 11:13:45] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2025-06-05 11:13:45] [INFO ] Computed and/alt/rep : 118/317/118 causal constraints (skipped 3 transitions) in 7 ms.
[2025-06-05 11:13:45] [INFO ] Added : 113 causal constraints over 23 iterations in 352 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 25007 reset in 168 ms.
Product exploration explored 100000 steps with 24967 reset in 162 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p0)]
Support contains 5 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 122/122 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 161 transition count 122
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 24 Pre rules applied. Total rules applied 5 place count 161 transition count 124
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 29 place count 161 transition count 124
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 159 transition count 122
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 159 transition count 122
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 44 place count 159 transition count 122
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 158 transition count 121
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 158 transition count 121
Deduced a syphon composed of 37 places in 0 ms
Applied a total of 46 rules in 27 ms. Remains 158 /161 variables (removed 3) and now considering 121/122 (removed 1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:13:46] [INFO ] Redundant transitions in 2 ms returned []
Running 120 sub problems to find dead transitions.
// Phase 1: matrix 121 rows 158 cols
[2025-06-05 11:13:46] [INFO ] Computed 42 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 33/40 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:47] [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-05 11:13:47] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 4 ms to minimize.
Problem TDEAD35 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:47] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 4 ms to minimize.
Problem TDEAD37 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:47] [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-05 11:13:48] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 5 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD76 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:48] [INFO ] Deduced a trap composed of 4 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-05 11:13:48] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Problem TDEAD103 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:48] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 3 ms to minimize.
Problem TDEAD105 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:48] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 2 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD110 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:48] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 6 ms to minimize.
Problem TDEAD112 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:48] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 11/53 constraints. Problems are: Problem set: 24 solved, 96 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:48] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 5 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:48] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:48] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 3 ms to minimize.
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:48] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 3 ms to minimize.
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:48] [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-05 11:13:48] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:48] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 4 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:48] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 3 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD53 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:48] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 3 ms to minimize.
Problem TDEAD80 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD51 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 9/62 constraints. Problems are: Problem set: 38 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:49] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Problem TDEAD23 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 1/63 constraints. Problems are: Problem set: 39 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/63 constraints. Problems are: Problem set: 39 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 121/279 variables, 158/221 constraints. Problems are: Problem set: 39 solved, 81 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:50] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 1/222 constraints. Problems are: Problem set: 39 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 0/222 constraints. Problems are: Problem set: 39 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/279 variables, 0/222 constraints. Problems are: Problem set: 39 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 222 constraints, problems are : Problem set: 39 solved, 81 unsolved in 5186 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 39 solved, 81 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 39 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 29/149 variables, 33/33 constraints. Problems are: Problem set: 39 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 22/55 constraints. Problems are: Problem set: 39 solved, 81 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:51] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 1/56 constraints. Problems are: Problem set: 39 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/56 constraints. Problems are: Problem set: 39 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 9/158 variables, 9/65 constraints. Problems are: Problem set: 39 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/65 constraints. Problems are: Problem set: 39 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 121/279 variables, 158/223 constraints. Problems are: Problem set: 39 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 81/304 constraints. Problems are: Problem set: 39 solved, 81 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:55] [INFO ] Deduced a trap along path composed of 4 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 1/305 constraints. Problems are: Problem set: 39 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 0/305 constraints. Problems are: Problem set: 39 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/279 variables, 0/305 constraints. Problems are: Problem set: 39 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 305 constraints, problems are : Problem set: 39 solved, 81 unsolved in 17916 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 81/120 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 23119ms problems are : Problem set: 39 solved, 81 unsolved
Search for dead transitions found 39 dead transitions in 23120ms
Found 39 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 39 transitions
Dead transitions reduction (with SMT) removed 39 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 158/161 places, 82/122 transitions.
Graph (complete) has 352 edges and 158 vertex of which 121 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.4 ms
Discarding 37 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 121 /158 variables (removed 37) and now considering 82/82 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 121/161 places, 82/122 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 23169 ms. Remains : 121/161 places, 82/122 transitions.
Built C files in :
/tmp/ltsmin18066243401556902969
[2025-06-05 11:14:09] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18066243401556902969
Running compilation step : cd /tmp/ltsmin18066243401556902969;'/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 322 ms.
Running link step : cd /tmp/ltsmin18066243401556902969;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin18066243401556902969;'/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/stateBased10869558344702265783.hoa' '--buchi-type=spotba'
LTSmin run took 280 ms.
FORMULA ProductionCell-PT-none-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ProductionCell-PT-none-LTLFireability-06 finished in 65722 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0||G(p1)))))))'
Support contains 3 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 134/134 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 170 transition count 132
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 170 transition count 132
Applied a total of 4 rules in 5 ms. Remains 170 /172 variables (removed 2) and now considering 132/134 (removed 2) transitions.
// Phase 1: matrix 132 rows 170 cols
[2025-06-05 11:14:10] [INFO ] Computed 46 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:14:10] [INFO ] Implicit Places using invariants in 90 ms returned [36, 130, 131, 135]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 106 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 166/172 places, 132/134 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 165 transition count 130
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 165 transition count 130
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 164 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 164 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 163 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 163 transition count 128
Applied a total of 6 rules in 8 ms. Remains 163 /166 variables (removed 3) and now considering 128/132 (removed 4) transitions.
// Phase 1: matrix 128 rows 163 cols
[2025-06-05 11:14:10] [INFO ] Computed 42 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:14:10] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-05 11:14:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:14:10] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 163/172 places, 128/134 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 373 ms. Remains : 163/172 places, 128/134 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ProductionCell-PT-none-LTLFireability-10
Product exploration explored 100000 steps with 5476 reset in 159 ms.
Product exploration explored 100000 steps with 5502 reset in 183 ms.
Computed a total of 22 stabilizing places and 26 stable transitions
Computed a total of 22 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 63 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 2674 steps (0 resets) in 21 ms. (121 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 1 factoid took 168 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2025-06-05 11:14:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:14:11] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-05 11:14:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:14:12] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 127 sub problems to find dead transitions.
[2025-06-05 11:14:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 33/40 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:14:13] [INFO ] Deduced a trap composed of 17 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-05 11:14:13] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 5 ms to minimize.
Problem TDEAD42 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 2/44 constraints. Problems are: Problem set: 1 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:14:13] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:14:13] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:14:13] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:14:14] [INFO ] Deduced a trap composed of 8 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-05 11:14:14] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:14:14] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:14:14] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 3 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:14:14] [INFO ] Deduced a trap composed of 6 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-05 11:14:14] [INFO ] Deduced a trap composed of 19 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-05 11:14:14] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 4 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 10/54 constraints. Problems are: Problem set: 5 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:14:14] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 1/55 constraints. Problems are: Problem set: 5 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/55 constraints. Problems are: Problem set: 5 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 128/291 variables, 163/218 constraints. Problems are: Problem set: 5 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 0/218 constraints. Problems are: Problem set: 5 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:14:18] [INFO ] Deduced a trap along path composed of 5 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/291 variables, 1/219 constraints. Problems are: Problem set: 5 solved, 122 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/291 variables, 0/219 constraints. Problems are: Problem set: 5 solved, 122 unsolved
At refinement iteration 12 (OVERLAPS) 0/291 variables, 0/219 constraints. Problems are: Problem set: 5 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 219 constraints, problems are : Problem set: 5 solved, 122 unsolved in 9173 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 5 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 5 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 33/40 constraints. Problems are: Problem set: 5 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 2/42 constraints. Problems are: Problem set: 5 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 13/55 constraints. Problems are: Problem set: 5 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/55 constraints. Problems are: Problem set: 5 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 128/291 variables, 163/218 constraints. Problems are: Problem set: 5 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 122/340 constraints. Problems are: Problem set: 5 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 1/341 constraints. Problems are: Problem set: 5 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:14:27] [INFO ] Deduced a trap along path composed of 4 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 1/342 constraints. Problems are: Problem set: 5 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 0/342 constraints. Problems are: Problem set: 5 solved, 122 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 291/291 variables, and 342 constraints, problems are : Problem set: 5 solved, 122 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 122/127 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 39195ms problems are : Problem set: 5 solved, 122 unsolved
Search for dead transitions found 5 dead transitions in 39196ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in LTL mode, iteration 1 : 163/163 places, 123/128 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 162 transition count 123
Applied a total of 1 rules in 3 ms. Remains 162 /163 variables (removed 1) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 162 cols
[2025-06-05 11:14:51] [INFO ] Computed 42 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:14:51] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-05 11:14:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:14:51] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 162/163 places, 123/128 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39650 ms. Remains : 162/163 places, 123/128 transitions.
Computed a total of 21 stabilizing places and 21 stable transitions
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 58 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 2498 steps (0 resets) in 16 ms. (146 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 1 factoid took 162 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5489 reset in 170 ms.
Product exploration explored 100000 steps with 5506 reset in 183 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 123/123 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 162 transition count 123
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 27 Pre rules applied. Total rules applied 5 place count 162 transition count 125
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 32 place count 162 transition count 125
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 160 transition count 123
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 160 transition count 123
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 45 place count 160 transition count 123
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 159 transition count 122
Deduced a syphon composed of 38 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 159 transition count 122
Deduced a syphon composed of 38 places in 0 ms
Applied a total of 47 rules in 19 ms. Remains 159 /162 variables (removed 3) and now considering 122/123 (removed 1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:14:52] [INFO ] Redundant transitions in 2 ms returned []
Running 121 sub problems to find dead transitions.
// Phase 1: matrix 122 rows 159 cols
[2025-06-05 11:14:52] [INFO ] Computed 42 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/159 variables, 33/40 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:14:54] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Problem TDEAD33 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:14:54] [INFO ] Deduced a trap composed of 10 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-05 11:14:54] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 6 ms to minimize.
Problem TDEAD38 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:14:54] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 5 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:14:54] [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-05 11:14:54] [INFO ] Deduced a trap composed of 11 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-05 11:14:54] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 5 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD49 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:14:54] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Problem TDEAD50 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:14:54] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Problem TDEAD106 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 9/51 constraints. Problems are: Problem set: 23 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:14:54] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 4 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:14:54] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 4 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:14:54] [INFO ] Deduced a trap composed of 4 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-05 11:14:54] [INFO ] Deduced a trap composed of 5 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-05 11:14:55] [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-05 11:14:55] [INFO ] Deduced a trap composed of 5 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-05 11:14:55] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:14:55] [INFO ] Deduced a trap composed of 7 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-05 11:14:55] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 4 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:14:55] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 5 ms to minimize.
Problem TDEAD47 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:14:55] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:14:55] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 3 ms to minimize.
Problem TDEAD108 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 12/63 constraints. Problems are: Problem set: 36 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:14:55] [INFO ] Deduced a trap composed of 11 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-05 11:14:55] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 5 ms to minimize.
Problem TDEAD15 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 2/65 constraints. Problems are: Problem set: 37 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/65 constraints. Problems are: Problem set: 37 solved, 84 unsolved
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD25 is UNSAT
At refinement iteration 8 (OVERLAPS) 122/281 variables, 159/224 constraints. Problems are: Problem set: 40 solved, 81 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:14:56] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 1/225 constraints. Problems are: Problem set: 40 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 0/225 constraints. Problems are: Problem set: 40 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/281 variables, 0/225 constraints. Problems are: Problem set: 40 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 225 constraints, problems are : Problem set: 40 solved, 81 unsolved in 5510 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 40 solved, 81 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 40 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 30/150 variables, 33/33 constraints. Problems are: Problem set: 40 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 24/57 constraints. Problems are: Problem set: 40 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/57 constraints. Problems are: Problem set: 40 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 9/159 variables, 9/66 constraints. Problems are: Problem set: 40 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/66 constraints. Problems are: Problem set: 40 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 122/281 variables, 159/225 constraints. Problems are: Problem set: 40 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 81/306 constraints. Problems are: Problem set: 40 solved, 81 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:15:02] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 1/307 constraints. Problems are: Problem set: 40 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 0/307 constraints. Problems are: Problem set: 40 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 0/281 variables, 0/307 constraints. Problems are: Problem set: 40 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 307 constraints, problems are : Problem set: 40 solved, 81 unsolved in 18845 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 81/121 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 24374ms problems are : Problem set: 40 solved, 81 unsolved
Search for dead transitions found 40 dead transitions in 24375ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 159/162 places, 82/123 transitions.
Graph (complete) has 353 edges and 159 vertex of which 121 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.2 ms
Discarding 38 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 121 /159 variables (removed 38) and now considering 82/82 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 121/162 places, 82/123 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 24414 ms. Remains : 121/162 places, 82/123 transitions.
Built C files in :
/tmp/ltsmin9750194158908692125
[2025-06-05 11:15:17] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9750194158908692125
Running compilation step : cd /tmp/ltsmin9750194158908692125;'/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 223 ms.
Running link step : cd /tmp/ltsmin9750194158908692125;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin9750194158908692125;'/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/stateBased13314979029331603074.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 123/123 transitions.
Applied a total of 0 rules in 4 ms. Remains 162 /162 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 162 cols
[2025-06-05 11:15:32] [INFO ] Computed 42 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:15:32] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-05 11:15:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:15:32] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2025-06-05 11:15:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 33/40 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:15:34] [INFO ] Deduced a trap composed of 9 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-05 11:15:34] [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-05 11:15:34] [INFO ] Deduced a trap composed of 17 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-05 11:15:34] [INFO ] Deduced a trap composed of 6 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-05 11:15:34] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:15:34] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:15:34] [INFO ] Deduced a trap composed of 19 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-05 11:15:34] [INFO ] Deduced a trap composed of 17 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-05 11:15:34] [INFO ] Deduced a trap composed of 8 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-05 11:15:34] [INFO ] Deduced a trap composed of 20 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-05 11:15:34] [INFO ] Deduced a trap composed of 22 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-05 11:15:34] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:15:35] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 123/285 variables, 162/217 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/285 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 217 constraints, problems are : Problem set: 0 solved, 122 unsolved in 6290 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 33/40 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:15:39] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 123/285 variables, 162/218 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 122/340 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:15:43] [INFO ] Deduced a trap along path composed of 12 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:15:45] [INFO ] Deduced a trap along path composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (OVERLAPS) 0/285 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 342 constraints, problems are : Problem set: 0 solved, 122 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 36310ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 36311ms
Finished structural reductions in LTL mode , in 1 iterations and 36523 ms. Remains : 162/162 places, 123/123 transitions.
Built C files in :
/tmp/ltsmin16624737481380452611
[2025-06-05 11:16:09] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16624737481380452611
Running compilation step : cd /tmp/ltsmin16624737481380452611;'/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 343 ms.
Running link step : cd /tmp/ltsmin16624737481380452611;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16624737481380452611;'/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/stateBased10680031952797919680.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 11:16:24] [INFO ] Flatten gal took : 9 ms
[2025-06-05 11:16:24] [INFO ] Flatten gal took : 9 ms
[2025-06-05 11:16:24] [INFO ] Time to serialize gal into /tmp/LTL18249420673144847861.gal : 3 ms
[2025-06-05 11:16:24] [INFO ] Time to serialize properties into /tmp/LTL18335715732374620200.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18249420673144847861.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3497118517998970354.hoa' '-atoms' '/tmp/LTL18335715732374620200.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL18335715732374620200.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3497118517998970354.hoa
Reverse transition relation is NOT exact ! Due to transitions t15, t27, t28, t30, t38, t43, t46, t52, t59, t85, t121, t128, Intersection with reachable at...224
Detected timeout of ITS tools.
[2025-06-05 11:16:39] [INFO ] Flatten gal took : 8 ms
[2025-06-05 11:16:39] [INFO ] Flatten gal took : 8 ms
[2025-06-05 11:16:39] [INFO ] Time to serialize gal into /tmp/LTL2163395478707265649.gal : 2 ms
[2025-06-05 11:16:39] [INFO ] Time to serialize properties into /tmp/LTL13197280907373547155.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2163395478707265649.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13197280907373547155.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F((G("(p71==0)"))||("((p55==1)&&(p65==1))")))))))
Formula 0 simplified : XXXG(!"((p55==1)&&(p65==1))" & F!"(p71==0)")
Reverse transition relation is NOT exact ! Due to transitions t15, t27, t28, t30, t38, t43, t46, t52, t59, t85, t121, t128, Intersection with reachable at...224
Detected timeout of ITS tools.
[2025-06-05 11:16:54] [INFO ] Flatten gal took : 7 ms
[2025-06-05 11:16:54] [INFO ] Applying decomposition
[2025-06-05 11:16:54] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4864987501330998616.txt' '-o' '/tmp/graph4864987501330998616.bin' '-w' '/tmp/graph4864987501330998616.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4864987501330998616.bin' '-l' '-1' '-v' '-w' '/tmp/graph4864987501330998616.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:16:54] [INFO ] Decomposing Gal with order
[2025-06-05 11:16:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:16:54] [INFO ] Removed a total of 47 redundant transitions.
[2025-06-05 11:16:54] [INFO ] Flatten gal took : 41 ms
[2025-06-05 11:16:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-05 11:16:54] [INFO ] Time to serialize gal into /tmp/LTL8599682513658920642.gal : 4 ms
[2025-06-05 11:16:54] [INFO ] Time to serialize properties into /tmp/LTL14018657245934527849.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8599682513658920642.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14018657245934527849.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F((G("(i7.i1.u22.p71==0)"))||("((i13.u17.p55==1)&&(i13.u17.p65==1))")))))))
Formula 0 simplified : XXXG(!"((i13.u17.p55==1)&&(i13.u17.p65==1))" & F!"(i7.i1.u22.p71==0)")
Reverse transition relation is NOT exact ! Due to transitions t15, t121, i1.t46, i1.u4.t43, i1.u4.t52, i2.u6.t38, i5.u15.t59, i5.u36.t85, i7.i0.t128, i9.i0...287
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
36 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.378035,30448,1,0,40677,435,2292,35438,299,1366,71732
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ProductionCell-PT-none-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ProductionCell-PT-none-LTLFireability-10 finished in 164729 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((p1&&F(p2)))))))'
Support contains 3 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 134/134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 169 transition count 131
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 169 transition count 131
Applied a total of 6 rules in 4 ms. Remains 169 /172 variables (removed 3) and now considering 131/134 (removed 3) transitions.
// Phase 1: matrix 131 rows 169 cols
[2025-06-05 11:16:55] [INFO ] Computed 46 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:16:55] [INFO ] Implicit Places using invariants in 90 ms returned [36, 129, 130, 134]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 91 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 165/172 places, 131/134 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 164 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 164 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 163 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 163 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 162 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 162 transition count 127
Applied a total of 6 rules in 4 ms. Remains 162 /165 variables (removed 3) and now considering 127/131 (removed 4) transitions.
// Phase 1: matrix 127 rows 162 cols
[2025-06-05 11:16:55] [INFO ] Computed 42 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:16:55] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-05 11:16:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:16:55] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 162/172 places, 127/134 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 351 ms. Remains : 162/172 places, 127/134 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true]
Running random walk in product with property : ProductionCell-PT-none-LTLFireability-11
Product exploration explored 100000 steps with 25000 reset in 131 ms.
Product exploration explored 100000 steps with 25000 reset in 153 ms.
Computed a total of 21 stabilizing places and 25 stable transitions
Computed a total of 21 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true]
RANDOM walk for 4860 steps (0 resets) in 21 ms. (220 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2))), (F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true]
Stuttering acceptance computed with spot in 201 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true]
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 127/127 transitions.
Applied a total of 0 rules in 4 ms. Remains 162 /162 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2025-06-05 11:16:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:16:56] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-05 11:16:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:16:57] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2025-06-05 11:16:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 33/40 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:16:58] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:16:58] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:16:58] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:16:58] [INFO ] Deduced a trap composed of 20 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-05 11:16:58] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 5 ms to minimize.
Problem TDEAD41 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 5/47 constraints. Problems are: Problem set: 1 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:16:59] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:16:59] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:16:59] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:16:59] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 3 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:16:59] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 3 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 5/52 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/52 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 127/289 variables, 162/214 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/214 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 0/289 variables, 0/214 constraints. Problems are: Problem set: 5 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 214 constraints, problems are : Problem set: 5 solved, 121 unsolved in 6223 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 121 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 7/7 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 33/40 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 2/42 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 10/52 constraints. Problems are: Problem set: 5 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:17:03] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:17:03] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 2/54 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/54 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 127/289 variables, 162/216 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 121/337 constraints. Problems are: Problem set: 5 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:17:07] [INFO ] Deduced a trap along path composed of 4 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:17:07] [INFO ] Deduced a trap along path composed of 5 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 2/339 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/339 constraints. Problems are: Problem set: 5 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/289 variables, 0/339 constraints. Problems are: Problem set: 5 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 339 constraints, problems are : Problem set: 5 solved, 121 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 121/126 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 36249ms problems are : Problem set: 5 solved, 121 unsolved
Search for dead transitions found 5 dead transitions in 36249ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in LTL mode, iteration 1 : 162/162 places, 122/127 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 161 transition count 122
Applied a total of 1 rules in 2 ms. Remains 161 /162 variables (removed 1) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 161 cols
[2025-06-05 11:17:33] [INFO ] Computed 42 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:17:33] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-06-05 11:17:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:17:33] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 161/162 places, 122/127 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36744 ms. Remains : 161/162 places, 122/127 transitions.
Computed a total of 20 stabilizing places and 20 stable transitions
Computed a total of 20 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p2 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 67 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true]
RANDOM walk for 5249 steps (0 resets) in 20 ms. (249 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p2 p1)]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2))), (F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 1 factoid took 143 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true]
Stuttering acceptance computed with spot in 184 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true]
Stuttering acceptance computed with spot in 201 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true]
Product exploration explored 100000 steps with 25000 reset in 128 ms.
Product exploration explored 100000 steps with 25000 reset in 139 ms.
Applying partial POR strategy [true, true, false, false, false, true]
Stuttering acceptance computed with spot in 181 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true]
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 122/122 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 161 transition count 122
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 26 Pre rules applied. Total rules applied 5 place count 161 transition count 124
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 31 place count 161 transition count 124
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 159 transition count 122
Deduced a syphon composed of 29 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 159 transition count 122
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 46 place count 159 transition count 122
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 158 transition count 121
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 158 transition count 121
Deduced a syphon composed of 39 places in 0 ms
Applied a total of 48 rules in 15 ms. Remains 158 /161 variables (removed 3) and now considering 121/122 (removed 1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:17:35] [INFO ] Redundant transitions in 3 ms returned []
Running 120 sub problems to find dead transitions.
// Phase 1: matrix 121 rows 158 cols
[2025-06-05 11:17:35] [INFO ] Computed 42 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 33/40 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:17:36] [INFO ] Deduced a trap composed of 10 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-05 11:17:36] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:17:36] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 5 ms to minimize.
Problem TDEAD39 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:17:36] [INFO ] Deduced a trap composed of 11 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-05 11:17:36] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 4 ms to minimize.
Problem TDEAD44 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:17:36] [INFO ] Deduced a trap composed of 3 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-05 11:17:36] [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-05 11:17:36] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 4 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD110 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 8/50 constraints. Problems are: Problem set: 14 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:17:36] [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-05 11:17:36] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 4 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:17:37] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:17:37] [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-05 11:17:37] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:17:37] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 4 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:17:37] [INFO ] Deduced a trap composed of 3 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-05 11:17:37] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 5 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:17:37] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 3 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:17:37] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 4 ms to minimize.
Problem TDEAD47 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:17:37] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:17:37] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 2 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD17 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 12/62 constraints. Problems are: Problem set: 35 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:17:37] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 4 ms to minimize.
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:17:37] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:17:37] [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-05 11:17:37] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 3 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:17:37] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 4 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD22 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 5/67 constraints. Problems are: Problem set: 41 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/67 constraints. Problems are: Problem set: 41 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 121/279 variables, 158/225 constraints. Problems are: Problem set: 41 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 0/225 constraints. Problems are: Problem set: 41 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/279 variables, 0/225 constraints. Problems are: Problem set: 41 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 225 constraints, problems are : Problem set: 41 solved, 79 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 41 solved, 79 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 41 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 32/150 variables, 33/33 constraints. Problems are: Problem set: 41 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 1/34 constraints. Problems are: Problem set: 41 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 25/59 constraints. Problems are: Problem set: 41 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:17:40] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 1/60 constraints. Problems are: Problem set: 41 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/60 constraints. Problems are: Problem set: 41 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 8/158 variables, 8/68 constraints. Problems are: Problem set: 41 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/68 constraints. Problems are: Problem set: 41 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 121/279 variables, 158/226 constraints. Problems are: Problem set: 41 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 79/305 constraints. Problems are: Problem set: 41 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:17:44] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 1/306 constraints. Problems are: Problem set: 41 solved, 79 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/279 variables, 0/306 constraints. Problems are: Problem set: 41 solved, 79 unsolved
At refinement iteration 12 (OVERLAPS) 0/279 variables, 0/306 constraints. Problems are: Problem set: 41 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 306 constraints, problems are : Problem set: 41 solved, 79 unsolved in 16711 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 79/120 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 21745ms problems are : Problem set: 41 solved, 79 unsolved
Search for dead transitions found 41 dead transitions in 21745ms
Found 41 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 41 transitions
Dead transitions reduction (with SMT) removed 41 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 158/161 places, 80/122 transitions.
Graph (complete) has 350 edges and 158 vertex of which 119 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.3 ms
Discarding 39 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 119 /158 variables (removed 39) and now considering 80/80 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 119/161 places, 80/122 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21778 ms. Remains : 119/161 places, 80/122 transitions.
Built C files in :
/tmp/ltsmin2739386080047835172
[2025-06-05 11:17:56] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2739386080047835172
Running compilation step : cd /tmp/ltsmin2739386080047835172;'/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 234 ms.
Running link step : cd /tmp/ltsmin2739386080047835172;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2739386080047835172;'/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/stateBased11784675549287281476.hoa' '--buchi-type=spotba'
LTSmin run took 2865 ms.
FORMULA ProductionCell-PT-none-LTLFireability-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ProductionCell-PT-none-LTLFireability-11 finished in 64943 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))||G(p1)))'
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 134/134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 169 transition count 131
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 169 transition count 131
Applied a total of 6 rules in 2 ms. Remains 169 /172 variables (removed 3) and now considering 131/134 (removed 3) transitions.
// Phase 1: matrix 131 rows 169 cols
[2025-06-05 11:18:00] [INFO ] Computed 46 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:18:00] [INFO ] Implicit Places using invariants in 79 ms returned [36, 129, 130, 134]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 80 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 165/172 places, 131/134 transitions.
Applied a total of 0 rules in 1 ms. Remains 165 /165 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 83 ms. Remains : 165/172 places, 131/134 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ProductionCell-PT-none-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 170 ms.
Product exploration explored 100000 steps with 50000 reset in 166 ms.
Computed a total of 24 stabilizing places and 29 stable transitions
Computed a total of 24 stabilizing places and 29 stable transitions
Detected a total of 24/165 stabilizing places and 29/131 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 15 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ProductionCell-PT-none-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ProductionCell-PT-none-LTLFireability-12 finished in 551 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 p1)||X(p2))))'
Support contains 5 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 134/134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 169 transition count 131
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 169 transition count 131
Applied a total of 6 rules in 6 ms. Remains 169 /172 variables (removed 3) and now considering 131/134 (removed 3) transitions.
[2025-06-05 11:18:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:18:00] [INFO ] Implicit Places using invariants in 81 ms returned [36, 129, 130]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 83 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 166/172 places, 131/134 transitions.
Applied a total of 0 rules in 1 ms. Remains 166 /166 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 166/172 places, 131/134 transitions.
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : ProductionCell-PT-none-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ProductionCell-PT-none-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ProductionCell-PT-none-LTLFireability-13 finished in 273 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)))'
Support contains 1 out of 172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 172/172 places, 134/134 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 172 transition count 131
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 169 transition count 131
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 6 place count 169 transition count 100
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 68 place count 138 transition count 100
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 136 transition count 98
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 136 transition count 98
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 84 place count 130 transition count 92
Applied a total of 84 rules in 12 ms. Remains 130 /172 variables (removed 42) and now considering 92/134 (removed 42) transitions.
// Phase 1: matrix 92 rows 130 cols
[2025-06-05 11:18:00] [INFO ] Computed 46 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:18:00] [INFO ] Implicit Places using invariants in 73 ms returned [20, 21, 27, 71, 72, 73, 74, 93, 94, 97]
[2025-06-05 11:18:00] [INFO ] Actually due to overlaps returned [71, 74, 97, 20, 21, 27, 72, 73, 93]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 74 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/172 places, 92/134 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 120 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 120 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 119 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 119 transition count 89
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 116 transition count 86
Applied a total of 10 rules in 7 ms. Remains 116 /121 variables (removed 5) and now considering 86/92 (removed 6) transitions.
// Phase 1: matrix 86 rows 116 cols
[2025-06-05 11:18:00] [INFO ] Computed 37 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:18:00] [INFO ] Implicit Places using invariants in 69 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 115/172 places, 86/134 transitions.
Applied a total of 0 rules in 3 ms. Remains 115 /115 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 166 ms. Remains : 115/172 places, 86/134 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : ProductionCell-PT-none-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 151 ms.
Stack based approach found an accepted trace after 233 steps with 0 reset with depth 234 and stack size 234 in 0 ms.
FORMULA ProductionCell-PT-none-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ProductionCell-PT-none-LTLFireability-14 finished in 358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p1||X(p2)))||p0)))'
Support contains 13 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 134/134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 169 transition count 131
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 169 transition count 131
Applied a total of 6 rules in 6 ms. Remains 169 /172 variables (removed 3) and now considering 131/134 (removed 3) transitions.
// Phase 1: matrix 131 rows 169 cols
[2025-06-05 11:18:01] [INFO ] Computed 46 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:18:01] [INFO ] Implicit Places using invariants in 82 ms returned [36, 129, 130, 134]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 83 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 165/172 places, 131/134 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 164 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 164 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 163 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 163 transition count 128
Applied a total of 4 rules in 3 ms. Remains 163 /165 variables (removed 2) and now considering 128/131 (removed 3) transitions.
// Phase 1: matrix 128 rows 163 cols
[2025-06-05 11:18:01] [INFO ] Computed 42 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:18:01] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-05 11:18:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:18:01] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 163/172 places, 128/134 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 304 ms. Remains : 163/172 places, 128/134 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ProductionCell-PT-none-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 175 ms.
Product exploration explored 100000 steps with 50000 reset in 164 ms.
Computed a total of 22 stabilizing places and 26 stable transitions
Computed a total of 22 stabilizing places and 26 stable transitions
Detected a total of 22/163 stabilizing places and 26/128 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 17 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ProductionCell-PT-none-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ProductionCell-PT-none-LTLFireability-15 finished in 839 ms.
All properties solved by simple procedures.
Total runtime 347163 ms.

BK_STOP 1749122282051

--------------------
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="ProductionCell-PT-none"
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 ProductionCell-PT-none, 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 r156-tall-174881254500716"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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