Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r114-tall-174876422600388.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876422600388
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-01
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-02
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-03
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-04
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-05
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-06
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-07
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-08
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-09
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-10
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-11
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-12
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-13
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-14
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748836635494

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
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
LTLFireability PT
Running Version 202505121319
[2025-06-02 03:57:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 03:57:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 03:57:17] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2025-06-02 03:57:17] [INFO ] Transformed 111 places.
[2025-06-02 03:57:17] [INFO ] Transformed 45 transitions.
[2025-06-02 03:57:17] [INFO ] Parsed PT model containing 111 places and 45 transitions and 224 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 65 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 12 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 95 transition count 45
Applied a total of 16 rules in 20 ms. Remains 95 /111 variables (removed 16) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 95 cols
[2025-06-02 03:57:17] [INFO ] Computed 51 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:17] [INFO ] Implicit Places using invariants in 206 ms returned [14, 37]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 243 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 93/111 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 291 ms. Remains : 93/111 places, 45/45 transitions.
Support contains 65 out of 93 places after structural reductions.
[2025-06-02 03:57:17] [INFO ] Flatten gal took : 24 ms
[2025-06-02 03:57:17] [INFO ] Flatten gal took : 9 ms
[2025-06-02 03:57:17] [INFO ] Input system was already deterministic with 45 transitions.
RANDOM walk for 1186 steps (0 resets) in 168 ms. (7 steps per ms) remains 0/25 properties
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 45/45 transitions.
Ensure Unique test removed 21 places
Discarding 4 places :
Implicit places reduction removed 4 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 13 rules applied. Total rules applied 13 place count 68 transition count 36
Reduce places removed 15 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 27 rules applied. Total rules applied 40 place count 53 transition count 24
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 52 place count 41 transition count 24
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 52 place count 41 transition count 16
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 73 place count 28 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 73 place count 28 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 77 place count 26 transition count 14
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 94 place count 16 transition count 7
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 15 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 95 place count 15 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 98 place count 13 transition count 6
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 4 with 1 rules applied. Total rules applied 99 place count 13 transition count 5
Reduce places removed 2 places and 0 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 5 with 3 rules applied. Total rules applied 102 place count 11 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 104 place count 9 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 104 place count 9 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 107 place count 7 transition count 3
Applied a total of 107 rules in 17 ms. Remains 7 /93 variables (removed 86) and now considering 3/45 (removed 42) transitions.
// Phase 1: matrix 3 rows 7 cols
[2025-06-02 03:57:18] [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:18] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-02 03:57:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 03:57:18] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:57:18] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2025-06-02 03:57:18] [INFO ] Invariant cache hit.
[2025-06-02 03:57:18] [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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/7 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/10 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/10 variables, and 13 constraints, problems are : Problem set: 0 solved, 2 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/7 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/10 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/10 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/10 variables, and 15 constraints, problems are : Problem set: 0 solved, 2 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 149ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 156ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/93 places, 3/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 234 ms. Remains : 7/93 places, 3/45 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-01
Product exploration explored 100000 steps with 3450 reset in 257 ms.
Stack based approach found an accepted trace after 12 steps with 1 reset with depth 10 and stack size 7 in 1 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-01 finished in 761 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F((p1&&X(!p0))))))'
Support contains 9 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 45/45 transitions.
Ensure Unique test removed 19 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 70 transition count 45
Applied a total of 23 rules in 4 ms. Remains 70 /93 variables (removed 23) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 70 cols
[2025-06-02 03:57:19] [INFO ] Computed 26 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:19] [INFO ] Implicit Places using invariants in 69 ms returned [15, 18, 25]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 69 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/93 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75 ms. Remains : 67/93 places, 45/45 transitions.
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p0), (OR (NOT p1) p0), p0]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-02
Product exploration explored 100000 steps with 7676 reset in 198 ms.
Product exploration explored 100000 steps with 7660 reset in 203 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 (NOT p0)), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 99 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 139 steps (0 resets) in 7 ms. (17 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 7 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 45 rows 67 cols
[2025-06-02 03:57:20] [INFO ] Computed 23 invariants in 2 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:57:20] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2025-06-02 03:57:20] [INFO ] [Real]Absence check using 16 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-02 03:57:20] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 03:57:20] [INFO ] Computed and/alt/rep : 44/50/44 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 03:57:20] [INFO ] Added : 6 causal constraints over 2 iterations in 36 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 67 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 : 67/67 places, 45/45 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 0 with 6 rules applied. Total rules applied 6 place count 67 transition count 39
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 18 rules applied. Total rules applied 24 place count 57 transition count 31
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 32 place count 49 transition count 31
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 32 place count 49 transition count 21
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 55 place count 36 transition count 21
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 55 place count 36 transition count 18
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 61 place count 33 transition count 18
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 79 place count 22 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 80 place count 21 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 80 place count 21 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 83 place count 19 transition count 10
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 4 with 1 rules applied. Total rules applied 84 place count 19 transition count 9
Reduce places removed 2 places and 0 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 5 with 3 rules applied. Total rules applied 87 place count 17 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 88 place count 16 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 5 rules applied. Total rules applied 93 place count 13 transition count 6
Applied a total of 93 rules in 13 ms. Remains 13 /67 variables (removed 54) and now considering 6/45 (removed 39) transitions.
// Phase 1: matrix 6 rows 13 cols
[2025-06-02 03:57:20] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:20] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-02 03:57:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:20] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:57:20] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-02 03:57:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/13 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/19 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/19 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/13 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/19 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 26 constraints, problems are : Problem set: 0 solved, 5 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 162ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 163ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/67 places, 6/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 240 ms. Remains : 13/67 places, 6/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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 58 steps (0 resets) in 5 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
[2025-06-02 03:57:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:57:20] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 03:57:20] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 03:57:20] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 0 ms.
[2025-06-02 03:57:20] [INFO ] Added : 4 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11355 reset in 109 ms.
Product exploration explored 100000 steps with 11375 reset in 85 ms.
Built C files in :
/tmp/ltsmin11674217216290024366
[2025-06-02 03:57:21] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2025-06-02 03:57:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 03:57:21] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2025-06-02 03:57:21] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 03:57:21] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2025-06-02 03:57:21] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 03:57:21] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11674217216290024366
Running compilation step : cd /tmp/ltsmin11674217216290024366;'/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 231 ms.
Running link step : cd /tmp/ltsmin11674217216290024366;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin11674217216290024366;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15428284322137822000.hoa' '--buchi-type=spotba'
LTSmin run took 76 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-02 finished in 2641 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(X(X((F(G(p1))||G(!p2))))))))'
Support contains 8 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 45/45 transitions.
Ensure Unique test removed 22 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 68 transition count 45
Applied a total of 25 rules in 5 ms. Remains 68 /93 variables (removed 25) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 68 cols
[2025-06-02 03:57:21] [INFO ] Computed 24 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:21] [INFO ] Implicit Places using invariants in 57 ms returned [13, 16, 22]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 58 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 65/93 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 65/93 places, 45/45 transitions.
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p1) p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-03
Product exploration explored 100000 steps with 19326 reset in 135 ms.
Product exploration explored 100000 steps with 19554 reset in 164 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) (NOT p1)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (AND (NOT p1) (NOT p2))), (X p0), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 14 factoid took 224 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p1) p2), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 373 ms. (106 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
// Phase 1: matrix 45 rows 65 cols
[2025-06-02 03:57:22] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf1 is UNSAT
After SMT solving in domain Real declared 6/110 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 16 ms.
Refiners :[Positive P Invariants (semi-flows): 1/16 constraints, Generalized P Invariants (flows): 0/5 constraints, State Equation: 0/65 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (AND (NOT p1) (NOT p2))), (X p0), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR (NOT p2) p0))), (F p2), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p1) p0))), (F p1)]
Knowledge based reduction with 15 factoid took 455 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), p2, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), p2, (AND (NOT p0) (NOT p1))]
Support contains 8 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 45/45 transitions.
Applied a total of 0 rules in 6 ms. Remains 65 /65 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2025-06-02 03:57:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:23] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-02 03:57:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:24] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2025-06-02 03:57:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/65 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/110 variables, 65/86 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/110 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 86 constraints, problems are : Problem set: 0 solved, 44 unsolved in 959 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 65/65 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/64 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/65 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/110 variables, 65/86 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 44/130 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/110 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 130 constraints, problems are : Problem set: 0 solved, 44 unsolved in 826 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1790ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1790ms
Finished structural reductions in LTL mode , in 1 iterations and 1909 ms. Remains : 65/65 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) (NOT p2) (NOT p1)), (X p0), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), p2, (AND (NOT p0) (NOT p1))]
RANDOM walk for 398 steps (0 resets) in 7 ms. (49 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X p0), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (OR (NOT p1) p0))), (F p0), (F p1), (F p2), (F (NOT (OR p0 (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 331 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), p2, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), p2, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), p2, (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 19458 reset in 110 ms.
Product exploration explored 100000 steps with 19493 reset in 116 ms.
Applying partial POR strategy [false, false, false, true, false, true]
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), p2, (AND (NOT p0) (NOT p1))]
Support contains 8 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 45/45 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 65 transition count 45
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 7 place count 65 transition count 45
Deduced a syphon composed of 19 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 19 place count 65 transition count 45
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 27 place count 65 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 64 transition count 44
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 64 transition count 44
Deduced a syphon composed of 26 places in 0 ms
Applied a total of 29 rules in 14 ms. Remains 64 /65 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:57:28] [INFO ] Redundant transitions in 1 ms returned []
Running 43 sub problems to find dead transitions.
// Phase 1: matrix 44 rows 64 cols
[2025-06-02 03:57:28] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 5/20 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:57:28] [INFO ] Deduced a trap composed of 1 places in 34 ms of which 8 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:57:28] [INFO ] Deduced a trap composed of 1 places in 23 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:57:28] [INFO ] Deduced a trap composed of 1 places in 20 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:57:28] [INFO ] Deduced a trap composed of 1 places in 18 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:57:28] [INFO ] Deduced a trap composed of 1 places in 24 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:57:28] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:57:28] [INFO ] Deduced a trap composed of 1 places in 20 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:57:28] [INFO ] Deduced a trap composed of 1 places in 17 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:57:28] [INFO ] Deduced a trap composed of 1 places in 20 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:57:28] [INFO ] Deduced a trap composed of 1 places in 23 ms of which 2 ms to minimize.
Problem TDEAD39 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/30 constraints. Problems are: Problem set: 10 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/30 constraints. Problems are: Problem set: 10 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/31 constraints. Problems are: Problem set: 10 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/31 constraints. Problems are: Problem set: 10 solved, 33 unsolved
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 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 TDEAD28 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
At refinement iteration 6 (OVERLAPS) 44/108 variables, 64/95 constraints. Problems are: Problem set: 26 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/95 constraints. Problems are: Problem set: 26 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/108 variables, 0/95 constraints. Problems are: Problem set: 26 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 95 constraints, problems are : Problem set: 26 solved, 17 unsolved in 877 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 26 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 2/2 constraints. Problems are: Problem set: 26 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 2/4 constraints. Problems are: Problem set: 26 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 10/14 constraints. Problems are: Problem set: 26 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/14 constraints. Problems are: Problem set: 26 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 27/64 variables, 14/28 constraints. Problems are: Problem set: 26 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 3/31 constraints. Problems are: Problem set: 26 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/31 constraints. Problems are: Problem set: 26 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 44/108 variables, 64/95 constraints. Problems are: Problem set: 26 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 17/112 constraints. Problems are: Problem set: 26 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 0/112 constraints. Problems are: Problem set: 26 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/108 variables, 0/112 constraints. Problems are: Problem set: 26 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 112 constraints, problems are : Problem set: 26 solved, 17 unsolved in 441 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 17/43 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1326ms problems are : Problem set: 26 solved, 17 unsolved
Search for dead transitions found 26 dead transitions in 1327ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 64/65 places, 18/45 transitions.
Graph (complete) has 78 edges and 64 vertex of which 38 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.2 ms
Discarding 26 places :
Also discarding 0 output transitions
Reduce places removed 10 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 27 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 6 place count 27 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 27 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 24 transition count 15
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 24 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 24 transition count 15
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 23 transition count 14
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 23 transition count 14
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 19 rules in 8 ms. Remains 23 /64 variables (removed 41) and now considering 14/18 (removed 4) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/65 places, 14/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1358 ms. Remains : 23/65 places, 14/45 transitions.
Built C files in :
/tmp/ltsmin12012781334146593259
[2025-06-02 03:57:29] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12012781334146593259
Running compilation step : cd /tmp/ltsmin12012781334146593259;'/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 122 ms.
Running link step : cd /tmp/ltsmin12012781334146593259;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin12012781334146593259;'/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/stateBased13224836812765254874.hoa' '--buchi-type=spotba'
LTSmin run took 71 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-03 finished in 8145 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)) U (p1||F(p2))))'
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 45/45 transitions.
Ensure Unique test removed 24 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 67 transition count 45
Applied a total of 26 rules in 3 ms. Remains 67 /93 variables (removed 26) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 67 cols
[2025-06-02 03:57:29] [INFO ] Computed 23 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:29] [INFO ] Implicit Places using invariants in 54 ms returned [12, 15, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 56 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/93 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61 ms. Remains : 64/93 places, 45/45 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-04
Product exploration explored 100000 steps with 446 reset in 166 ms.
Product exploration explored 100000 steps with 445 reset in 173 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 141 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 945 steps (0 resets) in 12 ms. (72 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 13 factoid took 163 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p2), (NOT p2)]
// Phase 1: matrix 45 rows 64 cols
[2025-06-02 03:57:30] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:57:30] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-02 03:57:30] [INFO ] [Real]Absence check using 14 positive and 6 generalized place invariants in 2 ms returned sat
[2025-06-02 03:57:30] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-02 03:57:30] [INFO ] Computed and/alt/rep : 44/47/44 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 03:57:30] [INFO ] Added : 39 causal constraints over 8 iterations in 65 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 64 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 : 64/64 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 64 transition count 38
Reduce places removed 11 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 19 rules applied. Total rules applied 26 place count 53 transition count 30
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 34 place count 45 transition count 30
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 34 place count 45 transition count 21
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 54 place count 34 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 54 place count 34 transition count 20
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 56 place count 33 transition count 20
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 3 with 14 rules applied. Total rules applied 70 place count 25 transition count 14
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 72 place count 24 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 23 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 73 place count 23 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 76 place count 21 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 77 place count 21 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 79 place count 19 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 79 place count 19 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 81 place count 18 transition count 10
Applied a total of 81 rules in 6 ms. Remains 18 /64 variables (removed 46) and now considering 10/45 (removed 35) transitions.
// Phase 1: matrix 10 rows 18 cols
[2025-06-02 03:57:31] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:31] [INFO ] Implicit Places using invariants in 28 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/64 places, 10/45 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 15 transition count 9
Applied a total of 3 rules in 2 ms. Remains 15 /17 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 15 cols
[2025-06-02 03:57:31] [INFO ] Computed 7 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:31] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-02 03:57:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:31] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/64 places, 9/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 90 ms. Remains : 15/64 places, 9/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 : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 91 steps (0 resets) in 4 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p2), (NOT p2)]
[2025-06-02 03:57:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:57:31] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 03:57:31] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-02 03:57:31] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 03:57:31] [INFO ] Computed and/alt/rep : 8/10/8 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 03:57:31] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 71 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 5149 reset in 90 ms.
Product exploration explored 100000 steps with 5159 reset in 102 ms.
Built C files in :
/tmp/ltsmin5469633191050907627
[2025-06-02 03:57:31] [INFO ] Computing symmetric may disable matrix : 9 transitions.
[2025-06-02 03:57:31] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 03:57:31] [INFO ] Computing symmetric may enable matrix : 9 transitions.
[2025-06-02 03:57:31] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 03:57:31] [INFO ] Computing Do-Not-Accords matrix : 9 transitions.
[2025-06-02 03:57:31] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 03:57:31] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5469633191050907627
Running compilation step : cd /tmp/ltsmin5469633191050907627;'/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 79 ms.
Running link step : cd /tmp/ltsmin5469633191050907627;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5469633191050907627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4153535673919888191.hoa' '--buchi-type=spotba'
LTSmin run took 48 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-04 finished in 2252 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(G(p2)))))))'
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 45/45 transitions.
Ensure Unique test removed 24 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 66 transition count 45
Applied a total of 27 rules in 3 ms. Remains 66 /93 variables (removed 27) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2025-06-02 03:57:32] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:32] [INFO ] Implicit Places using invariants in 43 ms returned [13, 16, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 44 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/93 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 49 ms. Remains : 63/93 places, 45/45 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-05
Product exploration explored 100000 steps with 3646 reset in 120 ms.
Product exploration explored 100000 steps with 3668 reset in 129 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 p2), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 127 steps (0 resets) in 4 ms. (25 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 45 rows 63 cols
[2025-06-02 03:57:33] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:57:33] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2025-06-02 03:57:33] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-02 03:57:33] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-02 03:57:33] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 03:57:33] [INFO ] Added : 7 causal constraints over 2 iterations in 16 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 63 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 63/63 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.
[2025-06-02 03:57:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:33] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-02 03:57:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:33] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2025-06-02 03:57:33] [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, 15/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/63 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/108 variables, 63/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (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 865 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, 15/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/63 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/108 variables, 63/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 44/126 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (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 822 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 1691ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1692ms
Finished structural reductions in LTL mode , in 1 iterations and 1807 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 : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 123 steps (0 resets) in 6 ms. (17 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 107 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2025-06-02 03:57:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:57:35] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 03:57:35] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-02 03:57:35] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-02 03:57:35] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 03:57:35] [INFO ] Added : 7 causal constraints over 2 iterations in 15 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3644 reset in 116 ms.
Product exploration explored 100000 steps with 3641 reset in 150 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 63 transition count 45
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 15 Pre rules applied. Total rules applied 7 place count 63 transition count 45
Deduced a syphon composed of 22 places in 1 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 22 place count 63 transition count 45
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 30 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 62 transition count 44
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 62 transition count 44
Deduced a syphon composed of 29 places in 0 ms
Applied a total of 32 rules in 21 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:57:36] [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:57:36] [INFO ] Computed 19 invariants in 0 ms
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, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 3/18 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:57:36] [INFO ] Deduced a trap composed of 1 places in 20 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:57:36] [INFO ] Deduced a trap composed of 1 places in 24 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:57:36] [INFO ] Deduced a trap composed of 1 places in 20 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:57:36] [INFO ] Deduced a trap composed of 1 places in 20 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:57:36] [INFO ] Deduced a trap composed of 1 places in 21 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:57:36] [INFO ] Deduced a trap composed of 1 places in 17 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:57:36] [INFO ] Deduced a trap composed of 1 places in 21 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:57:37] [INFO ] Deduced a trap composed of 1 places in 21 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:57:37] [INFO ] Deduced a trap composed of 1 places in 18 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:57:37] [INFO ] Deduced a trap composed of 1 places in 22 ms of which 2 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:57:37] [INFO ] Deduced a trap composed of 1 places in 22 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 11/29 constraints. Problems are: Problem set: 11 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/29 constraints. Problems are: Problem set: 11 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/62 variables, 1/30 constraints. Problems are: Problem set: 11 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/30 constraints. Problems are: Problem set: 11 solved, 32 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
At refinement iteration 6 (OVERLAPS) 44/106 variables, 62/92 constraints. Problems are: Problem set: 29 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/92 constraints. Problems are: Problem set: 29 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/106 variables, 0/92 constraints. Problems are: Problem set: 29 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 92 constraints, problems are : Problem set: 29 solved, 14 unsolved in 811 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: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 29 solved, 14 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 29 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 10/11 constraints. Problems are: Problem set: 29 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 29 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 31/61 variables, 14/25 constraints. Problems are: Problem set: 29 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 3/28 constraints. Problems are: Problem set: 29 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/28 constraints. Problems are: Problem set: 29 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 1/62 variables, 1/29 constraints. Problems are: Problem set: 29 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 1/30 constraints. Problems are: Problem set: 29 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/30 constraints. Problems are: Problem set: 29 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 44/106 variables, 62/92 constraints. Problems are: Problem set: 29 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 14/106 constraints. Problems are: Problem set: 29 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/106 constraints. Problems are: Problem set: 29 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 0/106 variables, 0/106 constraints. Problems are: Problem set: 29 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 106 constraints, problems are : Problem set: 29 solved, 14 unsolved in 328 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 14/43 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1146ms problems are : Problem set: 29 solved, 14 unsolved
Search for dead transitions found 29 dead transitions in 1147ms
Found 29 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 29 transitions
Dead transitions reduction (with SMT) removed 29 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 62/63 places, 15/45 transitions.
Graph (complete) has 72 edges and 62 vertex of which 33 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.1 ms
Discarding 29 places :
Also discarding 0 output transitions
Reduce places removed 11 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 21 transition count 15
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 6 place count 21 transition count 15
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 21 transition count 15
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 19 transition count 13
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 19 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 19 transition count 13
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 18 transition count 12
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 18 transition count 12
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 17 rules in 7 ms. Remains 18 /62 variables (removed 44) and now considering 12/15 (removed 3) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/63 places, 12/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1183 ms. Remains : 18/63 places, 12/45 transitions.
Built C files in :
/tmp/ltsmin8679446540984595629
[2025-06-02 03:57:37] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8679446540984595629
Running compilation step : cd /tmp/ltsmin8679446540984595629;'/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 116 ms.
Running link step : cd /tmp/ltsmin8679446540984595629;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8679446540984595629;'/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/stateBased16502052594266483791.hoa' '--buchi-type=spotba'
LTSmin run took 2450 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-05 finished in 8485 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 U p1) U X(G(((G(p2) U p3) U G(X(p0)))))))'
Support contains 6 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 45/45 transitions.
Ensure Unique test removed 24 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 67 transition count 45
Applied a total of 26 rules in 3 ms. Remains 67 /93 variables (removed 26) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 67 cols
[2025-06-02 03:57:40] [INFO ] Computed 23 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:40] [INFO ] Implicit Places using invariants in 54 ms returned [12, 15, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 56 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/93 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 64 /64 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59 ms. Remains : 64/93 places, 45/45 transitions.
Stuttering acceptance computed with spot in 522 ms :[p0, p0, (AND p0 p1), p0, (AND p3 p2 p0), (AND p0 p1), false, (AND p0 p2), (AND p3 p2 p0 p1), (AND p0 p1 p2), (AND p0 p2 p1)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-06
Product exploration explored 100000 steps with 33333 reset in 117 ms.
Product exploration explored 100000 steps with 33333 reset in 144 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p2 (NOT p3)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 21 ms. Reduced automaton from 11 states, 30 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-06 finished in 899 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U ((G(!p1) U p2)&&(!p1 U X(!p3)))))'
Support contains 7 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 45/45 transitions.
Ensure Unique test removed 24 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 66 transition count 45
Applied a total of 27 rules in 2 ms. Remains 66 /93 variables (removed 27) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2025-06-02 03:57:41] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:41] [INFO ] Implicit Places using invariants in 46 ms returned [12, 15, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 47 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/93 places, 45/45 transitions.
Applied a total of 0 rules in 1 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 50 ms. Remains : 63/93 places, 45/45 transitions.
Stuttering acceptance computed with spot in 400 ms :[(OR (NOT p2) p3), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND p1 p2 p3), (NOT p2), p3, p3, (AND p1 p3)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-07
Product exploration explored 100000 steps with 414 reset in 147 ms.
Product exploration explored 100000 steps with 406 reset in 169 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 p2) p1 p0 (NOT p3)), (X (NOT p2)), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p3)), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p2) (NOT p1) p3))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 p3))), (X (NOT (AND p1 p3))), (X (AND (NOT p2) p1)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND p2 p1 p3))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (NOT (AND p1 p3)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND p2 p1 p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 33 factoid took 198 ms. Reduced automaton from 9 states, 33 edges and 4 AP (stutter sensitive) to 9 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 418 ms :[(OR (NOT p2) p3), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND p1 p2 p3), (NOT p2), p3, p3, (AND p1 p3)]
RANDOM walk for 1665 steps (0 resets) in 26 ms. (61 steps per ms) remains 0/16 properties
Knowledge obtained : [(AND (NOT p2) p1 p0 (NOT p3)), (X (NOT p2)), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p3)), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p2) (NOT p1) p3))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 p3))), (X (NOT (AND p1 p3))), (X (AND (NOT p2) p1)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND p2 p1 p3))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (NOT (AND p1 p3)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND p2 p1 p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p3)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p3)))), (F (NOT p1)), (F (NOT (OR (NOT p1) p0))), (F (NOT p0)), (F (NOT (OR p0 (NOT p3)))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR p1 (NOT p2)))), (F p2), (F (NOT (OR p1 p2))), (F p3), (F (NOT (OR p1 p2 (NOT p3)))), (F (NOT (OR (NOT p1) p2 (NOT p3))))]
Knowledge based reduction with 33 factoid took 819 ms. Reduced automaton from 9 states, 33 edges and 4 AP (stutter sensitive) to 9 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 469 ms :[(OR (NOT p2) p3), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND p1 p2 p3), (NOT p2), p3, p3, (AND p1 p3)]
Stuttering acceptance computed with spot in 454 ms :[(OR (NOT p2) p3), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND p1 p2 p3), (NOT p2), p3, p3, (AND p1 p3)]
// Phase 1: matrix 45 rows 63 cols
[2025-06-02 03:57:44] [INFO ] Computed 19 invariants in 0 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:57:44] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2025-06-02 03:57:44] [INFO ] [Real]Absence check using 15 positive and 4 generalized place invariants in 3 ms returned sat
[2025-06-02 03:57:44] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-02 03:57:44] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 03:57:44] [INFO ] Added : 12 causal constraints over 3 iterations in 27 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 7 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 1 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2025-06-02 03:57:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:44] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-02 03:57:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:44] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2025-06-02 03:57:44] [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, 4/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/63 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/108 variables, 63/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (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 832 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 4/4 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, 4/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/63 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/108 variables, 63/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 44/126 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (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 822 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 4/4 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 1656ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1656ms
Finished structural reductions in LTL mode , in 1 iterations and 1749 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 (NOT p2) p0 (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2 p3))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 p3))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND p1 (NOT p2))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2 p3)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 33 factoid took 182 ms. Reduced automaton from 9 states, 33 edges and 4 AP (stutter sensitive) to 9 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 424 ms :[(OR (NOT p2) p3), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND p1 p2 p3), (NOT p2), p3, p3, (AND p1 p3)]
RANDOM walk for 1996 steps (0 resets) in 72 ms. (27 steps per ms) remains 0/16 properties
Knowledge obtained : [(AND p1 (NOT p2) p0 (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2 p3))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 p3))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND p1 (NOT p2))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2 p3)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p3)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p3)))), (F (NOT p1)), (F (NOT (OR (NOT p1) p0))), (F (NOT p0)), (F (NOT (OR p0 (NOT p3)))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR p1 (NOT p2)))), (F p2), (F (NOT (OR p1 p2))), (F p3), (F (NOT (OR p1 p2 (NOT p3)))), (F (NOT (OR (NOT p1) p2 (NOT p3))))]
Knowledge based reduction with 33 factoid took 884 ms. Reduced automaton from 9 states, 33 edges and 4 AP (stutter sensitive) to 9 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 481 ms :[(OR (NOT p2) p3), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND p1 p2 p3), (NOT p2), p3, p3, (AND p1 p3)]
Stuttering acceptance computed with spot in 446 ms :[(OR (NOT p2) p3), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND p1 p2 p3), (NOT p2), p3, p3, (AND p1 p3)]
[2025-06-02 03:57:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:57:48] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2025-06-02 03:57:48] [INFO ] [Real]Absence check using 15 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-02 03:57:48] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 03:57:48] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 03:57:49] [INFO ] Added : 12 causal constraints over 3 iterations in 25 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 449 ms :[(OR (NOT p2) p3), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND p1 p2 p3), (NOT p2), p3, p3, (AND p1 p3)]
Product exploration explored 100000 steps with 416 reset in 159 ms.
Product exploration explored 100000 steps with 405 reset in 167 ms.
Applying partial POR strategy [false, true, true, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 461 ms :[(OR (NOT p2) p3), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND p1 p2 p3), (NOT p2), p3, p3, (AND p1 p3)]
Support contains 7 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 63 transition count 45
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 8 place count 63 transition count 45
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 20 place count 63 transition count 45
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 62 transition count 44
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 62 transition count 44
Deduced a syphon composed of 23 places in 0 ms
Applied a total of 26 rules in 8 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:57:50] [INFO ] Redundant transitions in 1 ms returned []
Running 43 sub problems to find dead transitions.
// Phase 1: matrix 44 rows 62 cols
[2025-06-02 03:57:50] [INFO ] Computed 19 invariants in 0 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, 4/18 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:57:50] [INFO ] Deduced a trap composed of 1 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:57:50] [INFO ] Deduced a trap composed of 1 places in 16 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:57:50] [INFO ] Deduced a trap composed of 1 places in 16 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:57:50] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:57:50] [INFO ] Deduced a trap composed of 1 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:57:50] [INFO ] Deduced a trap composed of 1 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:57:50] [INFO ] Deduced a trap composed of 1 places in 22 ms of which 3 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:57:50] [INFO ] Deduced a trap composed of 1 places in 16 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 8/26 constraints. Problems are: Problem set: 8 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/26 constraints. Problems are: Problem set: 8 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 1/62 variables, 1/27 constraints. Problems are: Problem set: 8 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/27 constraints. Problems are: Problem set: 8 solved, 35 unsolved
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD19 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 TDEAD31 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
At refinement iteration 6 (OVERLAPS) 44/106 variables, 62/89 constraints. Problems are: Problem set: 23 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/89 constraints. Problems are: Problem set: 23 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/106 variables, 0/89 constraints. Problems are: Problem set: 23 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 89 constraints, problems are : Problem set: 23 solved, 20 unsolved in 814 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 4/4 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: 23 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 23 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 7/10 constraints. Problems are: Problem set: 23 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 23 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 25/61 variables, 11/21 constraints. Problems are: Problem set: 23 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 4/25 constraints. Problems are: Problem set: 23 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/25 constraints. Problems are: Problem set: 23 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 1/62 variables, 1/26 constraints. Problems are: Problem set: 23 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 1/27 constraints. Problems are: Problem set: 23 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/27 constraints. Problems are: Problem set: 23 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 44/106 variables, 62/89 constraints. Problems are: Problem set: 23 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 20/109 constraints. Problems are: Problem set: 23 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/109 constraints. Problems are: Problem set: 23 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 0/106 variables, 0/109 constraints. Problems are: Problem set: 23 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 109 constraints, problems are : Problem set: 23 solved, 20 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 20/43 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1283ms problems are : Problem set: 23 solved, 20 unsolved
Search for dead transitions found 23 dead transitions in 1285ms
Found 23 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 23 transitions
Dead transitions reduction (with SMT) removed 23 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 62/63 places, 21/45 transitions.
Graph (complete) has 75 edges and 62 vertex of which 39 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.0 ms
Discarding 23 places :
Also discarding 0 output transitions
Reduce places removed 8 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 30 transition count 21
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 5 place count 30 transition count 21
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 30 transition count 21
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 27 transition count 18
Deduced a syphon composed of 4 places in 2 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 27 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 27 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 26 transition count 17
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 17
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 19 rules in 9 ms. Remains 26 /62 variables (removed 36) and now considering 17/21 (removed 4) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/63 places, 17/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1309 ms. Remains : 26/63 places, 17/45 transitions.
Built C files in :
/tmp/ltsmin1654789953846825975
[2025-06-02 03:57:51] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1654789953846825975
Running compilation step : cd /tmp/ltsmin1654789953846825975;'/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/ltsmin1654789953846825975;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin1654789953846825975;'/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/stateBased12587673660968787729.hoa' '--buchi-type=spotba'
LTSmin run took 123 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-07 finished in 10593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((!p0&&X((!p1 U (p2||G(!p1)))))))))'
Support contains 9 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 45/45 transitions.
Ensure Unique test removed 21 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 69 transition count 45
Applied a total of 24 rules in 2 ms. Remains 69 /93 variables (removed 24) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 69 cols
[2025-06-02 03:57:52] [INFO ] Computed 25 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:52] [INFO ] Implicit Places using invariants in 39 ms returned [17, 22]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/93 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 67 /67 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 67/93 places, 45/45 transitions.
Stuttering acceptance computed with spot in 204 ms :[true, (OR p0 (AND p1 (NOT p2))), (AND (NOT p2) p1), (OR p0 (AND p1 (NOT p2))), (OR p0 (AND p1 (NOT p2))), (OR p0 (AND p1 (NOT p2)))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-08
Product exploration explored 100000 steps with 14542 reset in 102 ms.
Product exploration explored 100000 steps with 14517 reset in 107 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) p2 (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[true, (OR p0 (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR p0 (AND p1 (NOT p2))), (OR p0 (AND p1 (NOT p2))), (OR p0 (AND p1 (NOT p2)))]
RANDOM walk for 1061 steps (0 resets) in 12 ms. (81 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2)), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 1 factoid took 204 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[true, (OR p0 (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR p0 (AND p1 (NOT p2))), (OR p0 (AND p1 (NOT p2))), (OR p0 (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 229 ms :[true, (OR p0 (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR p0 (AND p1 (NOT p2))), (OR p0 (AND p1 (NOT p2))), (OR p0 (AND p1 (NOT p2)))]
Support contains 9 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 67 cols
[2025-06-02 03:57:53] [INFO ] Computed 23 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:53] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-02 03:57:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:53] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2025-06-02 03:57:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/67 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/112 variables, 67/90 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/112 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 90 constraints, problems are : Problem set: 0 solved, 44 unsolved in 935 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 67/67 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/66 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/67 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/112 variables, 67/90 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 44/134 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/112 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 134 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1196 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2136ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 2137ms
Finished structural reductions in LTL mode , in 1 iterations and 2241 ms. Remains : 67/67 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) (NOT p1) p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[true, (OR p0 (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR p0 (AND p1 (NOT p2))), (OR p0 (AND p1 (NOT p2))), (OR p0 (AND p1 (NOT p2)))]
RANDOM walk for 972 steps (0 resets) in 15 ms. (60 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2)]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2)), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 1 factoid took 214 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[true, (OR p0 (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR p0 (AND p1 (NOT p2))), (OR p0 (AND p1 (NOT p2))), (OR p0 (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 234 ms :[true, (OR p0 (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR p0 (AND p1 (NOT p2))), (OR p0 (AND p1 (NOT p2))), (OR p0 (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 216 ms :[true, (OR p0 (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR p0 (AND p1 (NOT p2))), (OR p0 (AND p1 (NOT p2))), (OR p0 (AND p1 (NOT p2)))]
Product exploration explored 100000 steps with 14204 reset in 107 ms.
Product exploration explored 100000 steps with 14567 reset in 127 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 227 ms :[true, (OR p0 (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR p0 (AND p1 (NOT p2))), (OR p0 (AND p1 (NOT p2))), (OR p0 (AND p1 (NOT p2)))]
Support contains 9 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 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 67 transition count 45
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 9 place count 67 transition count 45
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 21 place count 67 transition count 45
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 67 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 66 transition count 44
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 66 transition count 44
Deduced a syphon composed of 25 places in 0 ms
Applied a total of 28 rules in 5 ms. Remains 66 /67 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:57:57] [INFO ] Redundant transitions in 0 ms returned []
Running 43 sub problems to find dead transitions.
// Phase 1: matrix 44 rows 66 cols
[2025-06-02 03:57:57] [INFO ] Computed 23 invariants in 2 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 9/22 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:57:57] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:57:57] [INFO ] Deduced a trap composed of 1 places in 22 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:57:57] [INFO ] Deduced a trap composed of 1 places in 22 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:57:57] [INFO ] Deduced a trap composed of 1 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:57:57] [INFO ] Deduced a trap composed of 1 places in 26 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:57:57] [INFO ] Deduced a trap composed of 1 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:57:57] [INFO ] Deduced a trap composed of 1 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:57:57] [INFO ] Deduced a trap composed of 1 places in 16 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 8/30 constraints. Problems are: Problem set: 8 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:57:58] [INFO ] Deduced a trap composed of 1 places in 23 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/31 constraints. Problems are: Problem set: 9 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/31 constraints. Problems are: Problem set: 9 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/32 constraints. Problems are: Problem set: 9 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/32 constraints. Problems are: Problem set: 9 solved, 34 unsolved
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
At refinement iteration 7 (OVERLAPS) 44/110 variables, 66/98 constraints. Problems are: Problem set: 25 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/98 constraints. Problems are: Problem set: 25 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/110 variables, 0/98 constraints. Problems are: Problem set: 25 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 98 constraints, problems are : Problem set: 25 solved, 18 unsolved in 1040 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 25 solved, 18 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 2/2 constraints. Problems are: Problem set: 25 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 4/6 constraints. Problems are: Problem set: 25 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 8/14 constraints. Problems are: Problem set: 25 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/14 constraints. Problems are: Problem set: 25 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 12/50 variables, 10/24 constraints. Problems are: Problem set: 25 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 4/28 constraints. Problems are: Problem set: 25 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/28 constraints. Problems are: Problem set: 25 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 15/65 variables, 2/30 constraints. Problems are: Problem set: 25 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/30 constraints. Problems are: Problem set: 25 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 1/66 variables, 1/31 constraints. Problems are: Problem set: 25 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/66 variables, 1/32 constraints. Problems are: Problem set: 25 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/66 variables, 0/32 constraints. Problems are: Problem set: 25 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 44/110 variables, 66/98 constraints. Problems are: Problem set: 25 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/110 variables, 18/116 constraints. Problems are: Problem set: 25 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/110 variables, 0/116 constraints. Problems are: Problem set: 25 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 0/110 variables, 0/116 constraints. Problems are: Problem set: 25 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 116 constraints, problems are : Problem set: 25 solved, 18 unsolved in 498 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 18/43 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1545ms problems are : Problem set: 25 solved, 18 unsolved
Search for dead transitions found 25 dead transitions in 1545ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 66/67 places, 19/45 transitions.
Graph (complete) has 86 edges and 66 vertex of which 41 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 0 output transitions
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 31 transition count 19
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 6 place count 31 transition count 19
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 31 transition count 19
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 28 transition count 16
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 28 transition count 16
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 16 place count 28 transition count 16
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 16 rules in 6 ms. Remains 28 /66 variables (removed 38) and now considering 16/19 (removed 3) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/67 places, 16/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1567 ms. Remains : 28/67 places, 16/45 transitions.
Built C files in :
/tmp/ltsmin15921335745872109217
[2025-06-02 03:57:59] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15921335745872109217
Running compilation step : cd /tmp/ltsmin15921335745872109217;'/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 131 ms.
Running link step : cd /tmp/ltsmin15921335745872109217;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15921335745872109217;'/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/stateBased4188523590127804985.hoa' '--buchi-type=spotba'
LTSmin run took 6014 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-08 finished in 13329 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 45/45 transitions.
Ensure Unique test removed 19 places
Discarding 4 places :
Implicit places reduction removed 4 places
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 11 rules applied. Total rules applied 11 place count 70 transition count 38
Reduce places removed 12 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 22 rules applied. Total rules applied 33 place count 58 transition count 28
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 44 place count 48 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 45 place count 47 transition count 27
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 45 place count 47 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 69 place count 32 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 69 place count 32 transition count 16
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 73 place count 30 transition count 16
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 90 place count 20 transition count 9
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 91 place count 19 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 91 place count 19 transition count 8
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 94 place count 17 transition count 8
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 95 place count 17 transition count 7
Reduce places removed 2 places and 0 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 6 with 3 rules applied. Total rules applied 98 place count 15 transition count 6
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 100 place count 14 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 101 place count 13 transition count 5
Applied a total of 101 rules in 8 ms. Remains 13 /93 variables (removed 80) and now considering 5/45 (removed 40) transitions.
// Phase 1: matrix 5 rows 13 cols
[2025-06-02 03:58:05] [INFO ] Computed 9 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:58:05] [INFO ] Implicit Places using invariants in 29 ms returned [2, 8]
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 : 11/93 places, 5/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 3
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 9 transition count 3
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 7 transition count 2
Applied a total of 7 rules in 1 ms. Remains 7 /11 variables (removed 4) and now considering 2/5 (removed 3) transitions.
// Phase 1: matrix 2 rows 7 cols
[2025-06-02 03:58:05] [INFO ] Computed 6 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:58:05] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-02 03:58:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:58:05] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/93 places, 2/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 116 ms. Remains : 7/93 places, 2/45 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 87 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 3 in 1 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-10 finished in 262 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 U (G(p0)||p1)) U (G((p0 U (p1||G(p0))))||(F(!p2)&&(p0 U (p1||G(p0)))))))'
Support contains 13 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 45/45 transitions.
Ensure Unique test removed 16 places
Discarding 4 places :
Implicit places reduction removed 4 places
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 11 rules applied. Total rules applied 11 place count 73 transition count 38
Reduce places removed 11 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 19 rules applied. Total rules applied 30 place count 62 transition count 30
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 38 place count 54 transition count 30
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 38 place count 54 transition count 21
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 62 place count 39 transition count 21
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 62 place count 39 transition count 19
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 66 place count 37 transition count 19
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 83 place count 27 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 85 place count 26 transition count 11
Applied a total of 85 rules in 7 ms. Remains 26 /93 variables (removed 67) and now considering 11/45 (removed 34) transitions.
// Phase 1: matrix 11 rows 26 cols
[2025-06-02 03:58:05] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:58:05] [INFO ] Implicit Places using invariants in 33 ms returned [2, 9, 14, 21]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 34 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/93 places, 11/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 20 transition count 9
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 18 transition count 8
Applied a total of 7 rules in 2 ms. Remains 18 /22 variables (removed 4) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 18 cols
[2025-06-02 03:58:05] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:58:05] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-02 03:58:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:58:05] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/93 places, 8/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 88 ms. Remains : 18/93 places, 8/45 transitions.
Stuttering acceptance computed with spot in 171 ms :[true, p2, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND p2 (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 109 ms.
Product exploration explored 100000 steps with 50000 reset in 106 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (AND p0 p2) (AND p1 p2)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (OR (AND p0 p2) (AND p1 p2)))), (X (X (NOT (OR (AND p0 p2) (AND p1 p2)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 20 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-12 finished in 515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 45/45 transitions.
Ensure Unique test removed 21 places
Discarding 4 places :
Implicit places reduction removed 4 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 13 rules applied. Total rules applied 13 place count 68 transition count 36
Reduce places removed 15 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 27 rules applied. Total rules applied 40 place count 53 transition count 24
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 52 place count 41 transition count 24
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 52 place count 41 transition count 16
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 73 place count 28 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 73 place count 28 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 77 place count 26 transition count 14
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 9 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 92 place count 17 transition count 8
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 93 place count 16 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 93 place count 16 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 96 place count 14 transition count 7
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 4 with 1 rules applied. Total rules applied 97 place count 14 transition count 6
Reduce places removed 2 places and 0 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 5 with 3 rules applied. Total rules applied 100 place count 12 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 102 place count 10 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 102 place count 10 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 104 place count 9 transition count 4
Applied a total of 104 rules in 6 ms. Remains 9 /93 variables (removed 84) and now considering 4/45 (removed 41) transitions.
// Phase 1: matrix 4 rows 9 cols
[2025-06-02 03:58:06] [INFO ] Computed 6 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:58:06] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-02 03:58:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:58:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 03:58:06] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:58:06] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-02 03:58:06] [INFO ] Invariant cache hit.
[2025-06-02 03:58:06] [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/7 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2/9 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 4/13 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 16 constraints, problems are : Problem set: 0 solved, 3 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2/9 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 4/13 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 19 constraints, problems are : Problem set: 0 solved, 3 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 104ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 104ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/93 places, 4/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 167 ms. Remains : 9/93 places, 4/45 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 93 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-13 finished in 317 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(F(p1))))))'
Support contains 6 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 45/45 transitions.
Ensure Unique test removed 21 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 68 transition count 45
Applied a total of 25 rules in 1 ms. Remains 68 /93 variables (removed 25) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 68 cols
[2025-06-02 03:58:06] [INFO ] Computed 24 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:58:06] [INFO ] Implicit Places using invariants in 44 ms returned [15, 18, 23]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 45 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 65/93 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 65 /65 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46 ms. Remains : 65/93 places, 45/45 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-15
Product exploration explored 100000 steps with 2171 reset in 121 ms.
Product exploration explored 100000 steps with 2173 reset in 137 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 88 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 224 steps (0 resets) in 6 ms. (32 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 45 rows 65 cols
[2025-06-02 03:58:07] [INFO ] Computed 21 invariants in 0 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:58:07] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 03:58:07] [INFO ] [Real]Absence check using 16 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 03:58:07] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-02 03:58:07] [INFO ] Computed and/alt/rep : 44/48/44 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 03:58:07] [INFO ] Added : 11 causal constraints over 3 iterations in 23 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 65 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 : 65/65 places, 45/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 65 transition count 37
Reduce places removed 13 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 21 rules applied. Total rules applied 29 place count 52 transition count 29
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 38 place count 44 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 43 transition count 28
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 39 place count 43 transition count 18
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 63 place count 29 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 63 place count 29 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 69 place count 26 transition count 15
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 9 places and 0 transitions.
Iterating global reduction 4 with 15 rules applied. Total rules applied 84 place count 17 transition count 9
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 85 place count 16 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 85 place count 16 transition count 8
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 88 place count 14 transition count 8
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 89 place count 14 transition count 7
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 92 place count 12 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 93 place count 11 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 95 place count 10 transition count 5
Applied a total of 95 rules in 4 ms. Remains 10 /65 variables (removed 55) and now considering 5/45 (removed 40) transitions.
// Phase 1: matrix 5 rows 10 cols
[2025-06-02 03:58:07] [INFO ] Computed 6 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:58:07] [INFO ] Implicit Places using invariants in 25 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/65 places, 5/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31 ms. Remains : 9/65 places, 5/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 : [(NOT p1), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 5 rows 9 cols
[2025-06-02 03:58:08] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:58:08] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 03:58:08] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2025-06-02 03:58:08] [INFO ] Computed and/alt/rep : 4/7/4 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 03:58:08] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 7859 reset in 89 ms.
Product exploration explored 100000 steps with 7853 reset in 73 ms.
Built C files in :
/tmp/ltsmin3530202934182855046
[2025-06-02 03:58:08] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2025-06-02 03:58:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 03:58:08] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2025-06-02 03:58:08] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 03:58:08] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2025-06-02 03:58:08] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 03:58:08] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3530202934182855046
Running compilation step : cd /tmp/ltsmin3530202934182855046;'/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 78 ms.
Running link step : cd /tmp/ltsmin3530202934182855046;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3530202934182855046;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8911129888980365087.hoa' '--buchi-type=spotba'
LTSmin run took 49 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-15 finished in 2172 ms.
All properties solved by simple procedures.
Total runtime 51733 ms.

BK_STOP 1748836688650

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is IOTPpurchase-PT-C12M10P15D17, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-tall-174876422600388"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;