Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 174K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-00
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-01
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-02
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-03
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-04
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-05
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-06
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-07
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-08
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-09
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-10
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-11
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-12
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-13
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-14
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748880994668

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-5
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-02 16:16:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 16:16:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 16:16:36] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2025-06-02 16:16:36] [INFO ] Transformed 231 places.
[2025-06-02 16:16:36] [INFO ] Transformed 202 transitions.
[2025-06-02 16:16:36] [INFO ] Found NUPN structural information;
[2025-06-02 16:16:36] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 175 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA ParamProductionCell-PT-5-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA ParamProductionCell-PT-5-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 227 transition count 198
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 227 transition count 198
Applied a total of 8 rules in 35 ms. Remains 227 /231 variables (removed 4) and now considering 198/202 (removed 4) transitions.
// Phase 1: matrix 198 rows 227 cols
[2025-06-02 16:16:36] [INFO ] Computed 59 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:16:36] [INFO ] Implicit Places using invariants in 414 ms returned [15, 16, 19, 24, 31, 35, 36, 41, 42, 46, 47, 59, 64, 73, 78, 98, 99, 101, 113, 114, 116, 119, 160, 161, 163, 165, 166, 192, 193, 196, 197, 202, 203, 207, 218]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 446 ms to find 35 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 192/231 places, 198/202 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 191 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 191 transition count 197
Applied a total of 2 rules in 18 ms. Remains 191 /192 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 191 cols
[2025-06-02 16:16:36] [INFO ] Computed 24 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:16:36] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-02 16:16:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:16:36] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 16:16:37] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 191/231 places, 197/202 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1033 ms. Remains : 191/231 places, 197/202 transitions.
Support contains 20 out of 191 places after structural reductions.
[2025-06-02 16:16:37] [INFO ] Flatten gal took : 42 ms
[2025-06-02 16:16:37] [INFO ] Flatten gal took : 15 ms
[2025-06-02 16:16:37] [INFO ] Input system was already deterministic with 197 transitions.
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 34191 steps (7 resets) in 857 ms. (39 steps per ms) remains 0/12 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 191 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 191/191 places, 197/197 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 191 transition count 171
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 165 transition count 171
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 52 place count 165 transition count 151
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 92 place count 145 transition count 151
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 95 place count 142 transition count 148
Iterating global reduction 2 with 3 rules applied. Total rules applied 98 place count 142 transition count 148
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 186 place count 98 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 188 place count 97 transition count 103
Applied a total of 188 rules in 41 ms. Remains 97 /191 variables (removed 94) and now considering 103/197 (removed 94) transitions.
// Phase 1: matrix 103 rows 97 cols
[2025-06-02 16:16:38] [INFO ] Computed 24 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:16:38] [INFO ] Implicit Places using invariants in 67 ms returned [8, 30, 37, 53]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 68 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/191 places, 103/197 transitions.
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 0 with 10 rules applied. Total rules applied 10 place count 88 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 87 transition count 97
Applied a total of 12 rules in 7 ms. Remains 87 /93 variables (removed 6) and now considering 97/103 (removed 6) transitions.
// Phase 1: matrix 97 rows 87 cols
[2025-06-02 16:16:38] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:16:38] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-02 16:16:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:16:38] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-02 16:16:38] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/191 places, 97/197 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 349 ms. Remains : 87/191 places, 97/197 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-03
Product exploration explored 100000 steps with 835 reset in 349 ms.
Product exploration explored 100000 steps with 859 reset in 178 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 98 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 459 ms. (86 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
[2025-06-02 16:16:39] [INFO ] Invariant cache hit.
[2025-06-02 16:16:39] [INFO ] State equation strengthened by 66 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 37/184 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 4/18 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/87 constraints, ReadFeed: 0/66 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 197 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 87 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 97/97 transitions.
Applied a total of 0 rules in 6 ms. Remains 87 /87 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2025-06-02 16:16:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:16:39] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-02 16:16:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:16:39] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-02 16:16:40] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:16:40] [INFO ] Redundant transitions in 2 ms returned []
Running 94 sub problems to find dead transitions.
[2025-06-02 16:16:40] [INFO ] Invariant cache hit.
[2025-06-02 16:16:40] [INFO ] State equation strengthened by 66 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:40] [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-02 16:16:40] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:40] [INFO ] Deduced a trap composed of 4 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-02 16:16:40] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:40] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:40] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:40] [INFO ] Deduced a trap composed of 18 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-02 16:16:40] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:40] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:40] [INFO ] Deduced a trap composed of 15 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-02 16:16:40] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:40] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:40] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:40] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:41] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:41] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:41] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:41] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:41] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:41] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:41] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:41] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:41] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:41] [INFO ] Deduced a trap composed of 11 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-02 16:16:41] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:41] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:41] [INFO ] Deduced a trap composed of 19 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-02 16:16:41] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:41] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:41] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:41] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:42] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:42] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:42] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 1/86 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:43] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:43] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:43] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:43] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:43] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (OVERLAPS) 1/87 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:44] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:44] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/87 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/87 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (OVERLAPS) 97/184 variables, 87/148 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/184 variables, 66/214 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/184 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 16 (OVERLAPS) 0/184 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 214 constraints, problems are : Problem set: 0 solved, 94 unsolved in 6708 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 39/57 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 1/86 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 1/87 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:47] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:47] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (OVERLAPS) 97/184 variables, 87/150 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 66/216 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 94/310 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/184 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 14 (OVERLAPS) 0/184 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 310 constraints, problems are : Problem set: 0 solved, 94 unsolved in 5234 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11979ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 11986ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12234 ms. Remains : 87/87 places, 97/97 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 286 steps (0 resets) in 5 ms. (47 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 863 reset in 117 ms.
Product exploration explored 100000 steps with 869 reset in 131 ms.
Built C files in :
/tmp/ltsmin11196229863015594181
[2025-06-02 16:16:52] [INFO ] Computing symmetric may disable matrix : 97 transitions.
[2025-06-02 16:16:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:16:52] [INFO ] Computing symmetric may enable matrix : 97 transitions.
[2025-06-02 16:16:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:16:52] [INFO ] Computing Do-Not-Accords matrix : 97 transitions.
[2025-06-02 16:16:52] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:16:52] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11196229863015594181
Running compilation step : cd /tmp/ltsmin11196229863015594181;'/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 357 ms.
Running link step : cd /tmp/ltsmin11196229863015594181;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin11196229863015594181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6828675047117881221.hoa' '--buchi-type=spotba'
LTSmin run took 657 ms.
FORMULA ParamProductionCell-PT-5-LTLCardinality-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-5-LTLCardinality-03 finished in 16044 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 197/197 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 188 transition count 194
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 188 transition count 194
Applied a total of 6 rules in 11 ms. Remains 188 /191 variables (removed 3) and now considering 194/197 (removed 3) transitions.
// Phase 1: matrix 194 rows 188 cols
[2025-06-02 16:16:53] [INFO ] Computed 24 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:16:54] [INFO ] Implicit Places using invariants in 96 ms returned [16, 64, 96]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 97 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/191 places, 194/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110 ms. Remains : 185/191 places, 194/197 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 40 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-5-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLCardinality-10 finished in 238 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(((X(G((p2||G(p3))))&&p1)||p0)))'
Support contains 6 out of 191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 197/197 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 188 transition count 194
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 188 transition count 194
Applied a total of 6 rules in 7 ms. Remains 188 /191 variables (removed 3) and now considering 194/197 (removed 3) transitions.
[2025-06-02 16:16:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:16:54] [INFO ] Implicit Places using invariants in 86 ms returned [16, 52, 96]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 87 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/191 places, 194/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 185/191 places, 194/197 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (OR (NOT p3) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-5-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLCardinality-11 finished in 265 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 !p1)||X(G(p2))))'
Support contains 6 out of 191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 197/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 189 transition count 195
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 189 transition count 195
Applied a total of 4 rules in 7 ms. Remains 189 /191 variables (removed 2) and now considering 195/197 (removed 2) transitions.
// Phase 1: matrix 195 rows 189 cols
[2025-06-02 16:16:54] [INFO ] Computed 24 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:16:54] [INFO ] Implicit Places using invariants in 103 ms returned [52, 64]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 104 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/191 places, 195/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 187 /187 variables (removed 0) and now considering 195/195 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 113 ms. Remains : 187/191 places, 195/197 transitions.
Stuttering acceptance computed with spot in 223 ms :[(AND p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND p1 (NOT p2)), (NOT p0), p1]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-13
Product exploration explored 100000 steps with 755 reset in 164 ms.
Stack based approach found an accepted trace after 598 steps with 1 reset with depth 303 and stack size 303 in 2 ms.
FORMULA ParamProductionCell-PT-5-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLCardinality-13 finished in 521 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 U !p2)||(!p2 U p3))))'
Support contains 5 out of 191 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 191/191 places, 197/197 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 191 transition count 172
Reduce places removed 25 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 52 place count 166 transition count 170
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 54 place count 164 transition count 170
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 54 place count 164 transition count 152
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 90 place count 146 transition count 152
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 91 place count 145 transition count 151
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 145 transition count 151
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 184 place count 99 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 186 place count 98 transition count 104
Applied a total of 186 rules in 17 ms. Remains 98 /191 variables (removed 93) and now considering 104/197 (removed 93) transitions.
// Phase 1: matrix 104 rows 98 cols
[2025-06-02 16:16:55] [INFO ] Computed 24 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:16:55] [INFO ] Implicit Places using invariants in 69 ms returned [8, 30, 38, 55]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 70 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/191 places, 104/197 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 90 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 89 transition count 99
Applied a total of 10 rules in 5 ms. Remains 89 /94 variables (removed 5) and now considering 99/104 (removed 5) transitions.
// Phase 1: matrix 99 rows 89 cols
[2025-06-02 16:16:55] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:16:55] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-02 16:16:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:16:55] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-02 16:16:55] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 89/191 places, 99/197 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 312 ms. Remains : 89/191 places, 99/197 transitions.
Stuttering acceptance computed with spot in 167 ms :[(AND p2 (NOT p3)), true, (NOT p0), p2, (AND (NOT p0) p2)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-15
Product exploration explored 100000 steps with 1720 reset in 176 ms.
Product exploration explored 100000 steps with 1757 reset in 222 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p3) p0 p1), (X p2), (X (NOT (AND p2 p1 (NOT p3) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p3) p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (AND p2 p1 p0)), (X (AND p2 p1)), (X (NOT (AND p2 (NOT p1) (NOT p3) (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p2 p1 (NOT p3) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3) p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (AND p2 p1 p0))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 (NOT p1) (NOT p3) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND p2 (NOT p3) p0)), (X (NOT (AND p2 (NOT p3) p0))), (X (AND p2 p1 (NOT p3) p0)), (X (NOT (AND p2 p1 (NOT p3) p0))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p2 (NOT p3) p0))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (AND p2 p1 (NOT p3) p0))), (X (X (NOT (AND p2 p1 (NOT p3) p0))))]
Knowledge based reduction with 25 factoid took 435 ms. Reduced automaton from 5 states, 14 edges and 4 AP (stutter insensitive) to 5 states, 14 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND p2 (NOT p3)), true, (NOT p0), p2, (AND (NOT p0) p2)]
Reduction of identical properties reduced properties to check from 15 to 11
RANDOM walk for 40000 steps (8 resets) in 294 ms. (135 steps per ms) remains 2/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
[2025-06-02 16:16:56] [INFO ] Invariant cache hit.
[2025-06-02 16:16:56] [INFO ] State equation strengthened by 66 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf4 is UNSAT
Problem apf9 is UNSAT
After SMT solving in domain Real declared 5/188 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/89 constraints, ReadFeed: 0/66 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p3) p0 p1), (X p2), (X (NOT (AND p2 p1 (NOT p3) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p3) p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (AND p2 p1 p0)), (X (AND p2 p1)), (X (NOT (AND p2 (NOT p1) (NOT p3) (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p2 p1 (NOT p3) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3) p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (AND p2 p1 p0))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 (NOT p1) (NOT p3) (NOT p0))))), (X (X p0)), (X (X p1)), (G (OR p0 (NOT p1) (NOT p2) p3)), (G (OR p0 p1 (NOT p2))), (G (OR p0 p1 (NOT p2) p3)), (G (OR p0 (NOT p1) (NOT p2)))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND p2 (NOT p3) p0)), (X (NOT (AND p2 (NOT p3) p0))), (X (AND p2 p1 (NOT p3) p0)), (X (NOT (AND p2 p1 (NOT p3) p0))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p2 (NOT p3) p0))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (AND p2 p1 (NOT p3) p0))), (X (X (NOT (AND p2 p1 (NOT p3) p0)))), (F (NOT (OR (NOT p0) p1 (NOT p2) p3))), (F (NOT (OR p1 (NOT p2)))), (F (NOT p1)), (F (NOT (AND p0 p1 p2))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT p2)), (F (NOT (AND p0 p2 (NOT p3)))), (F p3), (F (NOT (AND p1 p2))), (F (NOT (AND p0 p1 p2 (NOT p3))))]
Knowledge based reduction with 29 factoid took 929 ms. Reduced automaton from 5 states, 14 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND p2 (NOT p3)), true, (NOT p0), (AND (NOT p0) p2 (NOT p1))]
Stuttering acceptance computed with spot in 126 ms :[(AND p2 (NOT p3)), true, (NOT p0), (AND (NOT p0) p2 (NOT p1))]
[2025-06-02 16:16:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 16:16:58] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2025-06-02 16:16:58] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 6 ms returned sat
[2025-06-02 16:16:58] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2025-06-02 16:16:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 16:16:58] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2025-06-02 16:16:58] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-02 16:16:58] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2025-06-02 16:16:58] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-02 16:16:58] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:58] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:58] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:58] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:58] [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-02 16:16:58] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:58] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:58] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:58] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:58] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:58] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:58] [INFO ] Deduced a trap composed of 16 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-02 16:16:58] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:59] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:59] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:59] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 4 ms to minimize.
[2025-06-02 16:16:59] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 792 ms
[2025-06-02 16:16:59] [INFO ] Computed and/alt/rep : 96/220/96 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 16:16:59] [INFO ] Added : 75 causal constraints over 15 iterations in 201 ms. Result :sat
Could not prove EG (AND p2 (NOT p3))
Support contains 5 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 89 /89 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2025-06-02 16:16:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:16:59] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-02 16:16:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:16:59] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-02 16:16:59] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:16:59] [INFO ] Redundant transitions in 3 ms returned []
Running 96 sub problems to find dead transitions.
[2025-06-02 16:16:59] [INFO ] Invariant cache hit.
[2025-06-02 16:16:59] [INFO ] State equation strengthened by 66 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:59] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:59] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:59] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:59] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:00] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:00] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:00] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:00] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:00] [INFO ] Deduced a trap composed of 12 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-02 16:17:00] [INFO ] Deduced a trap composed of 20 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-02 16:17:00] [INFO ] Deduced a trap composed of 5 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-02 16:17:00] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:00] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:00] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:00] [INFO ] Deduced a trap composed of 4 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-02 16:17:00] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:00] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:00] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:00] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:00] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:00] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:00] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:00] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:00] [INFO ] Deduced a trap composed of 12 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-02 16:17:00] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:00] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:01] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:01] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:01] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:01] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:01] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:01] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:01] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 2/89 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:02] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:02] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:02] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:02] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:02] [INFO ] Deduced a trap composed of 6 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-02 16:17:02] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 99/188 variables, 89/149 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 66/215 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:05] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/188 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/188 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 15 (OVERLAPS) 0/188 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 216 constraints, problems are : Problem set: 0 solved, 96 unsolved in 7780 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 39/57 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 2/89 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:07] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 99/188 variables, 89/151 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 66/217 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 96/313 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (OVERLAPS) 0/188 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 313 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4869 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12667ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 12668ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12899 ms. Remains : 89/89 places, 99/99 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p3) p1), (X p2), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p1 p2)), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(X (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3)))), (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))))), (X p3), (X (NOT p3)), (X (AND p1 p2 (NOT p3))), (X (NOT (AND p1 p2 (NOT p3)))), (X (X (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))))), (X (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3)))))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p1 p2 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3)))))]
Knowledge based reduction with 17 factoid took 498 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND p2 (NOT p3)), true, (NOT p0), (AND (NOT p0) p2 (NOT p1))]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (8 resets) in 112 ms. (353 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
[2025-06-02 16:17:12] [INFO ] Invariant cache hit.
[2025-06-02 16:17:12] [INFO ] State equation strengthened by 66 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf6 is UNSAT
After SMT solving in domain Real declared 5/188 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/89 constraints, ReadFeed: 0/66 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 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 (NOT p3) p1), (X p2), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p1 p2)), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X p0)), (X (X p1)), (G (OR p0 p1 (NOT p2))), (G (OR p0 p1 (NOT p2) p3))]
False Knowledge obtained : [(X (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3)))), (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))))), (X p3), (X (NOT p3)), (X (AND p1 p2 (NOT p3))), (X (NOT (AND p1 p2 (NOT p3)))), (X (X (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))))), (X (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3)))))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p1 p2 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (F (NOT (OR (NOT p0) p1 (NOT p2) p3))), (F p3), (F (NOT (AND p1 p2 (NOT p3)))), (F (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT p2)), (F (NOT p1)), (F (NOT (AND p1 p2))), (F (NOT p0))]
Knowledge based reduction with 19 factoid took 770 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND p2 (NOT p3)), true, (NOT p0), (AND (NOT p0) p2 (NOT p1))]
Stuttering acceptance computed with spot in 146 ms :[(AND p2 (NOT p3)), true, (NOT p0), (AND (NOT p0) p2 (NOT p1))]
[2025-06-02 16:17:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 16:17:14] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2025-06-02 16:17:14] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-02 16:17:14] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2025-06-02 16:17:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 16:17:14] [INFO ] [Nat]Absence check using 18 positive place invariants in 5 ms returned sat
[2025-06-02 16:17:14] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-02 16:17:14] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2025-06-02 16:17:14] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-02 16:17:14] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:14] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:14] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:14] [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-02 16:17:14] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:14] [INFO ] Deduced a trap composed of 4 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-02 16:17:14] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:14] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:14] [INFO ] Deduced a trap composed of 16 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-02 16:17:14] [INFO ] Deduced a trap composed of 5 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-02 16:17:14] [INFO ] Deduced a trap composed of 11 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-02 16:17:14] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:14] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:14] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:15] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:15] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 4 ms to minimize.
[2025-06-02 16:17:15] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 738 ms
[2025-06-02 16:17:15] [INFO ] Computed and/alt/rep : 96/220/96 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 16:17:15] [INFO ] Added : 75 causal constraints over 15 iterations in 182 ms. Result :sat
Could not prove EG (AND p2 (NOT p3))
Stuttering acceptance computed with spot in 139 ms :[(AND p2 (NOT p3)), true, (NOT p0), (AND (NOT p0) p2 (NOT p1))]
Product exploration explored 100000 steps with 1744 reset in 143 ms.
Product exploration explored 100000 steps with 1778 reset in 173 ms.
Built C files in :
/tmp/ltsmin10356653564660110068
[2025-06-02 16:17:15] [INFO ] Computing symmetric may disable matrix : 99 transitions.
[2025-06-02 16:17:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:17:15] [INFO ] Computing symmetric may enable matrix : 99 transitions.
[2025-06-02 16:17:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:17:15] [INFO ] Computing Do-Not-Accords matrix : 99 transitions.
[2025-06-02 16:17:15] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:17:15] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10356653564660110068
Running compilation step : cd /tmp/ltsmin10356653564660110068;'/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 214 ms.
Running link step : cd /tmp/ltsmin10356653564660110068;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin10356653564660110068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7741434795742762621.hoa' '--buchi-type=spotba'
LTSmin run took 359 ms.
FORMULA ParamProductionCell-PT-5-LTLCardinality-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-5-LTLCardinality-15 finished in 21369 ms.
All properties solved by simple procedures.
Total runtime 40449 ms.

BK_STOP 1748881036404

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ParamProductionCell-PT-5"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is ParamProductionCell-PT-5, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r142-tall-174876812500395"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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