Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r114-tall-174876422600387.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 IOTPpurchase-PT-C12M10P15D17, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876422600387
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K 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.0K 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 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K 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 13 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rwxr-xr-x 1 mcc users 60K 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 IOTPpurchase-PT-C12M10P15D17-LTLCardinality-00
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-01
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-02
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-03
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-04
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-05
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-06
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-07
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-08
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-09
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-10
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-11
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-12
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-13
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-14
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748836602341

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IOTPpurchase-PT-C12M10P15D17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-02 03:56:43] [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 03:56:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 03:56:43] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2025-06-02 03:56:43] [INFO ] Transformed 111 places.
[2025-06-02 03:56:43] [INFO ] Transformed 45 transitions.
[2025-06-02 03:56:43] [INFO ] Parsed PT model containing 111 places and 45 transitions and 224 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 23 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 82 transition count 45
Applied a total of 29 rules in 38 ms. Remains 82 /111 variables (removed 29) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 82 cols
[2025-06-02 03:56:44] [INFO ] Computed 38 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:56:44] [INFO ] Implicit Places using invariants in 211 ms returned [11, 26, 31]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 249 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/111 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 303 ms. Remains : 79/111 places, 45/45 transitions.
Support contains 49 out of 79 places after structural reductions.
[2025-06-02 03:56:44] [INFO ] Flatten gal took : 21 ms
[2025-06-02 03:56:44] [INFO ] Flatten gal took : 8 ms
[2025-06-02 03:56:44] [INFO ] Input system was already deterministic with 45 transitions.
RANDOM walk for 40000 steps (8 resets) in 1266 ms. (31 steps per ms) remains 1/37 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 1/1 properties
// Phase 1: matrix 45 rows 79 cols
[2025-06-02 03:56:45] [INFO ] Computed 35 invariants in 2 ms
[2025-06-02 03:56:45] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Real declared 42/124 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 5/17 constraints, Generalized P Invariants (flows): 0/18 constraints, State Equation: 0/79 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(X(G((p0||X(((p1 U X(X(p0))) U (p0&&(p1 U X(X(p0))))))))))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 64 transition count 45
Applied a total of 15 rules in 5 ms. Remains 64 /79 variables (removed 15) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2025-06-02 03:56:45] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:56:45] [INFO ] Implicit Places using invariants in 67 ms returned [13, 24]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 69 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/79 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 76 ms. Remains : 62/79 places, 45/45 transitions.
Stuttering acceptance computed with spot in 575 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 2 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLCardinality-00 finished in 744 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!(X(p0) U G((p0 U p1)))||G(p2)))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 64 transition count 45
Applied a total of 15 rules in 6 ms. Remains 64 /79 variables (removed 15) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2025-06-02 03:56:46] [INFO ] Computed 20 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:56:46] [INFO ] Implicit Places using invariants in 63 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/79 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 72 ms. Remains : 63/79 places, 45/45 transitions.
Stuttering acceptance computed with spot in 199 ms :[(AND p1 (NOT p2)), p1, (AND p0 p1), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-02
Product exploration explored 100000 steps with 11309 reset in 253 ms.
Product exploration explored 100000 steps with 11285 reset in 196 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (OR (AND p0 p2) (AND p1 p2)))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (OR (AND p0 p2) (AND p1 p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 119 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[p1, p1, false]
RANDOM walk for 3320 steps (0 resets) in 44 ms. (73 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (OR (AND p0 p2) (AND p1 p2)))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (OR (AND p0 p2) (AND p1 p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 15 factoid took 245 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[p1, p1, false]
Stuttering acceptance computed with spot in 128 ms :[p1, p1, false]
// Phase 1: matrix 45 rows 63 cols
[2025-06-02 03:56:48] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:56:48] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-06-02 03:56:48] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-02 03:56:48] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-02 03:56:48] [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 03:56:48] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2025-06-02 03:56:48] [INFO ] [Nat]Absence check using 16 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-02 03:56:48] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-02 03:56:48] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 03:56:48] [INFO ] Added : 2 causal constraints over 1 iterations in 28 ms. Result :sat
Could not prove EG p1
Support contains 3 out of 63 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 : 63/63 places, 45/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 63 transition count 38
Reduce places removed 12 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 21 rules applied. Total rules applied 28 place count 51 transition count 29
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 38 place count 42 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 41 transition count 28
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 39 place count 41 transition count 21
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 56 place count 31 transition count 21
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 56 place count 31 transition count 19
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 60 place count 29 transition count 19
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 8 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 74 place count 21 transition count 13
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 75 place count 20 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 75 place count 20 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 78 place count 18 transition count 12
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 79 place count 18 transition count 11
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 82 place count 16 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 83 place count 15 transition count 10
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 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 86 place count 13 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 1 rules applied. Total rules applied 87 place count 13 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 89 place count 11 transition count 8
Applied a total of 89 rules in 18 ms. Remains 11 /63 variables (removed 52) and now considering 8/45 (removed 37) transitions.
// Phase 1: matrix 8 rows 11 cols
[2025-06-02 03:56:48] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:56:48] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-02 03:56:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:56:48] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:56:48] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2025-06-02 03:56:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 2/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 15 constraints, problems are : Problem set: 0 solved, 7 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 2/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 22 constraints, problems are : Problem set: 0 solved, 7 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 259ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 259ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/63 places, 8/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 331 ms. Remains : 11/63 places, 8/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 13 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLCardinality-02 finished in 2126 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' '!(((p0||X((X(G(p1))||(p2 U X(!p2))))) U X(p3)))'
Support contains 6 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 64 transition count 45
Applied a total of 15 rules in 7 ms. Remains 64 /79 variables (removed 15) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2025-06-02 03:56:48] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:56:48] [INFO ] Implicit Places using invariants in 73 ms returned [14, 25]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 74 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/79 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 84 ms. Remains : 62/79 places, 45/45 transitions.
Stuttering acceptance computed with spot in 339 ms :[(NOT p3), (AND p2 (NOT p3) (NOT p1)), (NOT p3), (AND (NOT p1) p2), (AND p2 (NOT p1)), true, (NOT p1), p2]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 5100 steps with 118 reset in 31 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLCardinality-04 finished in 477 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(F(p0))||(F(p0)&&X(p1)))) U X((p2||G(p3)))))'
Support contains 5 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 64 transition count 45
Applied a total of 15 rules in 14 ms. Remains 64 /79 variables (removed 15) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2025-06-02 03:56:49] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:56:49] [INFO ] Implicit Places using invariants in 72 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/79 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 92 ms. Remains : 63/79 places, 45/45 transitions.
Stuttering acceptance computed with spot in 316 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3) p1), (AND (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-08
Product exploration explored 100000 steps with 2407 reset in 229 ms.
Product exploration explored 100000 steps with 2544 reset in 230 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p3) p1), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p2) p3 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) p1))), (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p3 p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (X p0), (X p1), (X (NOT (AND (NOT p2) p3))), (X (AND (NOT p2) (NOT p3))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p3 p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) p3))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
Knowledge based reduction with 32 factoid took 315 ms. Reduced automaton from 7 states, 20 edges and 4 AP (stutter sensitive) to 7 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 335 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) p1 (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p1))]
RANDOM walk for 24113 steps (5 resets) in 168 ms. (142 steps per ms) remains 0/20 properties
Knowledge obtained : [(AND p0 p2 (NOT p3) p1), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p2) p3 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) p1))), (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p3 p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (X p0), (X p1), (X (NOT (AND (NOT p2) p3))), (X (AND (NOT p2) (NOT p3))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p3 p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) p3))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (F (NOT (OR p1 p3 p0))), (F (NOT (OR (NOT p1) p2 p3 p0))), (F (NOT (OR (NOT p1) p2 (NOT p3) p0))), (F (NOT (OR p3 p0))), (F (NOT (OR p1 p3))), (F (NOT (OR p1 p2 (NOT p3) p0))), (F (NOT (OR p1 p2 (NOT p3)))), (F (NOT (OR p1 (NOT p3) p0))), (F (NOT (OR p1 p2 p3))), (F (NOT (OR p1 p2 p3 p0))), (F (NOT (OR (NOT p3) p0))), (F (NOT (OR p2 p3))), (F (NOT p2)), (F (NOT (OR p2 (NOT p3)))), (F (NOT p1)), (F p3), (F (NOT p0)), (F (NOT (OR p1 (NOT p3)))), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 32 factoid took 1073 ms. Reduced automaton from 7 states, 19 edges and 4 AP (stutter sensitive) to 7 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 332 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) p1 (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 336 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) p1 (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p1))]
Support contains 5 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2025-06-02 03:56:52] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:56:52] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-02 03:56:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:56:52] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2025-06-02 03:56:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/63 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 45/108 variables, 63/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/108 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 82 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1000 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/63 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 45/108 variables, 63/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 44/126 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/108 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 126 constraints, problems are : Problem set: 0 solved, 44 unsolved in 871 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1879ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1880ms
Finished structural reductions in LTL mode , in 1 iterations and 1993 ms. Remains : 63/63 places, 45/45 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 p1 p2 (NOT p3) p0), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p0)))), (X p0), (X p1), (X (NOT (AND (NOT p2) p3))), (X (AND (NOT p2) (NOT p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) p3 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p2) p3))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
Knowledge based reduction with 30 factoid took 312 ms. Reduced automaton from 7 states, 19 edges and 4 AP (stutter sensitive) to 7 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 343 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) p1 (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p1))]
RANDOM walk for 34332 steps (7 resets) in 220 ms. (155 steps per ms) remains 0/20 properties
Knowledge obtained : [(AND p1 p2 (NOT p3) p0), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p0)))), (X p0), (X p1), (X (NOT (AND (NOT p2) p3))), (X (AND (NOT p2) (NOT p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) p3 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p2) p3))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (F (NOT (OR p1 p3 p0))), (F (NOT (OR (NOT p1) p2 p3 p0))), (F (NOT (OR (NOT p1) p2 (NOT p3) p0))), (F (NOT (OR p3 p0))), (F (NOT (OR p1 p3))), (F (NOT (OR p1 p2 (NOT p3) p0))), (F (NOT (OR p1 p2 (NOT p3)))), (F (NOT (OR p1 (NOT p3) p0))), (F (NOT (OR p1 p2 p3))), (F (NOT (OR p1 p2 p3 p0))), (F (NOT (OR (NOT p3) p0))), (F (NOT (OR p2 p3))), (F (NOT p2)), (F (NOT (OR p2 (NOT p3)))), (F (NOT p1)), (F p3), (F (NOT p0)), (F (NOT (OR p1 (NOT p3)))), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 30 factoid took 1090 ms. Reduced automaton from 7 states, 19 edges and 4 AP (stutter sensitive) to 7 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) p1 (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 325 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) p1 (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 335 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) p1 (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p1))]
Product exploration explored 100000 steps with 2527 reset in 207 ms.
Product exploration explored 100000 steps with 2439 reset in 225 ms.
Applying partial POR strategy [false, true, false, true, true, true, true]
Stuttering acceptance computed with spot in 326 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) p1 (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p1))]
Support contains 5 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 63 transition count 45
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 9 place count 63 transition count 45
Deduced a syphon composed of 17 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 63 transition count 45
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 23 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 62 transition count 44
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 62 transition count 44
Deduced a syphon composed of 22 places in 1 ms
Applied a total of 25 rules in 18 ms. Remains 62 /63 variables (removed 1) and now considering 44/45 (removed 1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:56:58] [INFO ] Redundant transitions in 0 ms returned []
Running 43 sub problems to find dead transitions.
// Phase 1: matrix 44 rows 62 cols
[2025-06-02 03:56:58] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:56:58] [INFO ] Deduced a trap composed of 1 places in 32 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:56:58] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:56:58] [INFO ] Deduced a trap composed of 1 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:56:58] [INFO ] Deduced a trap composed of 1 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 03:56:58] [INFO ] Deduced a trap composed of 1 places in 22 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:56:58] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:56:58] [INFO ] Deduced a trap composed of 1 places in 22 ms of which 4 ms to minimize.
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:56:58] [INFO ] Deduced a trap composed of 1 places in 26 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD8 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 8/23 constraints. Problems are: Problem set: 8 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/23 constraints. Problems are: Problem set: 8 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 1/62 variables, 2/25 constraints. Problems are: Problem set: 8 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 2/27 constraints. Problems are: Problem set: 8 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/27 constraints. Problems are: Problem set: 8 solved, 35 unsolved
Problem TDEAD16 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD41 is UNSAT
At refinement iteration 7 (OVERLAPS) 44/106 variables, 62/89 constraints. Problems are: Problem set: 22 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/89 constraints. Problems are: Problem set: 22 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 0/106 variables, 0/89 constraints. Problems are: Problem set: 22 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 89 constraints, problems are : Problem set: 22 solved, 21 unsolved in 882 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 22 solved, 21 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 4/4 constraints. Problems are: Problem set: 22 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 8/12 constraints. Problems are: Problem set: 22 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 22 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 22/61 variables, 12/24 constraints. Problems are: Problem set: 22 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/26 constraints. Problems are: Problem set: 22 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/26 constraints. Problems are: Problem set: 22 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 1/62 variables, 1/27 constraints. Problems are: Problem set: 22 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/27 constraints. Problems are: Problem set: 22 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 44/106 variables, 62/89 constraints. Problems are: Problem set: 22 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 21/110 constraints. Problems are: Problem set: 22 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 0/110 constraints. Problems are: Problem set: 22 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 0/106 variables, 0/110 constraints. Problems are: Problem set: 22 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 110 constraints, problems are : Problem set: 22 solved, 21 unsolved in 601 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 21/43 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1491ms problems are : Problem set: 22 solved, 21 unsolved
Search for dead transitions found 22 dead transitions in 1493ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 62/63 places, 22/45 transitions.
Graph (complete) has 74 edges and 62 vertex of which 40 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 30 transition count 22
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 6 place count 30 transition count 22
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 30 transition count 22
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 14 place count 26 transition count 18
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 26 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 26 transition count 18
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 19 rules in 13 ms. Remains 26 /62 variables (removed 36) and now considering 18/22 (removed 4) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/63 places, 18/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1531 ms. Remains : 26/63 places, 18/45 transitions.
Built C files in :
/tmp/ltsmin14165571396965025819
[2025-06-02 03:56:59] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14165571396965025819
Running compilation step : cd /tmp/ltsmin14165571396965025819;'/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 274 ms.
Running link step : cd /tmp/ltsmin14165571396965025819;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin14165571396965025819;'/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/stateBased2192978028411795939.hoa' '--buchi-type=spotba'
LTSmin run took 179 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLCardinality-08 finished in 11332 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(F((p0||(F(p1)&&X((F(p2) U p3))))))))'
Support contains 5 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 65 transition count 45
Applied a total of 14 rules in 7 ms. Remains 65 /79 variables (removed 14) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2025-06-02 03:57:00] [INFO ] Computed 21 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:00] [INFO ] Implicit Places using invariants in 45 ms returned [12, 24]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/79 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56 ms. Remains : 63/79 places, 45/45 transitions.
Stuttering acceptance computed with spot in 293 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-09
Product exploration explored 100000 steps with 33333 reset in 84 ms.
Product exploration explored 100000 steps with 33333 reset in 94 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 17 ms. Reduced automaton from 6 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLCardinality-09 finished in 564 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((p0||X(p1)) U p2)))'
Support contains 7 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 64 transition count 45
Applied a total of 15 rules in 3 ms. Remains 64 /79 variables (removed 15) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2025-06-02 03:57:01] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:01] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-02 03:57:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 03:57:01] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2025-06-02 03:57:01] [INFO ] Invariant cache hit.
[2025-06-02 03:57:01] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/64 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 45/109 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/109 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 85 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1069 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/64 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 45/109 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 44/129 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (OVERLAPS) 0/109 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 129 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1091 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2166ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 2167ms
Starting structural reductions in LTL mode, iteration 1 : 64/79 places, 45/45 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2292 ms. Remains : 64/79 places, 45/45 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-10
Product exploration explored 100000 steps with 11318 reset in 127 ms.
Product exploration explored 100000 steps with 11314 reset in 138 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (AND (NOT p2) p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p1))), (X (X p0)), (X (X (AND (NOT p2) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 113 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
RANDOM walk for 784 steps (0 resets) in 13 ms. (56 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (AND (NOT p2) p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p1))), (X (X p0)), (X (X (AND (NOT p2) p0)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND (NOT p2) p0))), (F p2), (F (NOT (OR p2 p0))), (F (NOT (OR p2 p0 (NOT p1))))]
Knowledge based reduction with 15 factoid took 341 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
[2025-06-02 03:57:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:57:04] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 03:57:04] [INFO ] [Real]Absence check using 16 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 03:57:04] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 03:57:04] [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 03:57:04] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 03:57:04] [INFO ] [Nat]Absence check using 16 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 03:57:04] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-02 03:57:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 03:57:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-02 03:57:04] [INFO ] Computed and/alt/rep : 44/48/44 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 03:57:04] [INFO ] Added : 32 causal constraints over 7 iterations in 53 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 7 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2025-06-02 03:57:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:04] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-02 03:57:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 03:57:05] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2025-06-02 03:57:05] [INFO ] Invariant cache hit.
[2025-06-02 03:57:05] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/64 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 45/109 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/109 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 85 constraints, problems are : Problem set: 0 solved, 44 unsolved in 978 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/64 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 45/109 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 44/129 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (OVERLAPS) 0/109 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 129 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1111 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2097ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 2097ms
Finished structural reductions in LTL mode , in 1 iterations and 2200 ms. Remains : 64/64 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (AND (NOT p2) p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X p0)), (X (X (AND (NOT p2) p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 138 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
RANDOM walk for 702 steps (0 resets) in 11 ms. (58 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (AND (NOT p2) p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X p0)), (X (X (AND (NOT p2) p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND (NOT p2) p0))), (F p2), (F (NOT (OR p2 p0))), (F (NOT (OR p2 p0 (NOT p1))))]
Knowledge based reduction with 12 factoid took 449 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
[2025-06-02 03:57:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:57:08] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 03:57:08] [INFO ] [Real]Absence check using 16 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-02 03:57:08] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-02 03:57:08] [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 03:57:08] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 03:57:08] [INFO ] [Nat]Absence check using 16 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 03:57:08] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-02 03:57:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 03:57:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 03:57:08] [INFO ] Computed and/alt/rep : 44/48/44 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 03:57:08] [INFO ] Added : 32 causal constraints over 7 iterations in 45 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Product exploration explored 100000 steps with 11304 reset in 121 ms.
Product exploration explored 100000 steps with 11284 reset in 128 ms.
Built C files in :
/tmp/ltsmin13182911340548844477
[2025-06-02 03:57:08] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13182911340548844477
Running compilation step : cd /tmp/ltsmin13182911340548844477;'/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 124 ms.
Running link step : cd /tmp/ltsmin13182911340548844477;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin13182911340548844477;'/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/stateBased14958803013758374355.hoa' '--buchi-type=spotba'
LTSmin run took 122 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLCardinality-10 finished in 8169 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)||(p2&&(p3 U p4))) U p5))'
Support contains 6 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 65 transition count 36
Reduce places removed 15 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 26 rules applied. Total rules applied 36 place count 50 transition count 25
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 47 place count 39 transition count 25
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 47 place count 39 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 64 place count 29 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 64 place count 29 transition count 17
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 66 place count 28 transition count 17
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 3 with 6 rules applied. Total rules applied 72 place count 25 transition count 14
Applied a total of 72 rules in 13 ms. Remains 25 /79 variables (removed 54) and now considering 14/45 (removed 31) transitions.
// Phase 1: matrix 14 rows 25 cols
[2025-06-02 03:57:09] [INFO ] Computed 12 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:09] [INFO ] Implicit Places using invariants in 26 ms returned [1, 10, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 28 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/79 places, 14/45 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 22 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 17 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 16 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 16 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 15 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 15 place count 12 transition count 9
Applied a total of 15 rules in 3 ms. Remains 12 /22 variables (removed 10) and now considering 9/14 (removed 5) transitions.
// Phase 1: matrix 9 rows 12 cols
[2025-06-02 03:57:09] [INFO ] Computed 4 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:09] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-02 03:57:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:09] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/79 places, 9/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 100 ms. Remains : 12/79 places, 9/45 transitions.
Stuttering acceptance computed with spot in 316 ms :[(NOT p5), true, (NOT p0), (NOT p1), (NOT p4), (AND (NOT p0) (NOT p4)), (AND (NOT p1) (NOT p4))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 40 steps with 1 reset in 1 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLCardinality-11 finished in 439 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||G(p1))))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 64 transition count 39
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 17 rules applied. Total rules applied 25 place count 54 transition count 32
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 34 place count 47 transition count 30
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 40 place count 43 transition count 28
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 42 place count 41 transition count 28
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 42 place count 41 transition count 21
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 17 rules applied. Total rules applied 59 place count 31 transition count 21
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 59 place count 31 transition count 19
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 63 place count 29 transition count 19
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 7 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 75 place count 22 transition count 14
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 76 place count 21 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 76 place count 21 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 78 place count 20 transition count 13
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 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 81 place count 18 transition count 12
Applied a total of 81 rules in 10 ms. Remains 18 /79 variables (removed 61) and now considering 12/45 (removed 33) transitions.
// Phase 1: matrix 12 rows 18 cols
[2025-06-02 03:57:09] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:09] [INFO ] Implicit Places using invariants in 29 ms returned [2, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/79 places, 12/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 16 transition count 11
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 15 transition count 10
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 6 place count 13 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7 place count 12 transition count 9
Applied a total of 7 rules in 2 ms. Remains 12 /16 variables (removed 4) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 12 cols
[2025-06-02 03:57:09] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:09] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-02 03:57:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:09] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/79 places, 9/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 97 ms. Remains : 12/79 places, 9/45 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLCardinality-12 finished in 192 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(G(p0))&&F((p1||G(!p0))))))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 64 transition count 41
Reduce places removed 8 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 14 rules applied. Total rules applied 20 place count 56 transition count 35
Reduce places removed 6 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 10 rules applied. Total rules applied 30 place count 50 transition count 31
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 34 place count 46 transition count 31
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 34 place count 46 transition count 22
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 58 place count 31 transition count 22
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 58 place count 31 transition count 20
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 62 place count 29 transition count 20
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 7 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 74 place count 22 transition count 15
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 76 place count 21 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 77 place count 20 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 77 place count 20 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 80 place count 18 transition count 13
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 81 place count 18 transition count 12
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 84 place count 16 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 85 place count 15 transition count 11
Applied a total of 85 rules in 8 ms. Remains 15 /79 variables (removed 64) and now considering 11/45 (removed 34) transitions.
// Phase 1: matrix 11 rows 15 cols
[2025-06-02 03:57:09] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:09] [INFO ] Implicit Places using invariants in 23 ms returned [2, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/79 places, 11/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 12 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 12 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 7 place count 9 transition count 8
Applied a total of 7 rules in 3 ms. Remains 9 /13 variables (removed 4) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 9 cols
[2025-06-02 03:57:09] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:09] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-02 03:57:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:09] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/79 places, 8/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 88 ms. Remains : 9/79 places, 8/45 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-13
Product exploration explored 100000 steps with 1 reset in 105 ms.
Stack based approach found an accepted trace after 230 steps with 1 reset with depth 209 and stack size 209 in 0 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLCardinality-13 finished in 328 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||X(p1)))))'
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 64 transition count 45
Applied a total of 15 rules in 1 ms. Remains 64 /79 variables (removed 15) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2025-06-02 03:57:10] [INFO ] Computed 20 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:10] [INFO ] Implicit Places using invariants in 51 ms returned [12, 24]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 52 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/79 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55 ms. Remains : 62/79 places, 45/45 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-14
Product exploration explored 100000 steps with 0 reset in 220 ms.
Product exploration explored 100000 steps with 0 reset in 271 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 136 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 5530 steps (0 resets) in 41 ms. (131 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 13 factoid took 328 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 62 cols
[2025-06-02 03:57:11] [INFO ] Computed 18 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:11] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-02 03:57:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:11] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2025-06-02 03:57:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/107 variables, 62/80 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/107 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 80 constraints, problems are : Problem set: 0 solved, 44 unsolved in 828 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/107 variables, 62/80 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 44/124 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/107 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 124 constraints, problems are : Problem set: 0 solved, 44 unsolved in 738 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1572ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1572ms
Finished structural reductions in LTL mode , in 1 iterations and 1675 ms. Remains : 62/62 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 139 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 10229 steps (1 resets) in 58 ms. (173 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 13 factoid took 343 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 230 ms.
Product exploration explored 100000 steps with 0 reset in 280 ms.
Built C files in :
/tmp/ltsmin11930418004988967623
[2025-06-02 03:57:14] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11930418004988967623
Running compilation step : cd /tmp/ltsmin11930418004988967623;'/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 123 ms.
Running link step : cd /tmp/ltsmin11930418004988967623;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11930418004988967623;'/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/stateBased11466073381539366985.hoa' '--buchi-type=spotba'
LTSmin run took 227 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLCardinality-14 finished in 4994 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(p0))&&(F((p0&&(p1 U p2))) U p1)))'
Support contains 5 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 64 transition count 45
Applied a total of 15 rules in 3 ms. Remains 64 /79 variables (removed 15) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2025-06-02 03:57:15] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:15] [INFO ] Implicit Places using invariants in 51 ms returned [12, 25]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 52 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/79 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 62/79 places, 45/45 transitions.
Stuttering acceptance computed with spot in 235 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLCardinality-15 finished in 319 ms.
All properties solved by simple procedures.
Total runtime 31703 ms.

BK_STOP 1748836635547

--------------------
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="IOTPpurchase-PT-C12M10P15D17"
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 IOTPpurchase-PT-C12M10P15D17, 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 r114-tall-174876422600387"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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