Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K 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 2.2K 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 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 17K 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 DoubleExponent-PT-001-LTLCardinality-00
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-01
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-02
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-03
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-04
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-05
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-06
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-07
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-08
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-09
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-10
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-11
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-12
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-13
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-14
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748727267848

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-31 21:34:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 21:34:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 21:34:29] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2025-05-31 21:34:29] [INFO ] Transformed 57 places.
[2025-05-31 21:34:29] [INFO ] Transformed 48 transitions.
[2025-05-31 21:34:29] [INFO ] Parsed PT model containing 57 places and 48 transitions and 135 arcs in 146 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA DoubleExponent-PT-001-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 48/48 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 56 transition count 48
Applied a total of 1 rules in 15 ms. Remains 56 /57 variables (removed 1) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 56 cols
[2025-05-31 21:34:29] [INFO ] Computed 8 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:34:29] [INFO ] Implicit Places using invariants in 178 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 211 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/57 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 240 ms. Remains : 55/57 places, 48/48 transitions.
Support contains 32 out of 55 places after structural reductions.
[2025-05-31 21:34:29] [INFO ] Flatten gal took : 17 ms
[2025-05-31 21:34:29] [INFO ] Flatten gal took : 7 ms
[2025-05-31 21:34:29] [INFO ] Input system was already deterministic with 48 transitions.
RANDOM walk for 40000 steps (1338 resets) in 1049 ms. (38 steps per ms) remains 10/25 properties
BEST_FIRST walk for 40000 steps (1129 resets) in 433 ms. (92 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1148 resets) in 527 ms. (75 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1129 resets) in 156 ms. (254 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1139 resets) in 310 ms. (128 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1133 resets) in 209 ms. (190 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1212 resets) in 216 ms. (184 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1140 resets) in 163 ms. (243 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1134 resets) in 134 ms. (296 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1157 resets) in 114 ms. (347 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1187 resets) in 145 ms. (273 steps per ms) remains 10/10 properties
// Phase 1: matrix 48 rows 55 cols
[2025-05-31 21:34:30] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 1 (OVERLAPS) 35/54 variables, 4/4 constraints. Problems are: Problem set: 7 solved, 3 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/6 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/6 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/55 variables, 1/7 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/7 constraints. Problems are: Problem set: 8 solved, 2 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 6 (OVERLAPS) 48/103 variables, 55/62 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/62 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/103 variables, 0/62 constraints. Problems are: Problem set: 9 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 62 constraints, problems are : Problem set: 9 solved, 1 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 1 unsolved
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Int declared 49/103 variables, and 3 constraints, problems are : Problem set: 10 solved, 0 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 3/4 constraints, Generalized P Invariants (flows): 0/3 constraints, State Equation: 0/55 constraints, PredecessorRefiner: 0/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 219ms problems are : Problem set: 10 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 10 atomic propositions for a total of 10 simplifications.
FORMULA DoubleExponent-PT-001-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 83 edges and 55 vertex of which 50 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
FORMULA DoubleExponent-PT-001-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((F(p0) U p1)||X(X(F(!p0))))))'
Support contains 3 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 48/48 transitions.
Graph (complete) has 83 edges and 55 vertex of which 52 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 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 0 with 10 rules applied. Total rules applied 11 place count 51 transition count 37
Reduce places removed 10 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 41 transition count 35
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 25 place count 39 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 25 place count 39 transition count 34
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 27 place count 38 transition count 34
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 45 place count 29 transition count 25
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 47 place count 29 transition count 25
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 28 transition count 24
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 28 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 27 transition count 23
Applied a total of 50 rules in 31 ms. Remains 27 /55 variables (removed 28) and now considering 23/48 (removed 25) transitions.
// Phase 1: matrix 23 rows 27 cols
[2025-05-31 21:34:31] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:34:31] [INFO ] Implicit Places using invariants in 34 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/55 places, 23/48 transitions.
Graph (complete) has 59 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 24 transition count 21
Applied a total of 3 rules in 2 ms. Remains 24 /26 variables (removed 2) and now considering 21/23 (removed 2) transitions.
// Phase 1: matrix 21 rows 24 cols
[2025-05-31 21:34:31] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:34:31] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-05-31 21:34:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:34:31] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/55 places, 21/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 155 ms. Remains : 24/55 places, 21/48 transitions.
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : DoubleExponent-PT-001-LTLCardinality-00
Product exploration explored 100000 steps with 10490 reset in 178 ms.
Product exploration explored 100000 steps with 10537 reset in 112 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 56 edges and 24 vertex of which 23 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 83 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
RANDOM walk for 40000 steps (3130 resets) in 122 ms. (325 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (2213 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
[2025-05-31 21:34:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/29 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/31 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 13/44 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/44 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/44 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/44 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 45/45 variables, and 28 constraints, problems are : Problem set: 1 solved, 0 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 81ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1)), (G (OR p1 (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 13 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-001-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-001-LTLCardinality-00 finished in 1021 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)))'
Support contains 2 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 48/48 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 52 transition count 48
Applied a total of 3 rules in 2 ms. Remains 52 /55 variables (removed 3) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 52 cols
[2025-05-31 21:34:32] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:34:32] [INFO ] Implicit Places using invariants in 43 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/55 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47 ms. Remains : 51/55 places, 48/48 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-001-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 98 ms.
Product exploration explored 100000 steps with 50000 reset in 93 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 77 edges and 51 vertex of which 49 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-001-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-001-LTLCardinality-03 finished in 315 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||X(p1)))))'
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 48/48 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 52 transition count 48
Applied a total of 3 rules in 2 ms. Remains 52 /55 variables (removed 3) and now considering 48/48 (removed 0) transitions.
[2025-05-31 21:34:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:34:32] [INFO ] Implicit Places using invariants in 33 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/55 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 47
Applied a total of 2 rules in 3 ms. Remains 50 /51 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 50 cols
[2025-05-31 21:34:32] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:34:32] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-05-31 21:34:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:34:32] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/55 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 186 ms. Remains : 50/55 places, 47/48 transitions.
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-001-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-001-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLCardinality-07 finished in 409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 48/48 transitions.
Graph (complete) has 83 edges and 55 vertex of which 52 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 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 0 with 10 rules applied. Total rules applied 11 place count 51 transition count 37
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 41 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 40 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 23 place count 40 transition count 35
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 39 transition count 35
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 47 place count 28 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 27 transition count 23
Applied a total of 48 rules in 12 ms. Remains 27 /55 variables (removed 28) and now considering 23/48 (removed 25) transitions.
// Phase 1: matrix 23 rows 27 cols
[2025-05-31 21:34:33] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:34:33] [INFO ] Implicit Places using invariants in 26 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/55 places, 23/48 transitions.
Graph (complete) has 56 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 24 transition count 21
Applied a total of 3 rules in 2 ms. Remains 24 /26 variables (removed 2) and now considering 21/23 (removed 2) transitions.
// Phase 1: matrix 21 rows 24 cols
[2025-05-31 21:34:33] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:34:33] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-05-31 21:34:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:34:33] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/55 places, 21/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 122 ms. Remains : 24/55 places, 21/48 transitions.
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-001-LTLCardinality-09
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-001-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLCardinality-09 finished in 221 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 48/48 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 52 transition count 48
Applied a total of 3 rules in 3 ms. Remains 52 /55 variables (removed 3) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 52 cols
[2025-05-31 21:34:33] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:34:33] [INFO ] Implicit Places using invariants in 37 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/55 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 47
Applied a total of 2 rules in 2 ms. Remains 50 /51 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 50 cols
[2025-05-31 21:34:33] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:34:33] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-05-31 21:34:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:34:33] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/55 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 135 ms. Remains : 50/55 places, 47/48 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-001-LTLCardinality-10
Product exploration explored 100000 steps with 25000 reset in 80 ms.
Product exploration explored 100000 steps with 25000 reset in 94 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Graph (complete) has 76 edges and 50 vertex of which 48 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 70 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 123 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 6069 steps (207 resets) in 21 ms. (275 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 76 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 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 47/47 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2025-05-31 21:34:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:34:34] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-05-31 21:34:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:34:34] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Running 46 sub problems to find dead transitions.
[2025-05-31 21:34:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:34:35] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:34:35] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 47/97 variables, 50/56 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:34:35] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:34:35] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 0/97 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/97 variables, and 58 constraints, problems are : Problem set: 0 solved, 46 unsolved in 2002 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 47/97 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 46/104 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:34:37] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:34:37] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:34:38] [INFO ] Deduced a trap along path composed of 13 places in 27 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/97 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/97 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 12 (OVERLAPS) 0/97 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/97 variables, and 107 constraints, problems are : Problem set: 0 solved, 46 unsolved in 4398 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 6408ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 6408ms
Finished structural reductions in LTL mode , in 1 iterations and 6504 ms. Remains : 50/50 places, 47/47 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Graph (complete) has 76 edges and 50 vertex of which 48 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 75 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 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 2746 steps (91 resets) in 13 ms. (196 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 80 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 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 51 ms.
Product exploration explored 100000 steps with 25000 reset in 52 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 47/47 transitions.
Graph (complete) has 76 edges and 50 vertex of which 49 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 49 transition count 46
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 12 place count 49 transition count 47
Deduced a syphon composed of 15 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 49 transition count 47
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 20 place count 45 transition count 43
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 45 transition count 43
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 35 place count 45 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 44 transition count 44
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 44 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 44 transition count 49
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 41 transition count 43
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 41 transition count 43
Deduced a syphon composed of 20 places in 0 ms
Applied a total of 45 rules in 16 ms. Remains 41 /50 variables (removed 9) and now considering 43/47 (removed 4) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 21:34:42] [INFO ] Redundant transitions in 0 ms returned []
Running 42 sub problems to find dead transitions.
// Phase 1: matrix 43 rows 41 cols
[2025-05-31 21:34:42] [INFO ] Computed 4 invariants in 1 ms
[2025-05-31 21:34:42] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:34:42] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:34:42] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 41 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
At refinement iteration 6 (OVERLAPS) 43/84 variables, 41/47 constraints. Problems are: Problem set: 25 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 2/49 constraints. Problems are: Problem set: 25 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:34:42] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 1/50 constraints. Problems are: Problem set: 25 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 0/50 constraints. Problems are: Problem set: 25 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/84 variables, 0/50 constraints. Problems are: Problem set: 25 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/84 variables, and 50 constraints, problems are : Problem set: 25 solved, 17 unsolved in 699 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 41/41 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 25 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 25 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 10/30 variables, 2/2 constraints. Problems are: Problem set: 25 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 3/5 constraints. Problems are: Problem set: 25 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 25 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 3/33 variables, 2/7 constraints. Problems are: Problem set: 25 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/7 constraints. Problems are: Problem set: 25 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 43/76 variables, 33/40 constraints. Problems are: Problem set: 25 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 2/42 constraints. Problems are: Problem set: 25 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 17/59 constraints. Problems are: Problem set: 25 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 0/59 constraints. Problems are: Problem set: 25 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 8/84 variables, 8/67 constraints. Problems are: Problem set: 25 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:34:43] [INFO ] Deduced a trap along path composed of 9 places in 19 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/84 variables, 1/68 constraints. Problems are: Problem set: 25 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/84 variables, 0/68 constraints. Problems are: Problem set: 25 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 0/84 variables, 0/68 constraints. Problems are: Problem set: 25 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/84 variables, and 68 constraints, problems are : Problem set: 25 solved, 17 unsolved in 962 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 41/41 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 17/42 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1670ms problems are : Problem set: 25 solved, 17 unsolved
Search for dead transitions found 25 dead transitions in 1671ms
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 : 41/50 places, 18/47 transitions.
Graph (complete) has 56 edges and 41 vertex of which 21 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 21 /41 variables (removed 20) and now considering 18/18 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/50 places, 18/47 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1696 ms. Remains : 21/50 places, 18/47 transitions.
Built C files in :
/tmp/ltsmin10227336801244075595
[2025-05-31 21:34:43] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10227336801244075595
Running compilation step : cd /tmp/ltsmin10227336801244075595;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 223 ms.
Running link step : cd /tmp/ltsmin10227336801244075595;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin10227336801244075595;'/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/stateBased16341087431508431733.hoa' '--buchi-type=spotba'
LTSmin run took 1714 ms.
FORMULA DoubleExponent-PT-001-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-001-LTLCardinality-10 finished in 12390 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&&F(p1))) U X(X(G((G(p1) U p2))))))'
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 48/48 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 52 transition count 48
Applied a total of 3 rules in 2 ms. Remains 52 /55 variables (removed 3) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 52 cols
[2025-05-31 21:34:45] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:34:45] [INFO ] Implicit Places using invariants in 37 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/55 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 47
Applied a total of 2 rules in 3 ms. Remains 50 /51 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 50 cols
[2025-05-31 21:34:45] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:34:45] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-05-31 21:34:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:34:45] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/55 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 122 ms. Remains : 50/55 places, 47/48 transitions.
Stuttering acceptance computed with spot in 563 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-001-LTLCardinality-11
Stuttering criterion allowed to conclude after 12467 steps with 3106 reset in 24 ms.
FORMULA DoubleExponent-PT-001-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLCardinality-11 finished in 741 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||X((G((p1||X(p2))) U (p1&&G((p1||X(p2))))))))))'
Support contains 5 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 48/48 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 52 transition count 48
Applied a total of 3 rules in 1 ms. Remains 52 /55 variables (removed 3) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 52 cols
[2025-05-31 21:34:46] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:34:46] [INFO ] Implicit Places using invariants in 30 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/55 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41 ms. Remains : 51/55 places, 48/48 transitions.
Stuttering acceptance computed with spot in 339 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-001-LTLCardinality-15
Product exploration explored 100000 steps with 16331 reset in 66 ms.
Product exploration explored 100000 steps with 16202 reset in 128 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 77 edges and 51 vertex of which 49 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 96 ms. Reduced automaton from 10 states, 23 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true]
RANDOM walk for 8934 steps (302 resets) in 11 ms. (744 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p2))]
Knowledge based reduction with 11 factoid took 174 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true]
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true]
// Phase 1: matrix 48 rows 51 cols
[2025-05-31 21:34:47] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 21:34:47] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 21:34:47] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-31 21:34:48] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-05-31 21:34:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 21:34:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-05-31 21:34:48] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-31 21:34:48] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:34:48] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 3 ms to minimize.
[2025-05-31 21:34:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2025-05-31 21:34:48] [INFO ] Computed and/alt/rep : 47/84/47 causal constraints (skipped 0 transitions) in 3 ms.
[2025-05-31 21:34:48] [INFO ] Added : 41 causal constraints over 9 iterations in 107 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 51 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2025-05-31 21:34:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:34:48] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-05-31 21:34:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:34:48] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 47 sub problems to find dead transitions.
[2025-05-31 21:34:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:34:48] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:34:48] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 48/99 variables, 51/57 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:34:48] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:34:48] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/99 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 59 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1362 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 48/99 variables, 51/59 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 47/106 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:34:50] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:34:50] [INFO ] Deduced a trap along path composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (OVERLAPS) 0/99 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 108 constraints, problems are : Problem set: 0 solved, 47 unsolved in 3321 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4693ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 4693ms
Finished structural reductions in LTL mode , in 1 iterations and 4769 ms. Remains : 51/51 places, 48/48 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 77 edges and 51 vertex of which 49 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true]
RANDOM walk for 4918 steps (163 resets) in 12 ms. (378 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p2), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p2))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true]
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true]
[2025-05-31 21:34:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 21:34:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 21:34:53] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-31 21:34:53] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-05-31 21:34:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 21:34:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 21:34:53] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-31 21:34:53] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:34:53] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 2 ms to minimize.
[2025-05-31 21:34:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2025-05-31 21:34:53] [INFO ] Computed and/alt/rep : 47/84/47 causal constraints (skipped 0 transitions) in 4 ms.
[2025-05-31 21:34:54] [INFO ] Added : 41 causal constraints over 9 iterations in 112 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true]
Product exploration explored 100000 steps with 16343 reset in 58 ms.
Product exploration explored 100000 steps with 16270 reset in 65 ms.
Applying partial POR strategy [false, false, false, true, false, true]
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true]
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 48/48 transitions.
Graph (complete) has 77 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 50 transition count 47
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 10 place count 50 transition count 48
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 50 transition count 48
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 46 transition count 44
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 46 transition count 44
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 28 place count 46 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 45 transition count 44
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 45 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 45 transition count 46
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 43 transition count 42
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 43 transition count 42
Deduced a syphon composed of 13 places in 0 ms
Applied a total of 35 rules in 13 ms. Remains 43 /51 variables (removed 8) and now considering 42/48 (removed 6) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 21:34:54] [INFO ] Redundant transitions in 0 ms returned []
Running 41 sub problems to find dead transitions.
// Phase 1: matrix 42 rows 43 cols
[2025-05-31 21:34:54] [INFO ] Computed 4 invariants in 0 ms
[2025-05-31 21:34:54] [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/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:34:54] [INFO ] Deduced a trap composed of 3 places in 26 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-05-31 21:34:54] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 40 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
At refinement iteration 6 (OVERLAPS) 42/85 variables, 43/49 constraints. Problems are: Problem set: 15 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 1/50 constraints. Problems are: Problem set: 15 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:34:55] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:34:55] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:34:55] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 3/53 constraints. Problems are: Problem set: 15 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 0/53 constraints. Problems are: Problem set: 15 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 0/85 variables, 0/53 constraints. Problems are: Problem set: 15 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 85/85 variables, and 53 constraints, problems are : Problem set: 15 solved, 26 unsolved in 881 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 43/43 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 26 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 15 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 15 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 9/38 variables, 2/3 constraints. Problems are: Problem set: 15 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 1/4 constraints. Problems are: Problem set: 15 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 5/9 constraints. Problems are: Problem set: 15 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/9 constraints. Problems are: Problem set: 15 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 42/80 variables, 38/47 constraints. Problems are: Problem set: 15 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 1/48 constraints. Problems are: Problem set: 15 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 26/74 constraints. Problems are: Problem set: 15 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 0/74 constraints. Problems are: Problem set: 15 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 5/85 variables, 5/79 constraints. Problems are: Problem set: 15 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:34:56] [INFO ] Deduced a trap along path composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/85 variables, 1/80 constraints. Problems are: Problem set: 15 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:34:56] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/85 variables, 1/81 constraints. Problems are: Problem set: 15 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/85 variables, 0/81 constraints. Problems are: Problem set: 15 solved, 26 unsolved
At refinement iteration 14 (OVERLAPS) 0/85 variables, 0/81 constraints. Problems are: Problem set: 15 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 85/85 variables, and 81 constraints, problems are : Problem set: 15 solved, 26 unsolved in 1691 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 43/43 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 26/41 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2591ms problems are : Problem set: 15 solved, 26 unsolved
Search for dead transitions found 15 dead transitions in 2591ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 43/51 places, 27/48 transitions.
Graph (complete) has 63 edges and 43 vertex of which 30 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 30 /43 variables (removed 13) and now considering 27/27 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 30/51 places, 27/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2612 ms. Remains : 30/51 places, 27/48 transitions.
Built C files in :
/tmp/ltsmin5991209646957634942
[2025-05-31 21:34:57] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5991209646957634942
Running compilation step : cd /tmp/ltsmin5991209646957634942;'/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 110 ms.
Running link step : cd /tmp/ltsmin5991209646957634942;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5991209646957634942;'/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/stateBased13548082983445813566.hoa' '--buchi-type=spotba'
LTSmin run took 139 ms.
FORMULA DoubleExponent-PT-001-LTLCardinality-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-001-LTLCardinality-15 finished in 11046 ms.
All properties solved by simple procedures.
Total runtime 28497 ms.

BK_STOP 1748727297601

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-001.tgz
mv DoubleExponent-PT-001 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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